Scheduling Periodical Deliveries from a Distribution Centre to Minimize the Fleet Size

• Achuthan, N. R., Caccetta, L., & Hill, S. P. (1998). Capacitated vehicle routing problem; some new cutting planes. Asian-Pacific Journal of Operational Research, 15, 109–123.

  Google Scholar 

• Alegre, J., Laguna, M., & Pacheco, J. (2007). Optimizing the periodic pick-up of raw materials for a manufacture of auto part. European Journal of Operational Research, 179, 736–746.

  Article  Google Scholar 

• Alonso, F., Alvarez, M. J., & Beasley, J. E. (2008). A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of the Operational Research Society, 59, 963–976.

  Article  Google Scholar 

• Archetti, C., Fernández, E., & Huerta-Muñoz, D. L. (2017). The flexible periodic vehicle routing problem. Computers and Operations Research, 85, 58–70.

  Article  Google Scholar 

• Ball, M. (1988). Allocating/routing: models and algorithms. In B. L. Golden & A. A. Assad (Eds.), Vehicle routing: Methods and studies. Amsterdam: North-Holland.

  Google Scholar 

• Banerea-Brodeur, M., Cordeaul, J.-F., Laporte, G., & Lasry, A. (1998). Scheduling linen deliveries in a large hospital. Journal of the Operational Research Society, 49, 777–780.

  Article  Google Scholar 

• Bell, W. J., Dalberto, L. M., Fisher, M. L., Greenfield, A. J., Jaikumar, R., Kedia, P., Mack, R. G., & Prutzman, P. J. (1983). Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces, 13, 4–23.

  Article  Google Scholar 

• Beltrami, E. J., & Bodin, L. D. (1974). Networks and vehicle routing for municipal waste collection. Networks, 4, 65–94.

  Article  Google Scholar 

• Bommisetty, D., Dessouky, M., & Jacobs, L. (1998). Scheduling collection of recyclable material at Northern Illinois University Campus using a two-phase algorithm. Computers and Industrial Engineering, 35, 435–438.

  Article  Google Scholar 

• Cacchiani, V., Hemmelmayr, V. C., & Tricoire, F. (2014). A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Applied Mathematics, 163, 53–64.

  Article  Google Scholar 

• Chao, I. M., Golden, B. L., & Wasil, E. (1995). An improved heuristic for the period vehicle routing problem. Networks, 26, 25–44.

  Article  Google Scholar 

• Christofides, N., & Beasley, J. E. (1984). The period routing problem. Networks, 14, 237–256.

  Article  Google Scholar 

• Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle dispatching problem. Operational Research Quarterly, 20, 309–318.

  Article  Google Scholar 

• Coene, S., Arnout, A., & Spieksma, F. C. R. (2010). On a periodic vehicle routing problem. Journal of the Operational Research Society, 61, 1719–1728.

  Article  Google Scholar 

• Cordeau, J. F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105–119.

  Article  Google Scholar 

• Dror, M., & Ball, M. (1987). Inventory/routing: Reduction from an annual to a short-period problem. Naval Research Logistics, 34, 891–905.

  Article  Google Scholar 

• Drummond, L. M. A., Ochi, L. S., & Vianna, D. S. (2001). An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Generation Computer Systems, 17, 379–386.

  Article  Google Scholar 

• Eilon, S., Watson-Dandy, C. D. T., & Christofides, N. (1971). Distribution management: Mathematical modelling and practical analysis. London: Griffin.

  Google Scholar 

• Francis, P., Smilowitz, K., & Tzur, M. (2007). Flexibility and complexity in periodic distribution problems. Naval Research Logistics, 54, 136–150.

  Article  Google Scholar 

• Gaudioso, M., & Paletta, G. (1992). A heuristic for the periodic vehicle routing problem. Transportation Science, 26, 86–92.

  Article  Google Scholar 

• Golden, B. L., & Wasil, E. A. (1987). Computerized vehicle routing in the soft drink industry. Operations Research, 35, 6–17.

  Article  Google Scholar 

• Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., & Vitry, G. (2014). Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Computers & Operations Research, 41, 196–207.

  Article  Google Scholar 

• Nguyen, P. K., Crainic, T. G., & Toulouse, M. (2014). A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. Journal of Heuristics, 20, 383–416.

  Article  Google Scholar 

• Rahimi-Vahed, A., Crainic, T. G., Gendreau, M., & Rei, W. (2013). A path relinking algorithm for a multi-depot periodic vehicle routing problem. Journal of Heuristics, 19, 497–524.

  Article  Google Scholar 

• Rahimi-Vahed, A., Crainic, T. G., Gendreau, M., & Rei, W. (2015). Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Computers & Operations Research, 53, 9–23.

  Article  Google Scholar 

• Russell, R. A., & Gribbin, D. (1991). A multiphase approach to the period routing problem. Networks, 21, 747–765.

  Article  Google Scholar 

• Shih, L. H., & Chang, H. C. (2001). A routing and scheduling system for infectious waste collection. Environmental Modeling & Assessment, 6, 261–269.

  Article  Google Scholar 

• Shih, L. H., & Lin, Y. T. (1999). Optimal routing for infectious waste collection. Journal of Environmental Engineering-ASCE, 125, 479–484.

  Article  Google Scholar 

• Tan, C. C. R., & Beasley, J. E. (1984). A heuristic algorithm for the period vehicle routing problem. OMEGA, 12, 497–504.

  Article  Google Scholar 

• Vanderbeck, F. (1999). Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming, 86, 565–594.

  Article  Google Scholar 

Download references