The asymmetric traveling salesman problem with replenishment arcs

European Journal of Operational Research

Volumn 123, Issue 2, 2000, Pages 408-427

  Boland, N L ^a,b   Clarke, L W ^a   Nemhauser, G L ^a  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Column generation; Cut generation; Optimization; Traveling salesman

Indexed keywords

AIR TRAFFIC CONTROL; AIRCRAFT; ALGORITHMS; CONSTRAINT THEORY; OPTIMIZATION; SCHEDULING;

BRANCH AND PRICE AND CUT ALGORITHM; COLUMN GENERATION; CUT GENERATION;

TRAVELING SALESMAN PROBLEM;

EID: 0033889813     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00266-0     Document Type: Article

References (25)

1. J.M. van den Akker, C.A.J. Hurkens, M.W.P. Savelsbergh, Time-indexed formulation for single-machine scheduling problems: Column generation, INFORMS Journal on Computing, to appear.
2. E. Balas, M. Fischetti, A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets, Mathematical Programming 58 (1993) 325-352.
3. C. Barnhart, N.L. Boland, L.W. Clarke, E.L. Johnson, G.L. Nemhauser, R.G. Shenoi, Flight string models for aircraft fleeting and routing, Transporation Science 32 (1998) 208-220.
4. C. Barnhart, E.L. Johnson, R. Anbil, L. Hatay, A column-generation technique for the long-haul crew assignment problem, in: T.A. Ciriano, R.C. Leachman (Eds.), Optimization in Industry, vol. II, Wiley, New York, 1994, pp. 7-24.
5. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, Operations Research 46 (1998) 316-329.
6. N.L. Boland, L.W. Clarke, G.L. Nemhauser, The asymmetric traveling salesman problem with replenishment arcs (Extended Version) Technical Paper, Industrial & Systems Engineering, Georgia Tech, Atlanta, GA, 1997.
7. L.W. Clarke, E.L. Johnson, G.L. Nemhauser, Z. Zhu, The aircraft rotation problem, Annals of Operations Research: Mathematics of Industrial Systems II 69 (1997) 33-46.
8. M. Desrochers, An algorithm for the shortest path problem with resource constraints, Technical Paper, Centre de Recherche sur les Transports, Université de Montréal, Montreal, Publication No. 421A, 1986.
9. M. Desrochers, J. Desrosiers, M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40 (1992) 342-354.
10. J. Desrosiers, Y. Dumas, M.M. Solomon, F. Soumis, Time constrained routing and scheduling, in: M.O. Ball, T.L. Magnanti, G.L. Monma, G.L. Nemhauser (Eds.), Network Routing, Handbooks in Operation Research and Management Science, vol. 8, Elsevier, Amsterdam, 1995, pp. 35-140.
11. J. Edmonds, Maximum matching and a polyhedron with 0, 1 vertices, Journal of Research of the National Bureau of Standards 69B (1965) 125-130.
12. M. Garey, D. Johnson, Computers and Intractibility, Freeman, San Francisco, CA, 1979.
13. A.M. Geoffrion, Lagrangian relaxation for integer programming, Mathematical Programming Studies 2 (1974) 82-114.
14. D. Goldfarb, M.J. Todd, Linear programming, in: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd (Eds.), Optimization, Handbooks in Operation Research and Management Science, vol. 1, Elsevier, Amsterdam, 1989, pp. 73-170.
15. M. Grötschel, M. Padberg, Polyhedral theory, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem: A Guided Tour of Combinitorial Optimization, Wiley, New York, 1985, pp. 251-306.
16. J. Hao, J.B. Orlin, A faster algorithm for finding the minimum cut in a graph, in: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, FL, 1992, pp. 165-174.
17. J.M. Jaffe, Algorithms for finding paths with multiple constraints, Networks 14 (1984) 95-116.
18. S. Lavoie, M. Minoux, E. Odier, A new approach for crew pairing problems by column generation with an application to air transportation, European Journal of Operations Research 35 (1988) 45-58.
19. G.L. Nemhauser, M.W.P. Savelsbergh, G.C. Sigismondi, MINTO, a mixed INTeger optimizer, Operations Research Letters 15 (1994) 47-58.
20. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
21. M. Padberg, T.-Y. Sung, An analytical comparison of different formulations of the travelling salesman problem, Mathematical Programming 52 (1991) 315-357.
22. G. Skorobohatyj, Public domain software from ftp.zib.de in pub/Packages/mathprog/mincut/global-dir.
23. http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB 95/TSPLIB.html.
24. P.H. Vance, C. Barnhart, E.L. Johnson, G.L. Nemhauser, Solving binary cutting stock problems by column generation, Computational Optimization and Applications 3 (1994) 111-130.
25. P.H. Vance, C. Barnhart, E.L. Johnson, G.L. Nemhauser, Airline crew scheduling: A new formulation and decomposition algorithm, Operations Research 45 (1997) 188-200.