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

DOI10.1016/S0377-2217(96)00334-7zbMath0955.90107OpenAlexW1982298984MaRDI QIDQ1291637

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

heuristicstraveling salesmancomputational analysis

Mathematics Subject Classification ID

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

Related Items (2)

A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods ⋮ A framework for analyzing sub-optimal performance of local search algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• 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
• Hill Climbing with Multiple Local Optima
• Approximate Traveling Salesman Algorithms
• Tabu Search—Part I
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Some Examples of Difficult Traveling Salesman Problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• An Algorithm for the Traveling Salesman Problem
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• A man-machine approach toward solving the traveling salesman problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

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