Two new variants of Christofides heuristic for the Static TSP and a computational study of a nearest neighbor approach for the Dynamic TSP
|
|
- Alexandrina Morgan
- 5 years ago
- Views:
Transcription
1 Two new variants of Christofides heuristic for the Static TSP and a computational study of a nearest neighbor approach for the Dynamic TSP Orlis Christos Kartsiotis George Samaras Nikolaos Margaritis Konstantinos MSc student MSc student Assistant Professor Professor Department of Applied Informatics University of Macedonia 156 Egnatia Str., Thessaloniki, Greece Abstract The Traveling Salesman Problem (TSP) is a standard test-bed for algorithmic ideas. From this point of view we evaluate the computational behavior of two new variants of Christofides heuristic for the Symmetric TSP. Moreover, we compare these numerical results with those arose from known heuristics with same worst-case time complexity. As a further step, we consider the Symmetric Dynamic TSP in which the travel cost between specific pairs of nodes may change through time. In this case, we apply an algorithmic approach based on Nearest Neighbor heuristic in order to avoid a link which has affected negatively cause of a surcharge. Effective implementations were developed and tested on TSPLib 95 benchmark instances. KEYWORDS Traveling Salesman Problem, Heuristics, Static and Dynamic TSP, Computational Study 1. INTRODUCTION 1.1 The Traveling Salesman Problem The Traveling Salesman Problem (TSP) is one of the most well studied combinatorial optimization problems. E Given a complete graph G = ( N, E) on nodes with edge costs c R, the objective is to find a Hamiltonian cycle or tour in K n of minimum cost. This problem is known to be NP-hard [Garey & Johnson (1979)] even in the case where the corresponding costs satisfy the triangle inequality, i.e. when cij + cjk cik, i, j, k N [Laweler et al. (1985)]. There exist plenty of algorithms used to find optimal tours, but none of them is efficient when large instances are handled since they all grow exponentially [Flood (1956)]. This fact leaves the researchers with two major strategies; either look for heuristics that merely find quickly near-optimal solutions, or attempt to develop optimization algorithms that work well on 'real world' rather than worst-case instances. In practice, the TSP is usually solved by using heuristics that are able to find a locally optimal solution. In addition to the choice of the solution method, one would like to have some guarantee on the quality of the solutions found. Such a guarantee exists if a lower bound for the length of the shortest possible tour is known. In general, lower bounds are obtained by solving relaxations of the original problem. The optimal solution of the relaxed problem gives a valid lower bound for the optimal solution of the original problem. Using different relaxations, different lower bounds can be obtained. Hence, the main goal is to find appropriate relaxation problems for the TSP that can be solved efficiently and which give lower bounds as tight as possible. If the optimal solution of the relaxed problem is a valid tour, then the optimal solution of the
2 original TSP has been found. In this paper we are going to use lower bounds created by the Held-Karp algorithmic approach [Held & Karp (1970)]. 1.2 Applications and algorithmic approaches TSP has many real world applications. For example, it could be used from logistics and data clustering applications to genome sequencing and optimization of drilling in VLSI design. There have been proposed several heuristics (Table 1) with or without a worst-case ratio as far as their results [Papadimitriou & Steiglitz 3 (1977)] during the past decades but Christofides heuristic with worst-case time complexity On ( ) [Christofides (1976)] and worst-case ratio 3/2 [Vazirani (2003)] remains the best. Other solution approaches are neural networks, tabu search, simulated annealing and genetic learning. Table 1. Worst-case time complexity and worst-case ratio of the basic TSP heuristics Heuristic Nearest Neighbor Greedy Double MST Christofides Worst-case time complexity ~above Held-Karp lower bound Worst-case ratio 2 On ( ) 25% - 2 On ( log 2n ) 15%-20% - 2 On ( log 2n ) 30% 2 3 On ( ) 10% 1.5 Furthermore, apart from tour construction algorithms, there are also some tour improvement algorithms [Lin & Kernighan (1973)]. In tour improvement algorithms, a given initial solution is improved, if possible, by transposing two or more points in the initial tour. With regard to improvement algorithms, two strategies are possible. We may either consider all possible exchanges or choose the one that result in the greatest saving and continue this process until no further reduction is possible. 1.3 Proposed methods It is well-known that TSP is a difficult problem that can approximately be solved by a bunch of heuristics when it is static. But in real world applications we need good results in reasonable time in order to decide which tour should be followed. To this matter, we suggest two heuristics based totally on Christofides heuristic. Moreover, there are many applications in which the transitions costs between specific pairs of nodes may change dynamically through time, i.e. real time traffic routing and router packet scheduling. From this point of view, we are going to examine the computational behavior and the yielding results of an iterative step by step application of the Nearest Neighbor heuristic for the Dynamic TSP. We selected this heuristic due to its ability to adapt to dynamic changes and its efficient computational behavior. Following this section, in section 2, we describe the data set used in our experiments. In section 3, we describe briefly the proposed solution methods for the Static and the Dynamic TSP by presenting the pseudocodes and a destruction scheme. In section 4, we present the numerical results of our computational study and finally, our conclusions are presented in section DATA SET DESCRIPTION 2.1 The TSPLib 95 In order to test the computational behavior of the proposed algorithms we have used benchmark instances from TSPLib 95 [Reinelt (1991)]. TSPLib 95 is a well-known suite containing many hard to solve
3 optimization problems for the TSP and related problems from various sources and of various types. In our paper, we took under consideration the Symmetric Traveling Salesman Problem in which the distance from node i to node j is the same as from node j to node i ( cij = cji, i, j = 1,2,..., n, i j ). These instances are all very different from each other, especially in the structure of the cost matrix. The entries of the cost matrix were computed using various geographical distances. These formats, in our occasion, were the Euclidean, the pseudo-euclidean, the Geographical and the full Matrix. Table 2 demonstrates four benchmark instances with all the different types of entries of the cost matrix used in this survey. Table 2. Four TSPLib 95 benchmark instances with all the different types of entries of the cost matrix Name #cities Type Optimal att48 48 ATT brazil58 58 MATRIX ch EUC_2D 6110 gr GEO ALGORITHMS DESCRIPTION 3.1 Algorithms for the Static TSP In this section we are going to describe the proposed solution methods for the Static TSP. More specifically, we are going to introduce two variations of Christofides heuristic with much better computational behavior and results, as we will see, comparable with those of the Nearest Neighbor and the Greedy heuristic ones. In the pseudocode that follows, we describe the main steps of Christofides heuristic. Christofides heuristic O(n 3 ) Require: G = ( N, E) STEP 0. Compute a minimum spanning tree T for G (every tree has an even number of nodes that are odd-degree). STEP 1. Let N* N be the set of nodes of odd degree in T. STEP 2. Compute a minimum perfect matching M on the complete graph G* = ( N*, E*). STEP 3. Add the edges from M to T, and find an Euler tour Γ, of the resulting (multi-)graph. STEP 4. For each node that occurs more than once in Γ, remove all but one of its occurrences. STEP 5. return Γ Proposed methods for computing minimum perfect matching The problem of computing a minimum perfect matching is P (O(n 3 )) but many times doesn t suit well in real time applications. From this point of view we compute this by using the Nearest Neighbor and Greedy heuristic in a very simple way as we can see in Figure 1. More specifically, after the STEP 1 of Christofides heuristic, for the subset of nodes with odd degree, we apply the above heuristics in order to create a tour for these nodes. Then, we choose the cheaper perfect matching from the two available options. Below are presented the pseudocodes. ApproximatePerfectMatching1 O(n 2 ) Require: G = ( N, E), N * STEP 0. Create the complete graph G* = ( N*, E*) from the subset N * created in STEP 1 of Christofides heuristic. STEP 1. Find a tour C over G * by using the Nearest Neighbor heuristic. STEP 2. Start from node C (i = 1), compute the total of the perfect matching M 1 by adding the distance from node C (i) to C (i + 2) and then increase i by 2 in order to compute the second
4 pairing. Repeat N / 2 times. STEP 3. Start from node C (i = 2), repeat the above procedure N - 1 times in order to compute the perfect matching M 2 and then add to M 2 the C( N ) to C(1) distance. STEP 4. Choose the cheapest perfect matching from M 1 and M 2 and then continue with the STEP 3 of Christofides heuristic. ApproximatePerfectMatching2 O(n 2 log 2 n) Require: G = ( N, E), N * STEP 0. Create the complete graph G* = ( N*, E*) from the subset N * created in STEP 1 of Christofides heuristic. STEP 1. Find a tour C over G* = ( N*, E*) by using the Greedy heuristic. STEP 2. Start from node C(i = 1), compute the total of the perfect matching M 1 by adding the distance from node C(i) to C(i + 2) and then increase i by 2 in order to compute the second pairing. Repeat N / 2 times. STEP 3. Start from node C(i = 2), repeat the above procedure in order to compute the perfect matching M 2 and then add to M 2 the C( N ) to C(1) distance. STEP 4. Choose the cheapest perfect matching from M 1 and M 2 and continue with the STEP 3 of Christofides heuristic. Moreover, as we know from the basic principles of the asymptotic analysis, the proposed methods, i.e. Christofides1 (Christofides heuristic using ApproximatePerfectMatching1) and Christofides2 (Christofides heuristic using ApproximatePerfectMatching2) have worst-case time complexity O(n 2 ) and O(n 2 log 2 n) respectively. As a result, when applied to Christofides heuristic, they reduce its worst-case time complexity to the same values but unfortunately with no guarantee for the quality of the created tour. Figure 1. Visualization of the proposed methods for finding perfect matching N* STEP 0 STEP Algorithm for the Dynamic TSP STEP 2 ( M 1 ) STEP 3 ( M 2 ) DynamicTSPNearestNeighbor Require: G = ( N, E) STEP 0. Select arbitrarily a starting node u. STEP 1. While you haven t visited all nodes Compute the subset N* N of nodes whose selection won t create a cycle. Let v N* be the node nearest to u. Apply the destruction scheme on G = ( N, E).
5 If a destruction has affected N * Let v N* be the node nearest to u. u v else u v End_If End_While STEP 2. Return the created tour Destructions scheme We examined five different types of destructions with different probabilities of occurrence and surcharge due to the fact that not all real phenomena happen and disrupt networks the same way, i.e. rain is more possible and causes fewer surcharges than a hurricane. For our experiments we consider five types of destruction (Table 3) with decreasing probability of occurrence and increasing surcharge: Table 3. The five different types of destruction with their surcharges Phenomenon Probability of Surcharge occurrence A 33.33% 50% B 26.66% 100% C 20.00% 150% D 13.33% 200% E 6.66% 250% Furthermore, we took into account two basic factors, first that there are periods of no destruction at all and second that not all nodes on a network are affected when destruction does occur, i.e. there are periods without snow and when it does it certainly doesn t snow everywhere. (These two factors where modeled with the parameters of the destruction probability and the percentage number of nodes affected from destruction). 4. COMPUTATIONAL STUDY 4.1 Computing environment All heuristics were implemented in the MathWorks MATLAB environment. MATLAB is a widely used tool in scientific computing community. The main reasons for this choice were the inherent capability of MATLAB for matrix operations and the support of sparse matrices. The reported CPU times were computed with the built-in function cputime. The given times are net times and do not include times for the input. The characteristics of the hardware and software can be a crucial factor for the performance of an algorithm. Our computational experiments ran in the computing environment described in Table 4. CPU RAM size L2 Cache size L2 Cache size Operating System MATLAB version Table 4. Description of the computing environment 4.2 Computational results for the Static TSP Intel(R) Core2Duo, 2.26 GHz (2 processors) 3096 MB 3 MB 128 KB Linux O/S Ubuntu, Kernel: generic (R2009a)
6 Analyzing the numerical results, it is worth mentioning that our proposed methods in order to solve the Static TSP returned tours with very good results. More specifically, the Christofides1 (Christofides using the ApproximatePerfectMatching1) with worst-case time complexity O(n 2 ) returned tours with less for the 65 of the 87 TSPLib 95 instances (~74.70%) and Christofides2 (Christofides using the ApproximatePerfectMatching2) with worst-case time complexity O(n 2 log 2 n) returned better tours in 36 out of our 87 instances (~41.40%). Table 5 demonstrates the yielding results for 20 out of our 87 TSPLib 95 instances whose selection based on their returned s which belong to a comparable scale. Figure 2 shows the total of all TSPLib 95 instances used in this survey using various heuristics and Figure 3 the total of all TSPLib 95 instances in contrast with the Double Minimum Spanning Tree heuristic (worst-case ratio: 2) and the optimal results. Nearest Neighbor Nearest Neighbor time (secs) Table 5. Numerical results for our proposed methods Christofides1 Christofides1 Greedy Greedy Christofides2 Christofides2 Optimal Name n time (secs) time (secs) time (secs) att brazil d d d gr gr kroa kroa kroa krob lin nrw P pcb pcb pr pr u u Total Figure 2. Computational results of our proposed methods Total from 87 TSPLib 95 benchmark instances Total Nearest Neighbor Christofides1 Greedy Christofides2 Heuristic
7 Figure 3. Computational results of our proposed methods in contrast with the DMST and optimal ones Total from 87 TSPLib 95 benchmark instances Total DMST (worstcase ratio: 2) Nearest Neighbor Christofides1 Greedy Christofides2 Optimal solution Heuristic 4.3 Computational results for the Dynamic TSP In Table 6 we present our results each of which correspond to 10 iterations on each test set and we provide 20 out of the 87 sets which were totally tested, in order to have a coherent outcome (returned ) scale from approximately up to Column n corresponds to the number of cities on the set, column Average without corresponds to the found without changing course despite of destruction and columns Average and Average time with correspond to the average and time in cpu seconds for the 10 iterations. Column Average extra with is the mean out of 10 iterations when we allow the destruction to be taken accounted for and column Best with corresponds to the best route found with making changes due to destruction. Column #of avoided destructions / #of total destructions show the times we choose a different node instead of the originally chosen out of the total choices we made to complete the rout. Columns Weight without destructions and Time without destructions correspond to the and time when no destruction took place. Finally, column Optimal corresponds to the best known solution. Two visualized examples of the performance of the algorithms are presented in Figure 4 and 5 by demonstrating the yielding results corresponding to pcb442 TSPLib 95 instance. Table 6. Numerical results (possibility of destruction: 50%, percentage of affected nodes in each destruction: 10%) Average without Average with Average time (sec) with Average extra with Best with #of avoided destructions/ # of total destructions Weight without destructions Time (sec) without destructions Optimal Name n att / brazil / d / d / d / gr / gr / kroa / kroa / kroa /
8 krob / lin / nrw / P / pcb / pcb / pr / pr / u / u / Total - ~ ~ ~9544 ~ / Figure 4. Numerical results for the pcb442 instance when the probability of destruction was 70% Probability of destruction: 70% Average % 20% 30% 40% 50% Percentage of affected nodes in each destruction Without With Without destructions Figure 5. Numerical results for the pcb442 instance when the probability of destruction was 100% Probability of destruction: 100% Average % 20% 30% 40% 50% Percentage of nodes affected in each destruction Without With Without destructions
9 5. CONCLUSION In this paper we tried to evaluate the computational behavior of several proposed heuristics for the Static and the Dynamic Symmetric Traveling Salesman Problem while in parallel we suggested some algorithmic approaches for solving much different instances not only effectively but also in real time. As our experiments have shown, Christofides1 and Christofides2 heuristics behave very well in general. More specifically, Christofides1 heuristic returned less ed tours than Nearest Neighbor for the 74.70% of our instances. However, this heuristic seemed to behave in the most of the cases in his worst-case time complexity. On the other hand, Christofides2 heuristic returned less ed tours than Greedy for the 41.40% of our instances in reasonable time. In our opinion, these results indicate that our proposed heuristics may easily apply in real applications in which the time responses play a crucial role. It is worth mentioning here that a random selection between the perfect matching M 1 and M 2 during the STEP 4 of our proposed methods (ApproximatePerfectMatching1 and ApproximatePerfectMatching2) doesn t work effectively as we clearly understood through experimentation. Ending, DynamicTSPNearestNeighbor heuristic seemed to behave very well in general as our hundreds of experiments have shown. Moreover, the yielding results of this heuristic were far better for all of our experiments and the time responses were closely related to those of Nearest Neighbor without the property of avoiding a surcharged link cause of a destruction. REFERENCES Christofides, N Worst Case analysis of a New Heuristic for the Traveling Salesman Problem, Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA. Flood, M.M The travelling salesman problem. Operations Research 4, pp Garey, M. R., Johnson, D.S Computers and Intractability: A Guide to the theory of NP-Completeness, Freeman, San Francisco. Held, M., Karp, R.M The travelling-salesman problem and minimum spanning trees: Part II. Mathematical Programming 1, pp Lawler, L.E., Lenstra, J.K., Rinnooy Kan, A.H.G. and Shmoys, D.B eds., The Traveling Salesman Problem. John Wiley & Sons, Chichester, pp Lin, S., Kernighan, B. W An effective heuristic algorithm for the traveling- salesman problem. Operations Research 21, pp Papadimitriou, C.H., Steiglitz, K On the complexity of local search for the travelling salesman problem. SIAM J. Comput. 6, pp Reinelt, G TSPLib a traveling salesman problem library. ORSA J. Comput. 3, pp Vazirani, V.V Approximation algorithms. Springer, pp
Complete Local Search with Memory
Complete Local Search with Memory Diptesh Ghosh Gerard Sierksma SOM-theme A Primary Processes within Firms Abstract Neighborhood search heuristics like local search and its variants are some of the most
More informationA NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
TWMS J. App. Eng. Math. V.7, N.1, 2017, pp. 101-109 A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM F. NURIYEVA 1, G. KIZILATES 2, Abstract. The Multiple Traveling Salesman Problem (mtsp)
More informationOptimal tour along pubs in the UK
1 From Facebook Optimal tour along 24727 pubs in the UK Road distance (by google maps) see also http://www.math.uwaterloo.ca/tsp/pubs/index.html (part of TSP homepage http://www.math.uwaterloo.ca/tsp/
More informationImproving the Held and Karp Approach with Constraint Programming
Improving the Held and Karp Approach with Constraint Programming Pascal Benchimol 1, Jean-Charles Régin 2, Louis-Martin Rousseau 1, Michel Rueher 2, Willem-Jan van Hoeve 3 1 CIRRELT,École Polytechnique
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 informationImprovement heuristics for the Sparse Travelling Salesman Problem
Improvement heuristics for the Sparse Travelling Salesman Problem FREDRICK MTENZI Computer Science Department Dublin Institute of Technology School of Computing, DIT Kevin Street, Dublin 8 IRELAND http://www.comp.dit.ie/fmtenzi
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationAn Algorithm for Solving the Traveling Salesman Problem
JKAU: Eng. Sci.. vol. 4, pp. 117 122 (1412 A.H.l1992 A.D.) An Algorithm for Solving the Traveling Salesman Problem M. HAMED College ofarts and Science, Bahrain University, [sa Town, Bahrain ABSTRACT. The
More informationA Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem
A Polynomial-Time 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 informationThe Traveling Salesman Problem: State of the Art
The Traveling Salesman Problem: State of the Art Thomas Stützle stuetzle@informatik.tu-darmstadt.de http://www.intellektik.informatik.tu-darmstadt.de/ tom. Darmstadt University of Technology Department
More informationTravelling Salesman Problem. Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij
Travelling Salesman Problem Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij 1 Contents TSP and its applications Heuristics and approximation algorithms Construction heuristics,
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 SE-721
More informationAN EXPERIMENTAL INVESTIGATION OF A PRIMAL- DUAL EXTERIOR POINT SIMPLEX ALGORITHM
AN EXPERIMENTAL INVESTIGATION OF A PRIMAL- DUAL EXTERIOR POINT SIMPLEX ALGORITHM Glavelis Themistoklis Samaras Nikolaos Paparrizos Konstantinos PhD Candidate Assistant Professor Professor Department of
More informationTravelling salesman problem using reduced algorithmic Branch and bound approach P. Ranjana Hindustan Institute of Technology and Science
Volume 118 No. 20 2018, 419-424 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Travelling salesman problem using reduced algorithmic Branch and bound approach P. Ranjana Hindustan
More informationSOLVING TRAVELING SALESMAN PROBLEMS USING HEURISTIC LEARNING APPROACH
SOLVING TRAVELING SALESMAN PROBLEMS USING HEURISTIC LEARNING APPROACH Sim Kim Lau 1), Li-Yen Shue 2) 1) Department of Information Systems, University of Wollongong, Australia (simlau@uow.edu.au) 2) Department
More informationLecture 8: The Traveling Salesman Problem
Lecture 8: The Traveling Salesman Problem Let G = (V, E) be an undirected graph. A Hamiltonian cycle of G is a cycle that visits every vertex v V exactly once. Instead of Hamiltonian cycle, we sometimes
More informationComparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-661, p- ISSN: 2278-8727Volume 13, Issue 3 (Jul. - Aug. 213), PP 17-22 Comparison Study of Multiple Traveling Salesmen Problem using Genetic
More informationval(y, I) α (9.0.2) α (9.0.3)
CS787: Advanced Algorithms Lecture 9: Approximation Algorithms In this lecture we will discuss some NP-complete optimization problems and give algorithms for solving them that produce a nearly optimal,
More informationRecent PTAS Algorithms on the Euclidean TSP
Recent PTAS Algorithms on the Euclidean TSP by Leonardo Zambito Submitted as a project for CSE 4080, Fall 2006 1 Introduction The Traveling Salesman Problem, or TSP, is an on going study in computer science.
More informationSolution of P versus NP problem
Algorithms Research 2015, 4(1): 1-7 DOI: 105923/jalgorithms2015040101 Solution of P versus NP problem Mustapha Hamidi Meknes, Morocco Abstract This paper, taking Travelling Salesman Problem as our object,
More informationThe Heuristic Strategy Implementation to the Hopfield -Tank TSP Neural Algorithm
The Heuristic Strategy Implementation to the Hopfield -Tank TSP Neural Algorithm N. Kovač, S. Bauk Faculty of Maritime Studies, University of Montenegro Dobrota 36, 85 330 Kotor, Serbia and Montenegro
More informationLower Bounds for Insertion Methods for TSP. Yossi Azar. Abstract. optimal tour. The lower bound holds even in the Euclidean Plane.
Lower Bounds for Insertion Methods for TSP Yossi Azar Abstract We show that the random insertion method for the traveling salesman problem (TSP) may produce a tour (log log n= log log log n) times longer
More informationIntroduction to Approximation Algorithms
Introduction to Approximation Algorithms Dr. Gautam K. Das Departmet of Mathematics Indian Institute of Technology Guwahati, India gkd@iitg.ernet.in February 19, 2016 Outline of the lecture Background
More informationState Space Reduction for the Symmetric Traveling Salesman Problem through Halves Tour Complement
State Space Reduction for the Symmetric Traveling Salesman Problem through Halves Tour omplement Kamal R l-rawi ept of omputer Science, Faculty of Information Technology, Petra University, JORN E-mail:kamalr@uopedujo
More informationA combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem
A combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem TRUNG HOANG DINH, ABDULLAH AL MAMUN Department of Electrical and Computer Engineering
More informationA CLUSTERING HEURISTIC BY EFFECTIVE NEAREST NEIGHBOR SELECTION
A CLUSTERING HEURISTIC BY EFFECTIVE NEAREST NEIGHBOR SELECTION Mahmuda Naznin, Paul Juell, Kendall E. Nygard and Karl Altenburg Department of Computer Science and Operations Research North Dakota State
More informationA simple exact separation algorithm for 2-matching inequalities
A simple exact separation algorithm for 2-matching inequalities Julián Aráoz Simón Bolívar University, Venezuela Technical University of Catalonia, Spain Elena Fernández Technical University of Catalonia,
More informationAn Experimental Evaluation of the Best-of-Many Christofides Algorithm for the Traveling Salesman Problem
An Experimental Evaluation of the Best-of-Many Christofides Algorithm for the Traveling Salesman Problem David P. Williamson Cornell University Joint work with Kyle Genova, Cornell University July 14,
More informationHEURISTIC ALGORITHMS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
Proceedings of the International Conference on Theory and Applications of Mathematics and Informatics - ICTAMI 24, Thessaloniki, Greece HEURISTIC ALGORITHMS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
More informationThe metric travelling salesman problem: pareto-optimal heuristic algorithms
295 The metric travelling salesman problem: pareto-optimal heuristic algorithms Ekaterina Beresneva Faculty of Computer Science National Research University Higher School of Economics Moscow, Russia, +7(925)538-40-58
More informationV1.0: Seth Gilbert, V1.1: Steven Halim August 30, Abstract. d(e), and we assume that the distance function is non-negative (i.e., d(x, y) 0).
CS4234: Optimisation Algorithms Lecture 4 TRAVELLING-SALESMAN-PROBLEM (4 variants) V1.0: Seth Gilbert, V1.1: Steven Halim August 30, 2016 Abstract The goal of the TRAVELLING-SALESMAN-PROBLEM is to find
More informationSLS Methods: An Overview
HEURSTC OPTMZATON SLS Methods: An Overview adapted from slides for SLS:FA, Chapter 2 Outline 1. Constructive Heuristics (Revisited) 2. terative mprovement (Revisited) 3. Simple SLS Methods 4. Hybrid SLS
More informationMetaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini
Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution
More informationCS261: A Second Course in Algorithms Lecture #16: The Traveling Salesman Problem
CS61: A Second Course in Algorithms Lecture #16: The Traveling Salesman Problem Tim Roughgarden February 5, 016 1 The Traveling Salesman Problem (TSP) In this lecture we study a famous computational problem,
More informationImproved Large-Step Markov Chain Variants for the Symmetric TSP
Journal of Heuristics, 3, 63 81 (1997) c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. Improved Large-Step Markov Chain Variants for the Symmetric TSP INKI HONG, ANDREW B. KAHNG UCLA
More information5.5 The Travelling Salesman Problem
0 Matchings and Independent Sets 5.5 The Travelling Salesman Problem The Travelling Salesman Problem A travelling salesman, starting in his own town, has to visit each of towns where he should go to precisely
More informationHeuristic Approaches to Solve Traveling Salesman Problem
TELKOMNIKA Indonesian Journal of Electrical Engineering Vol. 15, No. 2, August 2015, pp. 390 ~ 396 DOI: 10.11591/telkomnika.v15i2.8301 390 Heuristic Approaches to Solve Traveling Salesman Problem Malik
More informationAdapting the Genetic Algorithm to the Travelling Saleman Problem
Adapting the Genetic Algorithm to the Travelling Saleman Problem Author Pullan, Wayne Published 3 Conference Title The 3 Congress on Evolutionary Computation CEC 3 DOI https://doi.org/.9/cec.3.9978 Copyright
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.1-35.2(CLRS) 1 Coping with NP-Completeness Brute-force search: This is usually only a viable option for small
More informationA Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling Salesman Problem
A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling Salesman Problem Chris Walshaw Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Greenwich, London,
More informationEffective Optimizer Development for Solving Combinatorial Optimization Problems *
Proceedings of the 11th WSEAS International Conference on SYSTEMS, Agios Nikolaos, Crete Island, Greece, July 23-25, 2007 311 Effective Optimizer Development for Solving Combinatorial Optimization s *
More informationStrongly Connected Spanning Subgraph for Almost Symmetric Networks
CCC 2015, Kingston, Ontario, August 10 12, 2015 Strongly Connected Spanning Subgraph for Almost Symmetric Networks A. Karim Abu-Affash Paz Carmi Anat Parush Tzur Abstract In the strongly connected spanning
More informationAdaptive Tabu Search for Traveling Salesman Problems
Adaptive Tabu Search for Traveling Salesman Problems S. Suwannarongsri and D. Puangdownreong Abstract One of the most intensively studied problems in computational mathematics and combinatorial optimization
More informationApproximability Results for the p-center Problem
Approximability Results for the p-center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Prof. Timothy Chan University of Waterloo, Spring 2004 The p-center
More informationUSING LOCAL SURROGATE INFORMATION IN LAGRANGEAN RELAXATION: AN APPLICATION TO SYMMETRIC TRAVELING SALESMAN PROBLEMS
USING LOCAL SURROGATE INFORMATION IN LAGRANGEAN RELAXATION: AN APPLICATION TO SYMMETRIC TRAVELING SALESMAN PROBLEMS Luiz Antonio N. Lorena LAC/INPE Caixa Postal 515 12.201-970 São José dos Campos - SP
More informationMinimum-weight tree shortcutting for Metric TSP
Minimum-weight tree shortcutting for Metric TSP 2 Vladimir Deineko and Alexander Tiskin Warwick Business School and Department of Computer Science University of Warwick Deineko and Tiskin (Warwick) Min
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu P, NP-Problems Class
More informationA Theoretical Framework to Solve the TSPs as Classification Problems and Shortest Hamiltonian Path Problems
American Journal of Intelligent Systems 2014, 4(1): 1-8 DOI: 10.5923/j.ajis.20140401.01 A Theoretical Framework to Solve the TSPs as Classification Problems and Shortest Hamiltonian Path Problems Akihiko
More informationA Memetic Algorithm for the Generalized Traveling Salesman Problem
A Memetic Algorithm for the Generalized Traveling Salesman Problem Gregory Gutin Daniel Karapetyan Abstract The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationParallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster Abstract- Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial
More informationAn O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem and more recent developments CATS @ UMD April 22, 2016 The Asymmetric Traveling Salesman Problem (ATSP) Problem
More informationGenetic Algorithms with Oracle for the Traveling Salesman Problem
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN 17-884 Genetic Algorithms with Oracle for the Traveling Salesman Problem Robin Gremlich, Andreas Hamfelt, Héctor
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 informationA PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS
Yugoslav Journal of Operations Research Vol 19 (2009), Number 1, 123-132 DOI:10.2298/YUJOR0901123S A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS Nikolaos SAMARAS Angelo SIFELARAS
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 informationSeismic Vessel Problem
Seismic Vessel Problem Gregory Gutin, Helmut Jakubowicz, Shuki Ronen and Alexei Zverovitch November 14, 2003 Abstract We introduce and study a new combinatorial optimization problem, the Seismic Vessel
More informationApproximation Algorithms
Chapter 8 Approximation Algorithms Algorithm Theory WS 2016/17 Fabian Kuhn Approximation Algorithms Optimization appears everywhere in computer science We have seen many examples, e.g.: scheduling jobs
More informationUsing a Divide and Conquer Method for Routing in a PC Vehicle Routing Application. Abstract
Using a Divide and Conquer Method for Routing in a PC Vehicle Routing Application Brenda Cheang Department of Management Information Systems University College Dublin Belfield, Dublin 4, Ireland. Sherlyn
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 397 E-mail: natarajan.meghanathan@jsums.edu Optimization vs. Decision
More informationTolerance based Greedy Heuristics for the Asymmetric TSP. Gerold Jäger Martin Luther University Halle-Wittenberg
Tolerance based Greedy Heuristics for the Asymmetric TSP Gerold Jäger Martin Luther University Halle-Wittenberg Cooperation with Boris Goldengorin DFG Project: Paul Molitor December 21, 200 Overview 1
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 informationThe Traveling Salesman Problem: Adapting 2-Opt And 3-Opt Local Optimization to Branch & Bound Techniques
The Traveling Salesman Problem: Adapting 2-Opt And 3-Opt Local Optimization to Branch & Bound Techniques Hitokazu Matsushita hitokazu@byu.edu Ogden Mills ogdenlaynemills@gmail.com Nathan Lambson nlambson@gmail.com
More informationLEXICOGRAPHIC LOCAL SEARCH AND THE P-CENTER PROBLEM
LEXICOGRAPHIC LOCAL SEARCH AND THE P-CENTER PROBLEM Refael Hassin, Asaf Levin and Dana Morad Abstract We introduce a local search strategy that suits combinatorial optimization problems with a min-max
More informationGREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR TRAVELING SALESMAN PROBLEM. A Thesis SEUNG HO LEE
GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR TRAVELING SALESMAN PROBLEM A Thesis by SEUNG HO LEE Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements
More informationALGORITHM CHEAPEST INSERTION
Version for STSP ALGORITHM CHEAPEST INSERTION. Choose the two furthest vertices i and k as initial subtour (c ik = max {c hj : (h, j) A}); set V := V \ {i} \ {k} (set of the unvisited vertices).. For each
More informationModule 6 P, NP, NP-Complete Problems and Approximation Algorithms
Module 6 P, NP, NP-Complete Problems and Approximation Algorithms Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu
More informationOn the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem
On the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem George Geranis, Konstantinos Paparrizos, Angelo Sifaleras Department of Applied
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 4 Homework Problems Problem
More informationLKH User Guide Version 2.0 (November 2007)
LKH User Guide Version 2.0 (November 2007) by Keld Helsgaun E-mail: keld@ruc.dk 1. Introduction The Lin-Kernighan heuristic [1] is generally considered to be one of the most successful methods for generating
More informationPartha Sarathi Mandal
MA 515: Introduction to Algorithms & MA353 : Design and Analysis of Algorithms [3-0-0-6] Lecture 39 http://www.iitg.ernet.in/psm/indexing_ma353/y09/index.html Partha Sarathi Mandal psm@iitg.ernet.in Dept.
More informationHigh Performance GPU Accelerated Local Optimization in TSP
2013 IEEE 27th International Symposium on Parallel & Distributed Processing Workshops and PhD Forum High Performance GPU Accelerated Local Optimization in TSP Kamil Rocki, Reiji Suda The University of
More informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationCS270 Combinatorial Algorithms & Data Structures Spring Lecture 19:
CS270 Combinatorial Algorithms & Data Structures Spring 2003 Lecture 19: 4.1.03 Lecturer: Satish Rao Scribes: Kevin Lacker and Bill Kramer Disclaimer: These notes have not been subjected to the usual scrutiny
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 informationInternational Journal of Computational Intelligence and Applications c World Scientific Publishing Company
International Journal of Computational Intelligence and Applications c World Scientific Publishing Company The Accumulated Experience Ant Colony for the Traveling Salesman Problem JAMES MONTGOMERY MARCUS
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 97 E-mail: natarajan.meghanathan@jsums.edu Optimization vs. Decision
More informationA HYBRID GENETIC ALGORITHM A NEW APPROACH TO SOLVE TRAVELING SALESMAN PROBLEM
A HYBRID GENETIC ALGORITHM A NEW APPROACH TO SOLVE TRAVELING SALESMAN PROBLEM G.ANDAL JAYALAKSHMI Computer Science and Engineering Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India
More information6.889 Lecture 15: Traveling Salesman (TSP)
6.889 Lecture 15: Traveling Salesman (TSP) Christian Sommer csom@mit.edu (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each 1 node v
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 Worst-case performance Probabilistic analysis and asymptotic
More informationUnit 8: Coping with NP-Completeness. Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems. Y.-W.
: Coping with NP-Completeness Course contents: Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems Reading: Chapter 34 Chapter 35.1, 35.2 Y.-W. Chang 1 Complexity
More informationApproximation Algorithms
Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Approximation Algorithms Tamassia Approximation Algorithms 1 Applications One of
More informationA memetic algorithm for symmetric traveling salesman problem
ISSN 1750-9653, England, UK International Journal of Management Science and Engineering Management Vol. 3 (2008) No. 4, pp. 275-283 A memetic algorithm for symmetric traveling salesman problem Keivan Ghoseiri
More informationOutline. CS38 Introduction to Algorithms. Approximation Algorithms. Optimization Problems. Set Cover. Set cover 5/29/2014. coping with intractibility
Outline CS38 Introduction to Algorithms Lecture 18 May 29, 2014 coping with intractibility approximation algorithms set cover TSP center selection randomness in algorithms May 29, 2014 CS38 Lecture 18
More informationMonte Carlo Simplification Model for Traveling Salesman Problem
Appl. Math. Inf. Sci. 9, No. 2, 721-727 (215) 721 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/1.12785/amis/922 Monte Carlo Simplification Model for Traveling Salesman
More informationGraph Applications, Class Notes, CS 3137 1 Traveling Salesperson Problem Web References: http://www.tsp.gatech.edu/index.html http://www-e.uni-magdeburg.de/mertens/tsp/tsp.html TSP applets A Hamiltonian
More information(Refer Slide Time: 01:00)
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture minus 26 Heuristics for TSP In this lecture, we continue our discussion
More informationA General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors 1
Algorithmica (1997) 18: 544 559 Algorithmica 1997 Springer-Verlag New York Inc. A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic
More informationLEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK
VOL., NO., JUNE 08 ISSN 896608 00608 Asian Research Publishing Network (ARPN). All rights reserved. LEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK Y. J. Lee Department
More informationScan Scheduling Specification and Analysis
Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract
More informationClustering Strategy to Euclidean TSP
2010 Second International Conference on Computer Modeling and Simulation Clustering Strategy to Euclidean TSP Hamilton Path Role in Tour Construction Abdulah Fajar, Nur Azman Abu, Nanna Suryana Herman
More informationIntroduction to Approximation Algorithms
Introduction to Approximation Algorithms Subir Kumar Ghosh School of Technology & Computer Science Tata Institute of Fundamental Research Mumbai 400005, India ghosh@tifr.res.in Overview 1. Background 2.
More informationApproximation Algorithms
18.433 Combinatorial Optimization Approximation Algorithms November 20,25 Lecturer: Santosh Vempala 1 Approximation Algorithms Any known algorithm that finds the solution to an NP-hard optimization problem
More informationA Tabu Search Heuristic for the Generalized Traveling Salesman Problem
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.
More informationDiscrete (and Continuous) Optimization WI4 131
Discrete (and Continuous) Optimization WI4 131 Kees Roos Technische Universiteit Delft Faculteit Electrotechniek, Wiskunde en Informatica Afdeling Informatie, Systemen en Algoritmiek e-mail: C.Roos@ewi.tudelft.nl
More informationCSE 417 Branch & Bound (pt 4) Branch & Bound
CSE 417 Branch & Bound (pt 4) Branch & Bound Reminders > HW8 due today > HW9 will be posted tomorrow start early program will be slow, so debugging will be slow... Review of previous lectures > Complexity
More informationAPPROXIMATION ALGORITHMS FOR GEOMETRIC PROBLEMS
APPROXIMATION ALGORITHMS FOR GEOMETRIC PROBLEMS Subhas C. Nandy (nandysc@isical.ac.in) Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata 70010, India. Organization Introduction
More information(a) (b) (c) Phase1. Phase2. Assignm ent offfs to scan-paths. Phase3. Determination of. connection-order offfs. Phase4. Im provem entby exchanging FFs
Scan-chain Optimization lgorithms for Multiple Scan-paths Susumu Kobayashi Masato Edahiro Mikio Kubo C&C Media Research Laboratories NEC Corporation Kawasaki, Japan Logistics and Information Engineering
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 2-approximate algorithm,
More informationImproved Minimum Spanning Tree Heuristics for Steiner Tree problem in graph
Improved Minimum Spanning Tree Heuristics for Steiner Tree problem in graph Ali Nourollah,2, Elnaz Pashaei, and Mohammad Reza Meybodi 3 Department of Electrical, Computer and IT Engineering, Qazvin Islamic
More information