Optimal management of logistic activities in multi-site environments

Computers and Chemical Engineering

Volumn 32, Issue 11, 2008, Pages 2547-2569

  Dondo, Rodolfo ^a   Méndez, Carlos A ^a   Cerdá, Jaime ^a  

^a UNIVERSIDAD NACIONAL DEL LITORAL   (Argentina)

Author keywords

Logistics; Multiple vehicles; Optimization; Pickup and delivery problem

Indexed keywords

LOGISTICS; MULTIPLE VEHICLES; OPTIMIZATION; PICK UP AND DELIVERY; PICKUP AND DELIVERY PROBLEM;

SOLUTIONS;

EID: 50549085577     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2007.10.002     Document Type: Article

References (35)

1. Altinel I., and Öncan T. A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. Journal of the Operational Research Society 56 (2005) 954-961
2. Bent R., and Van Hentenryck P. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers and Operations Research 33 4 (2006) 875-893
3. Bodin L., Golden B., Assad A., and Ball M. Routing and scheduling of vehicles and crews: The state of the art. Computers & Operations Research 10 2 (1983) 62-212
4. Cordeau J.F. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 54 (2006) 573-586
5. Cyrus, J. (1988). The vehicle scheduling problem: Models, complexity and algorithms. Ph.D. Thesis. Technical University of Nova Scotia, Department of Engineering, Halifax, NS.
6. Desaulniers G., Desrosiers J., Erdmann A., Solomon M., and Soumis F. VRP with pickup and delivery. In: Toth P., and Vigo D. (Eds). The vehicle routing problem, SIAM monographs on discrete mathematics and applications Vol. 9 (2002), SIAM, Philadelphia 225-242
7. Desrochers M., Desrosiers J., and Solomon M. A new optimization algorithm for vehicle routing problem with time windows. Operations Research 40 (1992) 342-354
8. Desrosiers J., Dumas Y., Solomon M., and Soumis F. Time constrained routing and scheduling. In: Ball M., et al. (Ed). Handbook in OR & MS Vol. 8 (1995), Elsevier Science 35-139
9. Dondo R., Méndez C.A., and Cerdá J. An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints. Latin American Applied Research 33 2 (2003) 129-134
10. Dumas, Y., Desrosiers, J. & Soumis, F. (1989). Large scale multi-vehicle dial-a-ride systems. (Montreal Report G-89-30) Ecole des Hautes Commerciales.
11. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 (1991) 7-22
12. Fisher M. Vehicle routing. In: Ball M., et al. (Ed). Handbook in OR & MS Vol. 8 (1995), Elsevier Science 1-33
13. Gillet B., and Miller L. A heuristic algorithm for the vehicle dispatch problem. Operations Research 22 (1974) 340-349
14. Ioannou G., Kritikos M., and Prastacos G. A greedy look-ahead heuristic for the vehicle routing problem with time windows. Journal of the Operational Research Society 52 (2001) 523-537
15. Jaw J., Odon A., Psaraftis H., and Wilson N. A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transportation Research 20b (1986) 243-257
16. Langevin A.M., Desrochers M., Desrosiers J., Gelinas S., and Soumis F. A two-commodity flow formulation for the traveling salesman and makespan problems with time windows. Networks 23 (1993) 631-640
17. Li H., and Lim A. A meta-heuristic for the pickup and delivery problem with time windows. Journal on Artificial Intelligent Tools 12 2 (2003) 173-186
18. Li H., and Lim A. Local search with annealing-like restarts to solve the VRPTW. European Journal of Operational Research 150 1 (2003) 115-127
19. Lu Q., and Dessouky M.M. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science 38 (2004) 503-514
20. Lu Q., and Dessouky M.M. A new insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows. European Journal of Operational Research 175 (2006) 672-687
21. Méndez C.A., Bonfill A., Espuña A., and Puigjaner L. A rigorous approach to coordinate production and transport scheduling in a multi-site system. Computer-Aided Chemical Engineering 21B (2006) 2171-2176 ISBN:0-444-52970-5
22. Mitrovic-Minic, S. (1998). Pickup and delivery problem with time windows: A survey. (Technical Report 1998-12). Canada Research Chair in Distribution Management. CMPT.
23. Nanry W.P., and Wesley Barnes J. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B 34 (2000) 107-121
24. Potvin J., and Rousseau J. An exchange heuristic for routing problems with time windows. Journal of Operational Research Society 46 (1995) 1433-1446
25. Potvin J., Shen Y., and Rousseau J. Neural networks for automated vehicle dispatching. Computers & Operations Research 19 3-4 (1992) 267-276
26. Ropke S., and Pisinger D. An adaptive large neighbourhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40 (2006) 455-472
27. Savelsbergh M., and Sol M. The general pick-up and delivery problem. Transportation Science 29 1 (1995) 17-29
28. Savelsbergh M., and Sol M. Drive: Dynamic routing of independent vehicles. Operations Research 46 4 (1998) 474-490
29. Solomon M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research 32 (1987) 254-265
30. Taillard E.D., Badeau P., Gendreau M., Guertin F., and Potvin J.Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186
31. Tam V., and Kwan M.C. Adapting the large neighborhood search to effectively solve pickup and delivery problems with time windows. 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004) (2004) 519-523
32. Tang Montané F., and Diéguez Galvao R. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers and Operations Research 33 3 (2006) 595-619
33. Thompson P., and Psaraftis H. Cyclic transfer algorithms for multivehicle routing and scheduling problems with backhauls. European Journal of Operational Research 113 (1993) 528-543
34. Toth P., and Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31 (1997) 60-71
35. Van der Bruggen L., Lenstra J., and Schuur P. Variable depth search for the single-vehicle pick-up and delivery problem with time windows. Transportation Science 27 (1993) 298-311