An Exact Algorithm for the Period Routing Problem

References

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