An additive bounding procedure for the asymmetric travelling salesman problem
Mathematical Programming: Series A and B
Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software (TOMS)
Near-optimal intraprocedural branch alignment
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
A polyhedral approach to the asymmetric traveling salesman problem
Management Science
Asymptotic experimental analysis for the Held-Karp traveling salesman bound
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Depth-First Branch-and-Bound versus Local Search: A Case Study
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
Journal of Computational and Applied Mathematics
Lower tolerance-based Branch and Bound algorithms for the ATSP
Computers and Operations Research
Quick-ACO: accelerating ant decisions and pheromone updates in ACO
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
An infrastructure-based approach to support dynamic networks with mobile agents
WAC'04 Proceedings of the First international IFIP conference on Autonomic Communication
An ILS-Based metaheuristic for the stacker crane problem
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Are Stacker Crane Problems easy? A statistical study
Computers and Operations Research
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis
Computers and Operations Research
| Hi-index | 0.00 |
The purpose of this paper is to provide a preliminary report on the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There are currently three general classes of such heuristics: classical tour construction heuristics such as Nearest Neighbor and the Greedy algorithm, local search algorithms based on re-arranging segments of the tour, as exemplified by the Kanellakis-Papadimitriou algorithm [KP80], and algorithms based on patching together the cycles in a minimum cycle cover, the best of which are variants on an algorithm proposed by Zhang [Zha93]. We test implementations of the main contenders from each class on a variety of instance types, introducing a variety of new random instance generators modeled on real-world applications of the ATSP. Among the many tentative conclusions we reach is that no single algorithm is dominant over all instance classes, although for each class the best tours are found either by Zhang's algorithm or an iterated variant on Kanellakis-Papadimitriou.