Solving a vehicle-routing problem arising in soft-drink distribution

Journal of the Operational Research Society

Volumn 57, Issue 9, 2006, Pages 1045-1052

  Prive J ^a   Renaud, J ^a   Boctor, F ^a   Laporte, G ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Heterogeneous vehicle routing problem; Heuristics; Reverse logistics; Soft drink distribution; Time windows

Indexed keywords

BEVERAGES; CONSTRAINT THEORY; COSTS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; TRACKING (POSITION);

HETEROGENEOUS VEHICLE ROUTING PROBLEM; REVERSE LOGISTICS; SOFT-DRINK DISTRIBUTION; TIME WINDOWS;

ROUTERS;

EID: 33747200888     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602087     Document Type: Article

References (15)

1. Carter MW, Favolden JM, Laporte G and Xu J (1996). Solving an integrated logistic problem arising in grocery distribution. INFOR 34: 290-306.
2. Cordeau J-F et al (2002). Vehicle routing problem with time windows. In: Toth P and Vigo D (eds). The Vehicle Routing Problem 2002. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 157-193.
3. Cordeau J-F, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30: 105-119.
4. Desrochers M and Laporte G (1991). Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Opns Res Lett 10: 27-36.
5. Golden BL, Assad AA and Wasil EA (2002). Routing vehicles in the real world: Applications in the solid waste, beverage, food, dairy, and newspaper industries. In: Toth P and Vigo D (eds). The Vehicle Routing Problem 2002. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 245-286.
6. Golden BL and Wasil EA (1987). Computerized vehicle routing in the soft drink industry. Opns Res 35: 6-17.
7. Laporte G and Semet F (2002). Classical heuristics for the capacitated vehicle routing problem. In: Toth P and Vigo D (eds). The Vehicle Routing Problem 2002. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 109-128.
8. Lin S (1965). Computer solutions of the traveling salesman problem. The Bell System Technical J 44: 2245-2269.
9. Miller CE, Tucker AW and Zemlin RA (1960). Integer programming formulations and traveling salesman problems. J Assoc Comput Mach 7: 326-329.
10. Osman IH (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals Opns Res 41: 421-451.
11. Renaud J, Boctor FF and Laporte G (1996). An improved petal heuristic for the vehicle routing problem. J Opl Res Soc 47: 329-336.
12. Ryan DM, Hjorring C and Glover F (1993). Extensions of the petal method for vehicle routing. J Opl Res Soc 44: 289-296.
13. Tarantilis CD and Kiranoudis CT (2001). A meta-heuristic algorithm for the efficient distribution of perishable foods. J Food Eng 50: 1-9.
14. Tarantilis CD, Kiranoudis CT and Vassiliadis VS (2004). A threshold accepting metaheuristic for the heterogeneous fixed vehicle routing problem. Eur J Opl Res 152: 148-158.
15. Toth P and Vigo D (2002). Vehicle routing problem with backhauls. In: Toth P and Vigo D (eds). The Vehicle Routing Problem 2002. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 195-224.