Tabu search performance on the symmetric travelling salesman problem

DOI10.1016/0305-0548(94)90016-7zbMath0814.90124OpenAlexW2054706926MaRDI QIDQ1342103

John A. Knox

Publication date: 11 January 1995

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90016-7

zbMATH Keywords

tabu searchK-OPT proceduresymmetric TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, A user's guide to tabu search, Solving large batches of traveling salesman problems with parallel and distributed computing, Routing problems: A bibliography, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, A framework for analyzing sub-optimal performance of local search algorithms, Randomized gravitational emulation search algorithm for symmetric traveling salesman problem, Routing heuristics for automated pick and place machines, Guided local search and its application to the traveling salesman problem, An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Future paths for integer programming and links to artificial intelligence
• A Dynamic Programming Approach to Sequencing Problems
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Solution of a Large-Scale Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• A man-machine approach toward solving the traveling salesman problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem