An empirical study of a new metaheuristic for the traveling salesman problem

DOI10.1016/S0377-2217(96)00334-7MaRDI QIDQ1291637zbMATH OpenOpenAlexFDO

Authors Shigeru Tsubakitani, James R. Evans

Publication date 22 February 2001

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

Full work available at URL https://doi.org/10.1016/s0377-2217(96)00334-7

zbMATH Keywords

computational analysisheuristicstraveling salesman

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A tour construction heuristic for the travelling salesman problem
• Union search: a new meta-heuristic algorithm to the traveling salesman problem
• Tabu Search—Part II
• Tabu search performance on the symmetric travelling salesman problem

Cites work

• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A man-machine approach toward solving the traveling salesman problem
• An Algorithm for the Traveling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Approximate Traveling Salesman Algorithms
• Computer Solutions of the Traveling Salesman Problem
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Hill Climbing with Multiple Local Optima
• scientific article; zbMATH DE number 432754 (Why is no real title available?)
• scientific article; zbMATH DE number 41029 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Optimization by simulated annealing
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Some Examples of Difficult Traveling Salesman Problems
• Tabu Search—Part I
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees

Cited in

(5)

• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• Union search: a new meta-heuristic algorithm to the traveling salesman problem
• A framework for analyzing sub-optimal performance of local search algorithms
• Fifty years of metaheuristics
• Metaheuristics for the distance constrained generalized covering traveling salesman problem

This page was built for publication: An empirical study of a new metaheuristic for the traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291637)