A branch and cut algorithm for the VRP with satellite facilities

IIE Transactions (Institute of Industrial Engineers)

Volumn 30, Issue 9, 1998, Pages 821-834

  Bard, Jonathan F ^a   Huang, Liu ^b   Dror, Moshe ^c   Jaillet, P ^e  

^a The University of Texas at Austin   (United States)

^b DSC Communications   (United States)

^c UNIVERSITY OF ARIZONA   (United States)

^d UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^e NONE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; EMBEDDED SYSTEMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; RELAXATION PROCESSES; SATELLITE COMMUNICATION SYSTEMS;

BRANCH AND CUT ALGORITHMS; MIXED-INTEGER LINEAR PROGRAMMING METHOD; ROUTE TIME CONSTRAINTS; VEHICLE ROUTING PROBLEM (VRP);

TRANSPORTATION ROUTES;

EID: 0032155709     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179808966528     Document Type: Article

References (19)

1. Beltrami, E., and Bodin, L., (1974) Networks and vehicle routing for municipal waste collection. Networks, 4, 65–94.
2. Dror, M., Ball, M., and Golden, B., (1985) A computational comparison of algorithms for the inventory routing problem. Annals of Operations Research, 4, 3–23.
3. Jaillet, P., Huang, L., Bard, J.F., and Dror, M., (1998) A rolling horizon framework for the inventory routing problem. Working paper, Department of Management Science and Information systems, University of Texas, Austin, TX.
4. Bard, J.F., Huang, L., Jaillet, P., and Dror, M., (1998) A decomposition approach to the inventory routing problem with satellite facilities. To appear in Transportation Science.
5. Grotschel, M., and Padberg, M., (1985) Polyhedral theory. The Travelling Salesman Problem, Lawler, E.L., Lenstra, J.K., Ri-nnooy Kan, A.H.G. and Shmoys, D.B. (eds), John Wiley and Sons, Chichester, England, pp. 251–306.
6. Padberg, M., and Rinaldi, G., (1993) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review, 33, 60–100.
7. Laporte, G., (1992) The vehicle routing problem an overview of exact and approximate algorithms. European Journal of Operational Research, 59, 345–358.
8. Laporte, G., Mercure, H., and Nobert, Y., (1986) Exact algorithms for the asymmetrical capacitated vehicle routing problem. Networks, 16, 33–46.
9. Christofides, N., Mingozzi, A., and Toth, P., (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming 20, 255–282.
10. Desrochers, M., Desrosiers, J., and Solomon, M.M., (1992) A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40, 342–355.
11. Fisher, M., and Jaikumar, R., (1981) A generalized assignment heuristic for vehicle routing. Networks, 11, 109–124.
12. Laporte, G., Norbert, Y., and Desrochers, M., (1985) Optimal routing under capacity and distance restrictions. Operations Research, 33, 1050–1073.
13. Fischetti, M., and Toth, P., (1997) A polyhedral approach for the exact solution of hard ATSP instances. Management Science, 43 (11), 1520–1536.
14. Hoffman, K.L., and Padberg, M., (1993) Solving airline crew scheduling problem by branch-and-cut. Management Science, 39 (6), 657–682.
15. Balas, E., Ceria, S., Cornuejols, G., and Pataki, G., (1996) Polyhedral methods for the maximum clique problem. DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, 26, 11–27.
16. Nemhauser, G.L., and Wolsey, L.A., (1988) Integer and Combinatorial Optimization. John Wiley and Sons, New York.
17. Savelsbergh, M.W.P., and Nemhauser, G.L., (1995) Functional description of MINTO, a Mixed INTeger Optimizer. Georgia Institute of Technology, School of Industrial and Systems Engineering, Altanta, GA.
18. Nagmochi, H., and Ibaraki, T., (1992) Computing edge-connectivity in multigraphs and capaciated graphs. SIAM Journal of Descrete Mathematics, 5 (1), 54–66.
19. Frank, A., (1994) On the edge-connectivity algorithm of Nag-amochi and Ibarkai. Working paper, ARTEMIS-IMAG Univer-site de Grenoble, Grenoble, France.