An exact algorithm for the period routing problem

Operations Research

Volumn 59, Issue 1, 2011, Pages 228-241

  Baldacci, Roberto ^a   Bartolini, Enrico ^b   Mingozzi, Aristide ^a   Valletta, Andrea ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c NEMSYS Network Models and System Optimization   (Italy)

Author keywords

Dual ascent; Dynamic programming; Period vehicle routing; Set partitioning

Indexed keywords

COMPUTATIONAL RESULTS; DELIVERY ROUTES; DUAL ASCENT; EXACT ALGORITHMS; EXACT SOLUTION; INTEGER PROGRAMMING FORMULATIONS; LOWER BOUNDS; MULTI-PERIOD; PERIOD VEHICLE ROUTING; PLANNING PERIOD; ROUTING PROBLEMS; SET PARTITIONING; TEST INSTANCES; TIME HORIZONS; VEHICLE ROUTING PROBLEMS;

INTEGER PROGRAMMING; ROUTING ALGORITHMS; VEHICLES;

DYNAMIC PROGRAMMING;

EID: 79952925170     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1100.0875     Document Type: Article

References (31)

1. Alegre, J., M. Laguna, J. Pacheco. 2007. Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Eur. J. Oper. Res. 179(3) 736-746. (Pubitemid 46038586)
2. Baldacci, R., A. Mingozzi. 2009. A unified exact method for solving different classes of vehicle routing problems. Math. Programming Ser. A 120(2) 347-380.
3. Baldacci, R., N. Christofides, A. Mingozzi. 2008. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming Ser. A 115(2) 351-385.
4. Baldacci, R., E. A. Hadjiconstantinou, A. Mingozzi. 2004. An exact algorithm for the capacitated vehicle routing problem based on a twocommodity network flow formulation. Oper. Res. 52(5) 723-738.
5. Beasley, J. E., C. C. R. Tan. 1984. A heuristic algorithm for the period routing problem. Omega 12(5) 497-504.
6. Beltrami, E. J., L. D. Bodin. 1974. Networks and vehicle routing for municipal waste collection. Networks 4(1) 65-94.
7. Blakeley, F., B. Arguello, B. Cao, W. Hall, J. Knolmajer. 2003. Optimizing periodic maintenance operations for Schindler Elevator Corporation. Interfaces 33(1) 67-79. (Pubitemid 36412596)
8. Bostel, N., P. Dejax, P. Guez, F. Tricoire. 2008. Multiperiod planning and routing on a rolling horizon for field force optimization logistics. B. L. Golden, S. Raghavan, E. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges, Vol. 43. Springer-Verlag, Berlin.
9. Butler, M., H. P. Williams, L.-A. Yarrow. 1997. The two-period travelling salesman problem applied to milk collection in Ireland. Comput. Optim. Appl. 7(3) 291-306. (Pubitemid 127508441)
10. Carter, M. W., J. M. Farvolden, G. Laporte, J. Xu. 1996. Solving an integrated logistics problem arising in grocery distribution. INFOR 34(4) 290-306.
11. Chao, I. M., B. L. Golden, E. Wasil. 1995. An improved heuristic for the period vehicle-routing problem. Networks 26(1) 25-44.
12. Christofides, N., J. E. Beasley. 1984. The period routing problem. Networks 14(2) 237-256.
13. Christofides, N., A. Mingozzi, P. Toth. 1981a. Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation. Math. Programming 10(1) 255-280.
14. Christofides, N., A. Mingozzi, P. Toth. 1981b. State space relaxation procedures for the computation of bounds to routing problems. Networks 11(2) 145-164. (Pubitemid 13506977)
15. Cordeau, J.-F., M. Gendreau, G. Laporte. 1997. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2) 105-119. (Pubitemid 127360996)
16. CPLEX. 2008. ILOG CPLEX 11.0 Callable Library. ILOG.
17. Francis, P., K. Smilowitz, M. Tzur. 2006. The period vehicle routing problem with service choice. Transportation Sci. 40(4) 439-454. (Pubitemid 44746134)
18. Francis, P., K. Smilowitz, M. Tzur. 2008. The period vehicle routing problem and its extensions. B. L. Golden, S. Raghavan, E. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges, Vol. 43. Springer-Verlag, Berlin.
19. Fukasawa, R., H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa, R. F. Werneck. 2006. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming Ser. A 106(3) 491-511.
20. Gaudioso, M., G. Paletta. 1992. A heuristic for the periodic vehiclerouting problem. Transportation Sci. 26(2) 86-92.
21. Golden, B. L., E. A. Wasil. 1987. Computerized vehicle routing in the soft drink industry. Oper. Res. 35(1) 6-17.
22. Hemmelmayr, V. C., K. F. Doerner, R. F. Hartl. 2009. A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3) 791-802.
23. Jang, W., H. H. Lim, T. J. Crowe, G. Raskin, T. E. Perkins. 2006. The Missouri Lottery optimizes its scheduling and routing to improve efficiency and balance. Interfaces 36(4) 302-313. (Pubitemid 44186459)
24. Laporte, G., Y. Nobert, D. Arpin. 1984. Optimal solutions to capacitated multi depot vehicle routing problem. Congressus Numerantium 44 283-292.
25. Laporte, G., Y. Nobert, S. Taillefer. 1988. Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Sci. 22(3) 161-172. (Pubitemid 18654114)
26. Lysgaard, J., A. N. Letchford, R. W. Eglese. 2004. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming Ser. A 100(2) 423-445. (Pubitemid 40878095)
27. Mourgaya, M., F. Vanderbeck. 2006. The periodic vehicle routing problem: Classification and heuristic. RAIRO Oper. Res. 40(2) 169-194. (Pubitemid 44563698)
28. Mourgaya, M., F. Vanderbeck. 2007. Column generation based heuristic for tactical planning in multi-period vehicle routing. Eur. J. Oper. Res. 183(3) 1028-1041. (Pubitemid 47039186)
29. Russel, R. A., D. Gribbin. 1991. A multiphase approach to the period routing problem. Networks 21(7) 747-765.
30. Russel, R. A., W. Igo. 1979. An assignment routing problem. Networks 9(1) 1-17.
31. Tang, H., E. Miller-Hooks, R. Tomastik. 2007. Scheduling technicians for planned maintenance of geographically distributed equipment. Transportation Res. Part E: Logist. Transportation Rev. 43(5) 591-609. (Pubitemid 46979984)