The Period Vehicle Routing Problem with Service Choice

References

• Anily S., Bramel J., Tayur R. G. S., Magazine M. Vehicle routing and the supply chain. Quantitative Models for Supply Chain Management (1998) (Kluwer Academic Publishers, Norwell, MA) Google Scholar
• Anily S., Federgruen A. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. (1990) 36(1):92–114Link, Google Scholar
• Bard J., Huang L., Jaillet P., Dror M. A decomposition approach to the inventory routing problem with satellite facilities. Transportation Sci. (1998) 32:189–203Link, Google Scholar
• Beltrami E., Bodin L. Networks and vehicle routing for municipal waste collection. Networks (1974) 4:65–94Crossref, Google Scholar
• Chan L., Federgruen A., Simchi-Levi D. Probabilistic analysis and practical algorithms for inventory-routing models. Oper. Res. (1998) 46(1):96–106Link, Google Scholar
• Chao I.-M., Golden B., Wasil E. An improved heuristic for the period vehicle routing problem. Networks (1995) 26:25–44Crossref, Google Scholar
• Christofides N., Beasley J. The period routing problem. Networks (1984) 14:237–256Crossref, Google Scholar
• Clarke G., Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. (1964) 12:568–581Link, Google Scholar
• Cordeau J.-F., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks (1997) 30:105–119Crossref, Google Scholar
• Daskin M. S. Heuristics for the vehicle routing problem. (2004) . Personal communication (February)Google Scholar
• Federgruen A., Simchi-Levi D. Analysis of vehicle routing and inventory-routing problems. Handbooks in Operations Research and Management Science (1995) 8(Elsevier Science B.V., Amsterdam, The Netherlands) 297–373Crossref, Google Scholar
• Feillet D., Dejax P., Gendreau M. Traveling salesman problems with profits. Transportation Sci. (2003) 39(2):188–205Link, Google Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27(1):1–18Link, Google Scholar
• Fisher M. L. An application oriented guide to Lagrangian relaxation. Interfaces (1985) 15(2):2–21Link, Google Scholar
• Fisher M. L., Jaikumar R. A generalized assignment heuristic for vehicle routing problems. Networks (1981) 11:109–124Crossref, Google Scholar
• Gaudioso M., Paletta G. A heuristic for the period vehicle routing problem. Transportation Sci. (1992) 26(2):86–92Link, Google Scholar
• Gaur V., Fisher M. A periodic inventory routing problem at a supermarket chain. Oper. Res. (2004) 52(6):813–822Link, Google Scholar
• Herer Y., Tzur M., Setty O. An inventory routing problem with dynamic deterministic demand. (2003) . Working paper, Industrial Engineering Department, Tel Aviv University, IsraelGoogle Scholar
• Kim J.-U., Kim Y.-D. A Lagrangian relaxation approach to multi-period inventory/distribution planning. J. Oper. Res. Soc. (2000) 51:364–370Crossref, Google Scholar
• Kleywegt A., Nori V., Savelsbergh M. The stochastic inventory routing problem with direct deliveries. Transportation Sci. (2002) 36(1):94–118Link, Google Scholar
• Lenstra J. K., Rinnooy Kan A. Complexity of vehicle routing and scheduling problems. Networks (1981) 11:221–227Crossref, Google Scholar
• Newman A. M., Yano C. A., Kaminsky P. M., Geunes J., Pardalos P. M. Third party logistics planning with routing and inventory costs. Supply Chain Optimization (2005) (Springer-Verlag, New York) 87–122Crossref, Google Scholar
• Russell R., Gribbin D. A multiphase approach to the period routing problem. Networks (1991) 21:747–765Crossref, Google Scholar
• Russell R., Igo W. An assignment routing problem. Networks (1979) 9:1–17Crossref, Google Scholar
• Tan C., Beasley J. A heuristic algorithm for the period vehicle routing problem. Omega (1984) 12(5):497–504Crossref, Google Scholar