A Tabu Search Heuristic for the Generalized Traveling Salesman Problem


 Meryl Hudson
 11 months ago
 Views:
Transcription
1 A Tabu Search Heuristic for the Generalized Traveling Salesman Problem Jacques Renaud 1,2 Frédéric Semet 3,4 1. Université Laval 2. Centre de Recherche sur les Technologies de l Organisation Réseau 3. Laboratoire d Automatique et de Mécanique Industrielles et Humaines, Université de Valenciennes 4. Centre de Recherche sur les Transports, Université de Montréal Presentation Outline 1. Definition 2. Literature review 3. The proposed tabu search heuristic 4. Computational results 5. Conclusions ASAC 2004, Québec
2 Problem definition The Generalized Traveling Salesman Problem (GTSP) In the GTSP, the traveling salesman must pass through a number of predefined subsets of customers, visiting at least one customer in each subset, while minimizing the subtour traveling cost. Two decision levels: 1) In which order the subsets should be visited, 2) Which customer(s) to visit in each subset. ASAC 2004, Québec
3 Problem definition The Symmetric GTSP Let G =(V, A) be a graph, where V = {v 1,..., v n } is the vertex set, and A = {(v i, v j ): i < j, v i, v j V} is the edge set. A cost or distance matrix C =(c ij ) is defined on A. We also consider the case where the set V is partitioned into m mutually exclusive and exhaustive clusters V 1,..., V m. The objective is to determine the least cost Hamiltonian cycle containing exactly one vertex from each cluster.
4 Problem definition The Symmetric GTSP The GTSP is clearly NPhard since it reduces to the standard Traveling Salesman Problem (TSP) when m = n, i.e. V h =1 h. Selected readings about the TSP can be found in Laporte and Osman (1995) and in Laporte (1992).
5 Literature Review Srivastava et al (1969) HenryLabordere (1969) Saksena (1970) Laporte and Nobert (1983) Laporte et al (1987) Noon (1988) Noon and Bean (1991) Sepehri (1991) Noon and Bean (1993) Fischetti et al (1997) Dymanic programming (SGTSP) Dymanic programming (AGTSP) Dynamic programming Branch and bound (SGTSP) Branch and bound (AGTSP) Thesis, transformations, exact and heuristic algorithms Branch and bound (AGTSP) Thesis, SGTSP Transformation of the AGTSP into a Clustered TSP Transformation of the GTSP into an asymmetrical TSP (optimal solution) Branch and cut, benchmark problems up to 442 nodes Renaud and Boctor (1998) Composite heuristic GI 3. In average at 1% above the optimal solution.
6 Literature Review Applications HenryLabordere (1969) First industrial application of a GTSP for the optimal sequencing of computer files. Noon (1988)  Warehouse order picking  Airport selection and routing for courier planes Saksena (1970) Application in the field of scheduling Laporte et al (1995)  locationrouting problems,  material flow system design,  postbox collection,  stochastic vehicle routing and arc routing.
7 A small example ASAC 2004, Québec
8 An observation If the visit order of the cluster is fixed, the optimal selection of nodes to be visited is easily solved by some shortest path sub problems where links are only defined between the nodes of two consecutive clusters. This suggest that it may be interesting to work only with clusters.
9 The Tabu Search Algorithm Components of the tabu search algorithm:  Division of the clusters into subgroups,  Initial Solution procedure,  Neighborhood structure,  Evaluation of candidate moves, Tabustatus,  Intensification phase,  The global tabu search algorithm. ASAC 2004, Québec
10 The Tabu Search Algorithm Division of the clusters into subgroups Each cluster V h is divided into a number of mutually exclusive and exhaustive subgroups W hk, k=1,, p h where p h is the number of subgroups within cluster V h. Let w hk, be the representative vertex of subgroup W hk. The tabu search algorithm works with the representative vertices.
11 The Tabu Search Algorithm Division of the clusters into subgroups Define the dispersion index of subgroup W hk as : 1 cij if Whk > 1 Γ( W ) W ( W ) hk = hk hk 1 vi, vj Vhk 0 if Whk = 1 Let the proximity measure between two non empty subgroup W hk and W hk of V h be : 2 ( Whk, Whl ) = cij Γ( Whk ) Γ( Whl ) W W hk hl v v i j W W hk hl
12 The Tabu Search Algorithm Division of the clusters into subgroups First, we consider each vertex v 1, v 2, v 3,..., v k V h as an individual subgroup. Then, at each iteration, the two subgroups W hk and W hl, for which (W hk, W hl ) is minimum, are merged together to form a larger subgroup; let W hk be that new subgroup. This process is repeated as long as: Γ( W hk ) γ Γ( V ) h where is a specified used parameter set to 0.75 in this study. ASAC 2004, Québec
13 The Tabu Search Algorithm Division of the clusters into subgroups The representative vertex w hk of subgroup W hk within cluster V h is selected as the nearest vertex to the center of gravity of subgroup W hk. We construct also a circular list in which the subgroup vertices are sorted in increasing distance from the center of gravity (in such a list, the first vertex is considering following the last one).
14 The Tabu Search Algorithm Division of the clusters into subgroups Cluster 1 In this example, the information of a 40 vertices problem can be summarized within 7 representing vertices. Cluster 3 Cluster 2 Vertex Representing vertex Subgroup ASAC 2004, Québec
15 The Tabu Search Algorithm Initial Solution procedure Phase 1 : Nearest node heuristic Starting with a given representative vertex, the next representative vertex to be added is the nearest representative vertex, among those belonging to nonvisited clusters, to the last representative vertex. Phase 2 : TSP : GENIUS based improvement procedure This solution is improved by using the GENIUS TSP algorithm (Gendreau, Hertz and Laporte, 1992). GENIUS is applied on the set of vertices which are in the current solution. For each cluster order, the optimal tour is found by solving the related shortest paths. ASAC 2004, Québec
16 Neighborhood structure The Tabu Search Algorithm Let T = {v 1,..., v q } be a tour which can be either feasible or unfeasible. T is unfeasible if some clusters are not visited and/or if some clusters are visited more than once. Let L(T) be the length of T. The neighbors of T are other solutions T obtained either by i) removing a vertex which is currently on the tour, or by ii) adding a representative vertex into the current tour. ASAC 2004, Québec
17 The Tabu Search Algorithm Evaluation of candidate moves DELETION of a vertex v i which is currently on the tour If the cluster of v i is visited at least twice then f(v i )= L(T\{v i })L(T) α. If v i is the only vertex visited in its cluster then f(v i )=L(T\{v i })L(T) +α. α is a penalty parameter which helps to maintain the feasibility of the solution. Initially, α is set to 0.09 L(Tinit) where Tinit is the initial solution. ASAC 2004, Québec
18 The Tabu Search Algorithm Evaluation of candidate moves ADDING a representative vertex v j into the current tour If the cluster of v j is visited at least once then g(v j )=(L(T {v j })L(T)+α) β j. If the cluster of v j has not yet been visited then g(v j )=(L(T {v j })L(T) α) β j. The parameter β j is a diversification parameter which penalizes repetitive insertion of the representative vertex v j into the solution. The best move is : Min Min( f ( vi ), Min( g( v j ) i j ASAC 2004, Québec
19 The Tabu Search Algorithm Tabu status We define as tabu the reinsertion in the solution of all vertices that have been removed from the tour at the end of the previous iteration. The number of iterations for which a vertex is declared tabu is randomly selected in : [ n, 2 n] Such long tabu restrictions enabled the algorithm to explore new solution spaces and helped to avoid cycling.
20 The Tabu Search Algorithm Intensification phase This phase works on a restricted problem composed of the vertices of the subgroups currently visited. At each iteration, 1) moves are evaluated as before and 2) the GENIUSbased improvement procedure is used after each insertion. These steps are repeated for 30 iterations. Finally, during the intensification phase, the tabu restrictions are randomly selected between [2, 4].
21 The Tabu Search Algorithm Detailed description of the algorithm Step 1. Initial solution, initialization and representative vertices determination Set α := 0.09 L(T) and the iteration counter t := 1. Set n α, the adjusting frequency of α, as n α := m and the diversification frequency as D := iterations. Step 2. Best move determination Let T be the new solution. All removed vertices (T \ T ) are declared tabu. Set T :=T. Step 3. Best solution update If L(T) L(T*) and T is a feasible solution, then T* :=T, t*:=t and apply the intensification phase. Step 4. Diversification phase If the best solution has not been improved over the last D iterations, diversify the search by changing the representative vertices. Step 5. Penalty update If the last n α solutions have been feasible, set α := α/µ otherwise set α := αµ where µ is randomly selected in [1.5, 2]. Step 6. Stopping criterion Set t := t+1. If t = t* stop, otherwise go to Step 2.
22 Test problems Results We use the 36 Fischetti, Gonzalez and Toth (1997) benchmark problems for which the optimal solutions are known. The tabu search is compared with the GI 3 construction algorithm (Renaud and Boctor 1998). The tabu search algorithm has been calibrated carefully (results not presented).
23 Results % above the optimum Problems GI 3 Proposed Tabu Search Method Initial Solution Average Best Seconds EIL51 ST70 EIL76 PR76 RAT99 KROA100 KROB100 KROC100 KROD100 KROE100 RD100 EIL101 LIN105 PR107 PR124 BIER127 PR136 PR
24 Results % above the optimum Problems GI 3 Proposed Tabu Search Method Initial Solution Average Best Seconds KROA150 KROB150 PR152 U159 RAT195 D198 KROA200 KROB200 TS225 PR226 GIL262 PR264 PR299 LIN318 RD400 FL417 PR439 PCB Average Nb. of optimum
25 Results Summary of main results GI 3 (Renaud and Boctor) is at 0,99% above the optimum. The average deviation over 3 runs of the tabu search is 0,39%. If we took the best solution over the three runs, the average deviation of 0,20%.
26 Conclusion This tabu search algorithm that takes advantage of the problem configuration to guide the search and reduce the solutions space. The algorithm has been shown to be quite robust and improves over the best algorithm available. It obtains solutions which are, on average, within 0.4% of the optimum.
Complete Local Search with Memory
Complete Local Search with Memory Diptesh Ghosh Gerard Sierksma SOMtheme A Primary Processes within Firms Abstract Neighborhood search heuristics like local search and its variants are some of the most
More informationVladimir Dimitrijevic, Milan Milosavljevic, Milan Markovic. as: nd a minimum cost cycle which includes exactly one vertex from each
Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 7 (1996), 31{35. A BRANCH AND BOUND ALGORITHM FOR SOLVING A GENERALIZED TRAVELING SALESMAN PROBLEM Vladimir Dimitrijevic, Milan Milosavljevic, Milan Markovic
More informationVehicle Routing Heuristic Methods
DM87 SCHEDULING, TIMETABLING AND ROUTING Outline 1. Construction Heuristics for VRPTW Lecture 19 Vehicle Routing Heuristic Methods 2. Local Search 3. Metaheuristics Marco Chiarandini 4. Other Variants
More informationRegensburger DISKUSSIONSBEITRÄGE zur Wirtschaftswissenschaft
Regensburger DISKUSSIONSBEITRÄGE zur Wirtschaftswissenschaft A Cluster Based Scatter Search Heuristic for the Vehicle Routing Problem University of Regensburg Discussion Papers in Economics No. 415, November
More informationA NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
TWMS J. App. Eng. Math. V.7, N.1, 2017, pp. 101109 A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM F. NURIYEVA 1, G. KIZILATES 2, Abstract. The Multiple Traveling Salesman Problem (mtsp)
More informationModified Order Crossover (OX) Operator
Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.
More informationAlgorithms and Experimental Study for the Traveling Salesman Problem of Second Order. Gerold Jäger
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order Gerold Jäger joint work with Paul Molitor University HalleWittenberg, Germany August 22, 2008 Overview 1 Introduction
More informationA PolynomialTime Deterministic Approach to the Traveling Salesperson Problem
A PolynomialTime Deterministic Approach to the Traveling Salesperson Problem Ali Jazayeri and Hiroki Sayama Center for Collective Dynamics of Complex Systems Department of Systems Science and Industrial
More informationto the Traveling Salesman Problem 1 Susanne Timsj Applied Optimization and Modeling Group (TOM) Department of Mathematics and Physics
An Application of Lagrangian Relaxation to the Traveling Salesman Problem 1 Susanne Timsj Applied Optimization and Modeling Group (TOM) Department of Mathematics and Physics M lardalen University SE721
More informationAn Efficient Heuristic for Reliability Design Optimization Problems
An Efficient Heuristic for Reliability Design Optimization Problems Mohamed Ouzineb Mustapha Nourelfath Michel Gendreau February 2009 Mohamed Ouzineb 1,2, Mustapha Nourelfath 1,3,*, Michel Gendreau 1,2
More informationTraveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost
Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R
More informationTraveling Salesman Problem. Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij
Traveling Salesman Problem Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij 1 Contents TSP and its applications Heuristics and approximation algorithms Construction heuristics,
More informationOutline. Optimales Recycling  Tourenplanung in der Altglasentsorgung
1 Optimales Recycling  RuhrUniversität Bochum, 15.02.2013 2 1. Introduction and Motivation 2. Problem Definition 3. Literature Review 4. Mathematical Model 5. Variable Neighborhood Search 6. Numerical
More informationSolving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System
I J PME International Journal of Production Management and Engineering doi:10.4995/ijpme.2016.4618 Received 20160201 Accepted: 20160531 Solving the Traveling Salesman Problem Based on The Genetic Reactive
More informationModule 6 NPComplete Problems and Heuristics
Module 6 NPComplete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 97 Email: natarajan.meghanathan@jsums.edu Optimization vs. Decision
More informationA simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints
A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints Sohaib Afifi 1, DucCuong Dang 1,2, and Aziz Moukrim 1 1 Université de Technologie de Compiègne
More informationGenetic Algorithm Solving Orienteering Problem in Large Networks
28 Advances in KnowledgeBased and Intelligent Information and Engineering Systems M. Graña et al. (Eds.) IOS Press, 2012 2012 The authors and IOS Press. All rights reserved. doi:10.3233/978161499105228
More informationA Comparative Study of Tabu Search and Simulated Annealing for Traveling Salesman Problem. Project Report Applied Optimization MSCI 703
A Comparative Study of Tabu Search and Simulated Annealing for Traveling Salesman Problem Project Report Applied Optimization MSCI 703 Submitted by Sachin Jayaswal Student ID: 20186226 Department of Management
More informationEfficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
4ORQ J Oper Res (2011) 9:189 209 DOI 10.1007/s1028801101530 RESEARCH PAPER Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem Amir Salehipour Kenneth Sörensen Peter
More informationSolving the Maximum Cardinality Bin Packing Problem with a Weight AnnealingBased Algorithm
Solving the Maximum Cardinality Bin Packing Problem with a Weight AnnealingBased Algorithm KokHua Loh Nanyang Technological University Bruce Golden University of Maryland Edward Wasil American University
More informationNew Genetic Operators for Solving TSP: Application to Microarray Gene Ordering
New Genetic Operators for Solving TSP: Application to Microarray Gene Ordering Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, and Sankar K. Pal Machine Intelligence Unit, Indian Statistical Institute,
More informationThe multidepot vehicle routing problem with interdepot routes
European Journal of Operational Research 176 (2007) 756 773 Discrete Optimization The multidepot vehicle routing problem with interdepot routes Benoit Crevier, JeanFrançois Cordeau, Gilbert Laporte
More informationA HEURISTIC COLUMN GENERATION METHOD FOR THE HETEROGENEOUS FLEET VRP (*) by É.D. TAILLARD ( 1 )
RAIRO Rech. Opér. (vol. 33, n 1, 1999, pp. 114) A HEURISTIC COLUMN GENERATION METHOD FOR THE HETEROGENEOUS FLEET VRP (*) by É.D. TAILLARD ( 1 ) Communicated by Brian BOFFEY Abstract. This paper presents
More informationLast topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far:
Last topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far: I Strength of formulations; improving formulations by adding valid inequalities I Relaxations and dual problems; obtaining
More information1 The Traveling Salesperson Problem (TSP)
CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation
More informationModule 6 P, NP, NPComplete Problems and Approximation Algorithms
Module 6 P, NP, NPComplete Problems and Approximation Algorithms Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University Jackson, MS 39217 Email: natarajan.meghanathan@jsums.edu
More informationAn Open Vehicle Routing Problem metaheuristic for examining wide solution neighborhoods
An Open Vehicle Routing Problem metaheuristic for examining wide solution neighborhoods Emmanouil E. Zachariadis, Chris T. Kiranoudis Department of Process Analysis and Plant Design, National Technical
More informationAlgorithms for the Precedence Constrained Generalized Travelling Salesperson Problem
MASTER S THESIS Algorithms for the Precedence Constrained Generalized Travelling Salesperson Problem RAAD SALMAN Department of Mathematical Sciences Division of Mathematics CHALMERS UNIVERSITY OF TECHNOLOGY
More informationAnt Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem
Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem TR/IRIDIA/19965 Université Libre de Bruxelles Belgium Marco Dorigo IRIDIA, Université Libre de Bruxelles, CP 194/6,
More informationGenetic algorithms for the traveling salesman problem
337 Genetic Algorithms Annals of Operations Research 63(1996)339370 339 Genetic algorithms for the traveling salesman problem JeanYves Potvin Centre de Recherche sur les Transports, Universitd de Montrgal,
More informationExploring Lin Kernighan neighborhoods for the indexing problem
INDIAN INSTITUTE OF MANAGEMENT AHMEDABAD INDIA Exploring Lin Kernighan neighborhoods for the indexing problem Diptesh Ghosh W.P. No. 20160213 February 2016 The main objective of the Working Paper series
More informationA Path Relinking Algorithm for a MultiDepot Periodic Vehicle Routing Problem
A Path Relinking Algorithm for a MultiDepot Periodic Vehicle Routing Problem Alireza Rahimi Vahed Teodor Gabriel Crainic Michel Gendreau Walter Rei September 2012 Bureaux de Montréal : Bureaux de Québec
More informationWeight Annealing Heuristics for Solving the TwoDimensional Bin Packing Problem
Weight Annealing Heuristics for Solving the TwoDimensional Bin Packing Problem KokHua Loh, Nanyang Technological University Bruce Golden, University of Maryland Edward Wasil, American University th ICS
More informationTabu Search Method for Solving the Traveling salesman Problem. University of Mosul Received on: 10/12/2007 Accepted on: 4/3/2008
Raf. J. of Comp. & Math s., Vol. 5, No. 2, 2008 Tabu Search Method for Solving the Traveling salesman Problem Isra Natheer Alkallak Ruqaya Zedan Sha ban College of Nursing College of Medicine University
More informationConstrained Minimum Spanning Tree Algorithms
December 8, 008 Introduction Graphs and MSTs revisited Minimum Spanning Tree Algorithms Algorithm of Kruskal Algorithm of Prim Constrained Minimum Spanning Trees Bounded Diameter Minimum Spanning Trees
More informationLagrangian Relaxation in CP
Lagrangian Relaxation in CP WillemJan van Hoeve CPAIOR 016 Master Class Overview 1. Motivation for using Lagrangian Relaxations in CP. Lagrangianbased domain filtering Example: Traveling Salesman Problem.
More informationA BranchandCut Algorithm for the Partition Coloring Problem
A BranchandCut Algorithm for the Partition Coloring Problem Yuri Frota COPPE/UFRJ, Programa de Engenharia de Sistemas e Otimização Rio de Janeiro, RJ 21945970, Brazil abitbol@cos.ufrj.br Nelson Maculan
More informationConcentric Tabu Search Algorithm for Solving Traveling Salesman Problem (TSP)
Concentric Tabu Search Algorithm for Solving Traveling Salesman Problem (TSP) Zeravan Arif Ali Submitted to the Institute of Graduate Studies and Research in partial fulfillment of the requirements for
More informationPrerequisite Material for Course Heuristics and Approximation Algorithms
Prerequisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,
More informationApplication of an Improved Ant Colony Optimization on Generalized Traveling Salesman Problem
Available online at www.sciencedirect.com Energy Procedia 17 (2012 ) 319 325 2012 International Conference on Future Electrical Power and Energy Systems Application of an Improved Ant Colony Optimization
More informationConstructive and destructive algorithms
Constructive and destructive algorithms Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Constructive algorithms In combinatorial optimization problems every
More informationCombinatorial Optimization  Lecture 14  TSP EPFL
Combinatorial Optimization  Lecture 14  TSP EPFL 2012 Plan Simple heuristics Alternative approaches Best heuristics: local search Lower bounds from LP Moats Simple Heuristics Nearest Neighbor (NN) Greedy
More informationImproving on the initial solution heuristic for the Vehicle Routing Problem with multiple constraints
Improving on the initial solution heuristic for the Vehicle Routing Problem with multiple constraints J. W. Joubert Department of Industrial and Systems Engineering, University of Pretoria Abstract The
More informationLKH User Guide Version 2.0 (November 2007)
LKH User Guide Version 2.0 (November 2007) by Keld Helsgaun Email: keld@ruc.dk 1. Introduction The LinKernighan heuristic [1] is generally considered to be one of the most successful methods for generating
More informationA column generation algorithm for the team orienteering problem with time windows
A column generation algorithm for the team orienteering problem with time windows Racha ElHajj, Aziz Moukrim, B Chebaro, M Kobeissi To cite this version: Racha ElHajj, Aziz Moukrim, B Chebaro, M Kobeissi.
More informationConstruction heuristics for the asymmetric TSP
European Journal of Operational Research 129 (2001) 555±568 www.elsevier.com/locate/dsw Theory and Methodology Construction heuristics for the asymmetric TSP Fred Glover a, Gregory Gutin b, *, Anders Yeo
More informationThe Rural Postman Problem with Time Windows
The Rural Postman Problem with Time Windows Ingrid Marcela MonroyLicht CiroAlberto Amaya André Langevin November 2013 CIRRELT201369 Ingrid Marcela MonroyLicht 1, CiroAlberto Amaya 2, André Langevin
More informationTraveling Salesman Problem Parallel Distributed Tree Search
Traveling Salesman Problem Parallel Distributed Tree Search Ned Nedialkov Dept. of Computing and Software McMaster University, Canada nedialk@mcmaster.ca March 2012 Outline Traveling salesman problem (TSP)
More informationColumn Generation Based Primal Heuristics
Column Generation Based Primal Heuristics C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck University Bordeaux 1 & INRIA team RealOpt Outline 1 Context Generic Primal Heuristics The BranchandPrice
More informationCOMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section (CLRS)
COMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section 35.135.2(CLRS) 1 Coping with NPCompleteness Bruteforce search: This is usually only a viable option for small
More informationClustering Evolutionary Computation for Solving Travelling Salesman Problems
International Journal of Advanced Computer Science and Information Technology (IJACSIT) Vol. 3, No. 3, 2014, Page: 243262, ISSN: 22961739 Helvetic Editions LTD, Switzerland www.elvedit.com Clustering
More informationAnt Colony Optimization
DM841 DISCRETE OPTIMIZATION Part 2 Heuristics Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. earch 2. Context Inspiration from Nature 3. 4. 5.
More informationTabu Search for a MultiObjective Routing Problem
Tabu Search for a MultiObjective Routing Problem JOAQUÍN PACHECO Fac. C Económicas y Empresariales. Universidad de Burgos. Plaza Infanta Elena s/n. Burgos 09001, Spain. RAFAEL MARTÍ * Departament d Estadística
More informationAn Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem
1 An Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem Krishna H. Hingrajiya, Ravindra Kumar Gupta, Gajendra Singh Chandel University of Rajiv Gandhi Proudyogiki Vishwavidyalaya,
More informationrestriction of neighbours instantiation of model variables
GENIUSCP: a Generic SingleVehicle Routing Algorithm Gilles Pesant 1, Michel Gendreau 1;2, JeanMarc Rousseau 1;2;3 1 Centre for Research on Transportation, Universite de Montreal, C.P. 6128, succ. Centreville,
More informationRANDOMIZED HEURISTICS FOR THE FAMILY TRAVELING SALESPERSON PROBLEM
RANDOMIZED HEURISTICS FOR THE FAMILY TRAVELING SALESPERSON PROBLEM L.F. MORÁNMIRABAL, J.L. GONZÁLEZVELARDE, AND M.G.C. RESENDE Abstract. This paper introduces the family traveling salesperson problem
More informationGraph Theory. Part of Texas Counties.
Graph Theory Part of Texas Counties. We would like to visit each of the above counties, crossing each county only once, starting from Harris county. Is this possible? This problem can be modeled as a graph.
More informationThe Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids
The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids Anja Fischer, Philipp Hungerländer 2, and Anna Jellen 2 Tehnische Universität Dortmund, Germany, anja2.fischer@tudortmund.de,
More informationGreedy Randomized Adaptive Search Procedure with PathRelinking for the Vertex pcenter Problem
Yin AH, Zhou TQ, Ding JW et al. Greedy randomized adaptive search procedure with pathrelinking for the vertex p center problem. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 32(6): 1319 1334 Nov. 2017.
More informationA Learningbased Path Relinking algorithm for the Bandwidth Coloring Problem
A Learningbased Path Relinking algorithm for the Bandwidth Coloring Problem Xiangjing Lai a, JinKao Hao a,b,, Zhipeng Lü c, Fred Glover d a LERIA, Université d Angers, 2 Boulevard Lavoisier, 49045 Angers,
More informationNPComplete Problems
NPomplete Problems P and NP Polynomial time reductions Satisfiability Problem, lique Problem, Vertex over, and ominating Set 10/19/2009 SE 5311 FLL 2009 KUMR 1 Polynomial lgorithms Problems encountered
More information9 Heuristic Methods for Combinatorial Optimization Problems
Contents 9 Heuristic Methods for Combinatorial Optimization Problems 425 9.1 WhatAreHeuristicMethods?... 425 9.2 WhyUseHeuristics?... 426 9.3 General Principles in DesigningHeuristicMethods... 431 9.4
More informationPath relinking for the vehicle routing problem
J Heuristics (2006) 12: 55 72 DOI 10.1007/s1073200641921 Path relinking for the vehicle routing problem Sin C. Ho Michel Gendreau Submitted in October 2004 and accepted by David Woodruff in August 2005
More informationOptimization of Process Plant Layout Using a Quadratic Assignment Problem Model
Optimization of Process Plant Layout Using a Quadratic Assignment Problem Model Sérgio. Franceira, Sheila S. de Almeida, Reginaldo Guirardello 1 UICAMP, School of Chemical Engineering, 1 guira@feq.unicamp.br
More informationSolving a directed profitable rural postman problem using two metaheuristic
Solving a directed profitable rural postman problem using two metaheuristic algorithms Masoud Rabbani, Fahimeh Taghiniam School of Industrial Engineering, College of Engineering, University of Tehran,
More informationAnt Colony Optimization
Ant Colony Optimization CompSci 760 Patricia J Riddle 1 Natural Inspiration The name Ant Colony Optimization was chosen to reflect its original inspiration: the foraging behavior of some ant species. It
More informationCART. Classification and Regression Trees. Rebecka Jörnsten. Mathematical Sciences University of Gothenburg and Chalmers University of Technology
CART Classification and Regression Trees Rebecka Jörnsten Mathematical Sciences University of Gothenburg and Chalmers University of Technology CART CART stands for Classification And Regression Trees.
More informationA Fast Lookahead Heuristic for the Multidepot Vehicle Routing Problem
Association for Information Systems AIS Electronic Library (AISeL) Wirtschaftsinformatik Proceedings 2007 Wirtschaftsinformatik February 2007 A Fast Lookahead Heuristic for the Multidepot Vehicle Routing
More informationThe Travelling Salesman Problem
The Travelling Salesman Problem The travelling salesman problem cannot be solved directly without vast amounts of processing power, since every possible Hamiltonian cycle would need to be measured. For
More informationSparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach
1 Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach David Greiner, Gustavo Montero, Gabriel Winter Institute of Intelligent Systems and Numerical Applications in Engineering (IUSIANI)
More informationJOURNAL OF OBJECT TECHNOLOGY
JOURNAL OF OBJECT TECHNOLOGY Online at http://www.jot.fm. Published by ETH Zurich, Chair of Software Engineering JOT, 2005 Vol. 4, No. 1, JanuaryFebruary 2005 A Java Implementation of the Branch and Bound
More informationAntQ: A Reinforcement Learning approach to the traveling salesman problem
Appeared in: Proceedings of ML95, Twelfth Intern. Conf. on Machine Learning, Morgan Kaufmann, 1995, 252 260. : A Reinforcement Learning approach to the traveling salesman problem Luca M. Gambardella IDSIA
More informationResearch Article A GRASPTabu Heuristic Approach to Territory Design for Pickup and Delivery Operations for LargeScale Instances
Hindawi Mathematical Problems in Engineering Volume 2017, Article ID 4708135, 13 pages https://doi.org/10.1155/2017/4708135 Research Article A GRASPTabu Heuristic Approach to Territory Design for Pickup
More informationGRASP with PathRelinking for the SONET Ring Assignment Problem
GRASP with PathRelinking for the SONET Ring Assignment Problem Lucas de O. Bastos Inst. de Computação  UFF Niterói  RJ  Brasil lbastos@ic.uff.br Luiz S. Ochi Inst. de Computação  UFF Niterói  RJ
More informationDynamic programming. Trivial problems are solved first More complex solutions are composed from the simpler solutions already computed
Dynamic programming Solves a complex problem by breaking it down into subproblems Each subproblem is broken down recursively until a trivial problem is reached Computation itself is not recursive: problems
More information1 Variations of the Traveling Salesman Problem
Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2approximate algorithm,
More informationThe Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances Marco Dorigo Université Libre de Bruxelles, IRIDIA, Avenue Franklin Roosevelt 50, CP 194/6, 1050 Brussels, Belgium mdorigo@ulb.ac.be
More informationStudy Guide Mods: Date:
Graph Theory Name: Study Guide Mods: Date: Define each of the following. It may be helpful to draw examples that illustrate the vocab word and/or counterexamples to define the word. 1. Graph ~ 2. Vertex
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 10
CPSC 536N: Randomized Algorithms 0111 Term Prof. Nick Harvey Lecture 10 University of British Columbia In the first lecture we discussed the Max Cut problem, which is NPcomplete, and we presented a very
More informationA simple and effective metaheuristic for the Minimum Latency Problem
A simple and effective metaheuristic for the Minimum Latency Problem Marcos Melo Silva a,, Anand Subramanian a,b, Thibaut Vidal c,d, Luiz Satoru Ochi a a Universidade Federal Fluminense, Instituto de Computação,
More informationIn D. Corne, M. Dorigo and F. Glover, editors New Ideas in Optimization. McGrawHill, London, UK, pp , 1999
MACSVRPTW: A MULTIPLE ANT COLONY SYSTEM FOR VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS Luca Maria Gambardella, Éric Taillard and Giovanni Agazzi IDSIA, Corso Elvezia 36, 6900 Lugano, Switzerland Tel +41
More informationLarge Neighborhood Search
Downloaded from orbit.dtu.dk on: Apr 04, 2018 Large Neighborhood Search Pisinger, David; Røpke, Stefan Published in: Handbook of Metaheuristics Publication date: 2010 Link back to DTU Orbit Citation (APA):
More informationHEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIALARIDE PROBLEM
Journal of the Operations Research Society of Japan Vol. 33, No. 4, December 1990 1990 The Operations Research Society of Japan HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIALARIDE PROBLEM Mikio Kubo
More informationA Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
and A Polynomial Time for Longest Paths in ESHA GHOSH Joint work with N. S. Narayanaswamy and C. Pandu Rangan Dept of Computer Science and Engineering IIT Madras, Chennai 600036, India February 20 th,
More informationNetworks: Lecture 2. Outline
Networks: Lecture Amedeo R. Odoni November 0, 00 Outline Generic heuristics for the TSP Euclidean TSP: tour construction, tour improvement, hybrids Worstcase performance Probabilistic analysis and asymptotic
More informationAlgorithm Design Techniques (III)
Algorithm Design Techniques (III) Minimax. AlphaBeta Pruning. Search Tree Strategies (backtracking revisited, branch and bound). Local Search. DSA  lecture 10  T.U.ClujNapoca  M. Joldos 1 TicTacToe
More informationDijkstra's Algorithm
Shortest Path Algorithm Dijkstra's Algorithm To find the shortest path from the origin node to the destination node No matrix calculation Floyd s Algorithm To find all the shortest paths from the nodes
More informationKurt Mehlhorn, MPI für Informatik. Curve and Surface Reconstruction p.1/25
Curve and Surface Reconstruction Kurt Mehlhorn MPI für Informatik Curve and Surface Reconstruction p.1/25 Curve Reconstruction: An Example probably, you see more than a set of points Curve and Surface
More informationSolution Methods for the Multitrip Elementary Shortest Path Problem with Resource Constraints
Solution Methods for the Multitrip Elementary Shortest Path Problem with Resource Constraints Zeliha Akca Ted K. Ralphs Rosemary T. Berger December 31, 2010 Abstract We investigate the multitrip elementary
More information2 Vehicle Routing. 2.1 Introduction
2 Vehicle Routing In Chapter 2 and Chapter 3, the basic decision problems in the operational transportation planning of freight forwarding companies are introduced. If own disposable vehicles are used
More informationLecture 13: Minimum Spanning Trees Steven Skiena
Lecture 13: Minimum Spanning Trees Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.stonybrook.edu/ skiena Problem of the Day Your job
More informationNormalized cuts and image segmentation
Normalized cuts and image segmentation Department of EE University of Washington Yeping Su Xiaodan Song Normalized Cuts and Image Segmentation, IEEE Trans. PAMI, August 2000 5/20/2003 1 Outline 1. Image
More informationEvolutionary Nonlinear Great Deluge for University Course Timetabling
Evolutionary Nonlinear Great Deluge for University Course Timetabling Dario LandaSilva and Joe Henry Obit Automated Scheduling, Optimisation and Planning Research Group School of Computer Science, The
More informationComparison of TSP Algorithms
Comparison of TSP Algorithms Project for Models in Facilities Planning and Materials Handling December 1998 Participants: ByungIn Kim JaeIk Shim Min Zhang Executive Summary Our purpose in this term project
More informationGeneral kopt submoves for the Lin Kernighan TSP heuristic
Math. Prog. Comp. (2009) 1:119 163 DOI 10.1007/s1253200900046 FULL LENGTH PAPER General kopt submoves for the Lin Kernighan TSP heuristic Keld Helsgaun Received: 25 March 2009 / Accepted: 3 June 2009
More informationPCLUST: An extension of PROMETHEE to interval clustering
PCLUST: An extension of PROMETHEE to interval clustering Renaud Sarrazin 1,2, Yves De Smet 2, Jean Rosenfeld 3 1 MSM division,, Brussels, Belgium 2 CoDESMG laboratory, Université libre de Bruxelles, Brussels,
More informationRelationship between Genetic Algorithms and Ant Colony Optimization Algorithms
Relationship between Genetic Algorithms and Ant Colony Optimization Algorithms Osvaldo Gómez Universidad Nacional de Asunción Centro Nacional de Computación Asunción, Paraguay ogomez@cnc.una.py and Benjamín
More informationA path that visits every vertex exactly once is a Hamiltonian path. A circuit that visits every vertex exactly once is a Hamiltonian circuit.
Math 167 Review of Chapter 2 1 (c) Janice Epstein CHAPTER 2 BUSINESS EFFICENCY A path that visits every vertex exactly once is a Hamiltonian path. A circuit that visits every vertex exactly once is a Hamiltonian
More informationAn iterated hyperplane exploration approach for the Quadratic Knapsack Problem
An iterated hyperplane exploration approach for the Quadratic Knapsack Problem Yuning Chen a and JinKao Hao a,b, a LERIA, Université d Angers, Bd Lavoisier, 90 Angers, France b Institut Universitaire
More informationProposal of Tabu Search Algorithm Based on Cuckoo Search
Proposal of Tabu Search Algorithm Based on Cuckoo Search Ahmed T. Sadiq AlObaidi Department of Computer Sciences University of Technology Baghdad, Iraq Ahmed Badre AlDeen Majeed Quality Assurance Department
More information