Determination of the candidate arc set for the asymmetric traveling salesman problem

DOI10.1016/j.cor.2003.09.011zbMath1094.90048OpenAlexW2069895684MaRDI QIDQ2485161

Maing-Kyu Kang, Hun-Tae Kim, Sang-Ho Kwon

Publication date: 3 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.011

zbMATH Keywords

traveling salesmanheuristiccandidate arc setout-of-kilter

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• TSPLIB
• LKH
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modified Lin--Kernighan traveling-salesman heuristic
• New edges not used in shortest tours of TSP
• The traveling salesman. Computational solutions for RSP applications
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Local Search for the Asymmetric Traveling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Construction heuristics for the asymmetric TSP.

This page was built for publication: Determination of the candidate arc set for the asymmetric traveling salesman problem