Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs

International Transactions in Operational Research

Volumn 7, Issue 4-5, 2000, Pages 431-447

  Mak, V ^a   Boland, N ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Combinatorial optimisation; Routing

Indexed keywords

EID: 2242439193     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2000.tb00209.x     Document Type: Article

References (20)

1. Aarts, E.H.L., Van Laarhoven, P.J.M., 1985. Statistical cooling: a general approach to combinatorial optimization problems. Philips Journal of Research 40, 193-226.
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, NJ.
3. Boland, N.L., Clarke, L.W., Nemhauser, G.L., to appear. The asymmetric traveling salesman problem with replenishment arcs. In: Burkard, R., Labbe, M., Ramos, T., Sicilia, J. (Eds.), European Journal of Operational Research: Special Issue on Combinatorial Optimization.
4. Barnhart, C., Boland, N.L., Clarke, L.W., Johnson, E.L., Nemhauser, G.L., Shenoi, R.G., 1998. Flight string models for aircraft fleeting and routing. Transportation Science 32, 208-220.
5. Clarke, L.W., Johnson, E.L., Nemhauser, G.L., Zhu, Z., 1997. The aircraft rotation problem. Annals of Operations Research: Mathematics of Industrial Systems II 69, 33-46.
6. Dantzig, G., Fulkerson, R., Johnson, S., 1954. Solution of a large scale travelling salesman problem. Operations Research 2, 393-410.
7. Desrochers, M., Laporte, G., 1991. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 10, 27-36.
8. Dowsland, K.A., 1993. Simulated Annealing. In: Reeves, C. (Ed.), Modern Heuristic Techniques for Combinatorial Problems. Halsted Press, New York.
9. Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M., 1995. An optimal algorithm for the travelling salesman problem with time windows. Operation Research 43 (2), 367-371.
10. ILOG S.A., 1999. ILOG CPLEX 6.5 Reference Manual.
11. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C., 1989. Optimization by simulated annealing: an experimental evaluation; Part I. Graph partitioning, Operations Research 37, 865-892.
12. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C., 1990. Optimization by simulated annealing: an experimental evaluation; Part II. Graph colouring and number partitioning, Operations Research 39, 378-406.
13. Johnson, D., McGeoch, L.A., 1997. The travelling salesman problem: a case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (Eds.), Local Search in Combinatorial Optimization. Wiley, New York.
14. Larsson, R., Patriksson, M., Stromberg, A., 1996. Conditional sub gradient optimization—theory and applications. European Journal of Operations Research 88, 382-403.
15. Mak, V., Boland, N., 1999. Exact approaches to the asymmetric travelling salesman problem with replenishment arcs, working paper.
16. Miller, C.E., Tucker, A.W., Zemlin, R.A., 1960. Integer programming formulation of travelling salesman problems. Journal of the Association for Computing Machinery 7, 326-329.
17. Polyak, B.T., 1969. Minimization of unsmooth functionals. USSR, Computational Mathematics and Mathematical Physics 9, 14-29.
18. TSPLIB, 1995. http:www.iwr.uni-heidelberg.deiwrcomoptsoftTSPLIB95TSPLIB.html.
19. Vigo, D.A., 1996. Heuristic algorithm for the asymmetric capacitated vehicle routing problem. European Journal of Operational Research 89, 108-126.
20. Zhu, Z., 1994. The aircraft rotation problem. Ph.D. thesis, Georgia Institute of Technology.