Exact solution of large-scale, asymmetric traveling salesman problems

@article{Carpaneto1995ExactSO,
  title={Exact solution of large-scale, asymmetric traveling salesman problems},
  author={Giorgio Carpaneto and Mauro Dell'Amico and Paolo Toth},
  journal={ACM Trans. Math. Softw.},
  year={1995},
  volume={21},
  pages={394-409}
}
A lowest-first, branch-and-bound algorithm for the <italic>Asymmetric Traveling Salesman Problem</italic> is presented. The method is based on the <italic>Assignment Problem relaxation</italic> and on a <italic>subtour elimination branching scheme</italic>. The effectiveness of the algorithm derives from reduction procedures and parametric solution of the relaxed problems associated with the nodes of the branch-decision tree. Large-size, uniformly, randomly generated instances of complete… 
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
TLDR
The aim of this paper is to evaluate the effectiveness of a branch-and-cut algorithm exploiting ATSP-specific facet-defining cuts to be used to attack hard instances that cannot be solved by the AP-based procedures from the literature.
Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems
TLDR
The Fortran code CDT, implementing an algorithm for theasymmetric traveling salesman problem, based on the Assignment Problem relaxation and on a tour elimination branching scheme, is presented.
Tolerance-based Branch and Bound algorithms for the ATSP
Lower tolerance-based Branch and Bound algorithms for the ATSP
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
TLDR
A preliminary report on the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP), finding that no single algorithm is dominant over all instance classes, although for each class the best tours are found by Zhang's algorithm or an iterated variant on Kanellakis-Papadimitriou.
Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem
TLDR
This paper studies phase transitions of the asymmetric Traveling Salesman Problem, an NP-hard combinatorial optimization problem that has many real-world applications and empirically shows that many properties of the problem, including the optimal tour cost and backbone size, experience sharp transitions as the precision of intercity distances increases across a critical value.
Asymmetric Traveling Salesman and Multi-Stopover Problem with Turn Restrictions-Exact Real-Time Computation for Stopovers ≤ 10
TLDR
An algorithm directly working on directed graphs observing turn restrictions indispensable for today’s civil and military navigation applications is given.
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison
This paper surveys the most effective mathematical models and exact algorithms proposed for finding the optimal solution of the well-known Asymmetric Traveling Salesman Problem (ATSP). The
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a “polyhedral” cutting-plane procedure that
Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems
TLDR
The Fortran code CDT, implementing an algorithm for theasymmetric traveling salesman problem, based on the Assignment Problem relaxation and on a tour elimination branching scheme, is presented.
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
A parallel branch and bound algorithm that solves the asymmetric traveling salesman problem to optimality is described. The algorithm uses an assignment problem based lower bounding technique,
A restricted Lagrangean approach to the traveling salesman problem
TLDR
An algorithm for the asymmetric traveling salesman problem (TSP) using a new, restricted Lagrangean relaxation based on the assignment problem (AP) that can be adapted to the symmetric TSP by using the 2-matching problem instead of AP is described.
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
TLDR
This paper presents a breadth-first branch and bound algorithm which differs from the method of Smith, Srinivasan and Thompson in the selection of the subtour to be split, in the ordering of the arcs in the selected subtour, and in the computation of different partial lower bounds and in different data structures to facilitate the updating of the cost matrix.
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
TLDR
A parallel branch and bound algorithm that solves the asymmetric traveling salesman problem to optimality is described and is organized around a new data flow framework for parallel Branch and bound.
Exact Solution of Large Asymmetric Traveling Salesman Problems
TLDR
The results show that the algorithm performs remarkably well for some classes of problems, determining an optimal solution even for problems with large numbers of cities, yet for other classes, even small problems thwart determination of a provably optimal solution.
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
  • R. Karp
  • Computer Science
    SIAM J. Comput.
  • 1979
TLDR
The algorithm first solves the assignment problem for the matrix D, and then patches the cycles of the optimum assignment together to form a tour, which tends to give nearly optimal solutions when the number of cities is extremely large.
Branch and Bound Methods for the Traveling Salesman Problem
TLDR
The state of the art in enumerative solution methods for the traveling salesman problem (TSP) is reviewed, including the results and statistical analysis of some computational experiments designed for the purposes of this review.
...
1
2
3
...