Embedded local search approaches for routing optimization

DOI10.1016/S0305-0548(03)00248-XzbMath1061.90092OpenAlexW2067125151MaRDI QIDQ1886851

R. Keuthen, Peter I. Cowling

Publication date: 19 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00248-x

zbMATH Keywords

Travelling salesmanLocal searchVariable neighbourhood searchIterated local search

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (4)

Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications ⋮ Hybridizing exact methods and metaheuristics: a taxonomy

Uses Software

• TSPLIB
• LKH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• Large-step Markov chains for the TSP incorporating local search heuristics
• The traveling salesman. Computational solutions for RSP applications
• Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
• Variable neighborhood search
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Relaxed tours and path ejections for the traveling salesman problem
• Combining simulated annealing with local search heuristics
• Improved large-step Markov chain variants for the symmetric TSP
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• A tiling and routing heuristic for the screening of cytological samples
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Local Search for the Asymmetric Traveling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• Fast Algorithms for Geometric Traveling Salesman Problems
• Multidimensional binary search trees used for associative searching
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: Embedded local search approaches for routing optimization