An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Facet identification for the symmetric traveling salesman polytope
Mathematical Programming: Series A and B
Facets of the asymmetric traveling salesman polytope
Mathematics of Operations Research
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets
Mathematical Programming: Series A and B
The precedence-constrained asymmetric traveling salesman polytope
Mathematical Programming: Series A and B
A polyhedral approach to the asymmetric traveling salesman problem
Management Science
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
SCIL - Symbolic Constraints in Integer Linear Programming
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A cooperative parallel rollout algorithm for the sequential ordering problem
Parallel Computing - Special issue: Parallel computing in logistics
Solving real-world ATSP instances by branch-and-cut
Combinatorial optimization - Eureka, you shrink!
An Evolutionary Approach for a Topologic Constrained Routing Problem
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Operations Research
The optimal sequenced route query
The VLDB Journal — The International Journal on Very Large Data Bases
Engineering Applications of Artificial Intelligence
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: a matheuristic
INOC'11 Proceedings of the 5th international conference on Network optimization
A meta-heuristic applied for a topologic pickup and delivery problem with time windows constraints
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Online silk road: nurturing social search through knowledge bartering
Proceedings of the 2013 conference on Computer supported cooperative work
| Hi-index | 0.00 |
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain other nodes in any feasible directed tour. This problem occurs as a basic model in scheduling and routing and has a wide range of applications varying from helicopter routing (Timlin, Master's Thesis, Department of Combinatorics and Optimization, University of Waterloo, 1989), sequencing in flexible manufacturing (Ascheuer et al., Integer Programming and Combinatorial Optimization, University of Waterloo, Waterloo, 1990, pp. 19–28; Idem., SIAM Journal on Optimization, vol. 3, pp. 25–42, 1993), to stacker crane routing in an automatic storage system (Ascheuer, Ph.D. Thesis, Tech. Univ. Berlin, 1995). We give an integer programming model and summarize known classes of valid inequalities. We describe in detail the implementation of a branch&cut-algorithm and give computational results on real-world instances and benchmark problems from TSPLIB. The results we achieve indicate that our implementation outperforms other implementations found in the literature. Real world instances with more than 200 nodes can be solved to optimality within a few minutes of CPU-time. As a side product we obtain a branch&cut-algorithm for the ATSP. All instances in TSPLIB can be solved to optimality in a reasonable amount of computation time.