Solving the maximum clique problem by k-opt local search
Proceedings of the 2004 ACM symposium on Applied computing
Iterated Local Optimization for Minimum Energy Broadcast
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
New meta-heuristic for combinatorial optimization problems: intersection based scaling
Journal of Computer Science and Technology
Expanding Neighborhood GRASP for the Traveling Salesman Problem
Computational Optimization and Applications
An effective local search for the maximum clique problem
Information Processing Letters
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Computers and Operations Research
How autonomy oriented computing (AOC) tackles a computationally hard optimization problem
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Combining Forces to Reconstruct Strip Shredded Text Documents
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A New Three-Level Tree Data Structure for Representing TSP Tours in the Lin-Kernighan Heuristic
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Speed-up techniques for solving large-scale biobjective TSP
Computers and Operations Research
Multiagent optimization system for solving the traveling salesman problem (TSP)
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Computers and Operations Research
An effective local search for the maximum clique problem
Information Processing Letters
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Reducing the size of traveling salesman problem instances by fixing edges
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Iterated k-opt local search for the maximum clique problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Improving the efficiency of Helsgaun's Lin-Kernighan Heuristic for the symmetric TSP
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Two-phase Pareto local search for the biobjective traveling salesman problem
Journal of Heuristics
A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Approximate solution of the multiple watchman routes problem with restricted visibility range
IEEE Transactions on Neural Networks
Artificial Life and Robotics
A Sensor Placement Algorithm for a Mobile Robot Inspection Planning
Journal of Intelligent and Robotic Systems
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
Information Sciences: an International Journal
Exploiting decomposability using recombination in genetic algorithms: an exploratory discussion
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
Discovering the suitability of optimisation algorithms by learning from evolved instances
Annals of Mathematics and Artificial Intelligence
Expert Systems with Applications: An International Journal
cAS: ant colony optimization with cunning ants
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A modified inver-over operator for the traveling salesman problem
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Computers & Mathematics with Applications
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
Improving Lin-Kernighan-Helsgaun with crossover on clustered instances of the TSP
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
INFORMS Journal on Computing
Multi-robot repeated area coverage
Autonomous Robots
Visiting convex regions in a polygonal map
Robotics and Autonomous Systems
Three-dimensional coverage planning for an underwater inspection robot
International Journal of Robotics Research
Distributed multi-robot patrol: A scalable and fault-tolerant framework
Robotics and Autonomous Systems
A discrete gravitational search algorithm for solving combinatorial optimization problems
Information Sciences: an International Journal
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem
Discrete Applied Mathematics
Hierarchical Clustering of High- Throughput Expression Data Based on General Dependences
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A backbone based TSP heuristic for large instances
Journal of Heuristics
| Hi-index | 0.00 |
We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic for large-scale traveling salesman problems. Computational results are presented for TSPLIB instances ranging in size from 11,849 cities up to 85,900 cities; for each of these instances, solutions within 1% of the optimal value can routinely be found in under one CPU minute on a 300 MHz Pentium II workstation, and solutions within 0.5% of optimal can routinely be found in under ten CPU minutes. We also demonstrate the scalability of the heuristic, presenting results for randomly generated Euclidean instances having up to 25,000,000 cities. For the largest of these random instances, a tour within 1% of an estimate of the optimal value was obtained in under one CPU day on a 64-bit IBM RS6000 workstation.