Guided local search and its application to the traveling salesman problem

DOI10.1016/S0377-2217(98)00099-XzbMath0937.90094WikidataQ94086017 ScholiaQ94086017MaRDI QIDQ1808420

Edward P. K. Tsang, Christos Voudouris

Publication date: 24 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristics; combinatorial optimization; tabu search; traveling salesman; guided local search

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

Related Items

Upper and lower bounding strategies for the generalized minimum spanning tree problem, Applying the attribute based hill climber heuristic to the vehicle routing problem, Combining VNS with constraint programming for solving anytime optimization problems, Path planning on a cuboid using genetic algorithms, Translational packing of arbitrary polytopes, Active guided evolution strategies for large-scale vehicle routing problems with time windows, Two-dimensional packing problems: a survey, A guided local search heuristic for the capacitated arc routing problem, Ant colony optimization for solving an industrial layout problem, Problems of discrete optimization: challenges and main approaches to solve them, A guided local search metaheuristic for the team orienteering problem, Solving the one-dimensional bin packing problem with a weight annealing heuristic, Fast and high precision algorithms for optimization in large-scale genomic problems, Fast neighborhood search for two- and three-dimensional nesting problems, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Automatic production planning of press brakes for sheet metal bending

Uses Software

• TSPLIB
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A modified Lin--Kernighan traveling-salesman heuristic
• An improved annealing scheme for the QAP
• The traveling salesman problem: An overview of exact and approximate algorithms
• Large-step Markov chains for the TSP incorporating local search heuristics
• Some experiments with simulated annealing techniques for packing problems
• The traveling salesman. Computational solutions for RSP applications
• Tabu search performance on the symmetric travelling salesman problem
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Greedy randomized adaptive search procedures
• Future paths for integer programming and links to artificial intelligence
• Combining simulated annealing with local search heuristics
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Tabu Search—Part II
• Fast Algorithms for Geometric Traveling Salesman Problems
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Solving vehicle routing problems using constraint programming and metaheuristics