On a periodic vehicle routing problem

Journal of the Operational Research Society

Volumn 61, Issue 12, 2010, Pages 1719-1728

  Coene, S ^a   Arnout, A ^a   Spieksma, F C R ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

integer programming; logistics; periodic routing

Indexed keywords

COST REDUCTION; INTEGER PROGRAMMING; LOGISTICS; SALES; VEHICLES;

CAPACITATED VEHICLES; CURRENT SITUATION; FREQUENCY CONSTRAINT; PERIODIC ROUTING; PERIODIC VEHICLE ROUTING PROBLEM; PLANNING HORIZONS; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 78049319865     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.154     Document Type: Article

References (20)

1. Alegre J, Laguna M and Pacheco J (2007). Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Eur J Opl Res 179:736-746.
2. Alonso F, Alvarez MJ and Beasley JE (2008). A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J Opl Res Soc 59:963-976.
3. Angelelli E and Speranza MG (2002). The periodic vehicle routing problem with intermediate facilities. Eur J Opl Res 137:233-247.
4. Arnout A (2007). Het periodieke routeplanningsprobleem: een case studie. Master Thesis, Katholieke Universiteit Leuven, Belgium.
5. Baptiste S, Oliviera RC and Zúquete E (2002). A period vehicle routing case study. Eur J Opl Res 139:220-229.
6. Beltrami EJ and Bodin LD (1974). Networks and vehicle routing for municipal waste collection. Networks 4:65-94.
7. Blakeley F, Argüello B, Cao B, Hall W and Knolmajer J (2003). Optimizing periodic maintenance operations for Schindler Elevator Corporation. Interfaces 33(1):67-79.
8. Christofides N and Beasley JE (1984). The period routing problem. Networks 14:237-256.
9. Claassen G D H and Hendriks T H B (2007). An application of special ordered sets to a periodic milk collection problem. Eur J Opl Res 180:754-769.
10. de Hoon M, Imoto S and Miyano S (2008). The C Clustering Library. The University of Tokyo, Institute of Medical Science, Human Genome Center: Tokyo.
11. Eglese RW and Murdock H (1991). Routing road sweepers in a rural area. J Opl Res Soc 42:169-194.
12. Francis P, Smilowitz K and Tzur M (2006). The period vehicle routing problem with service choice. Transport Sci 40:439-454.
13. Francis P, Smilowitz K and Tzur M (2008). The period vehicle routing problem and its extensions. In: Golden B, Raghavan S and Wasil E (eds). The Vehicle Routing Problem. Springer: US, pp 239-261.
14. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman: San Francisco.
15. Hemmelmayr V, Doerner KF, Hartl RF and Savelsbergh M W P (2008). Delivery strategies for blood products supplies. OR Spectrum 31:707-725.
16. ILOG (2005). ILOG Dispatcher 4.1, User's manual.
17. Kim B, Kim S and Sahoo S (2006). Waste collection vehicle routing problem with time windows. Comput Opns Res 33:3624-3642.
18. Mourgaya M and Vanderbeck F (2006). Problème de tournées de véhicules multipériodiques: Classification et heuristique pour la planification tactique. RAIRO Opns Res 40:169-194.
19. Ronen D and Goodhart CA (2008). Tactical store delivery planning. J Opl Res Soc 59:1047-1054.
20. Tan C C R and Beasley JE (1984). A heuristic algorithm for the period vehicle routing problem. Omega 12:497-504.