Optimizing tabu list size for the traveling salesman problem

DOI10.1016/S0305-0548(97)00030-0zbMath0907.90226OpenAlexW1984641114MaRDI QIDQ1265842

James R. Evans, Shigeru Tsubakitani

Publication date: 1998

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00030-0

zbMATH Keywords

heuristicstabu searchsymmetric traveling salesman

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

A tabu search experience in production scheduling ⋮ An evolution-based tabu search approach to codebook design ⋮ Randomized gravitational emulation search algorithm for symmetric traveling salesman problem ⋮ Improving connectivity of compromised digital networks via algebraic connectivity maximisation ⋮ A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Cites Work

• Unnamed Item
• Using tabu search techniques for graph coloring
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• Future paths for integer programming and links to artificial intelligence
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• Tabu Search—Part I
• Computer Solutions of the Traveling Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Optimizing tabu list size for the traveling salesman problem