Physical distribution activities and vehicle routing problems in logistics management: A case study

Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

Volumn 221, Issue 1, 2007, Pages 123-133

  Guneri A F ^a  

^a YILDIZ TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Logistics system; Transportation; Vehicle routing algorithms; Vehicle routing path (VRP); Vehicle routing problems

Indexed keywords

ALGORITHMS; CASE BASED REASONING; POLYNOMIALS; PROBLEM SOLVING; RESEARCH AND DEVELOPMENT MANAGEMENT; VEHICLE ROUTING;

NON DETERMINISTIC POLYNOMIAL TIME HARD (NP-HARD); VEHICLE ROUTING ALGORITHMS; VEHICLE ROUTING PATH (VRP); VEHICLE ROUTING PROBLEMS;

LOGISTICS;

EID: 34249887907     PISSN: 09544054     EISSN: None     Source Type: Journal    
DOI: 10.1243/09544054JEM560     Document Type: Article

References (46)

1. Swenseth, S. R. and Godfrey, M. R. Incorporating transportation costs into inventory replenishment decisions. Int. J. Prod. Econ., 2002, 77, 113-130.
2. Tseng, Y. Y., Yue, W. L., and Taylor, M. A. P. The role of transportation in logistics chain. Proc. East. Asia Soc. Transpn Stud., 2005, 5, 1657-1672.
3. Machado, P., Tavares, J., Pereiral, F., and Costa, E. Vehicle routing problem: doing it the evolutionary way. In GECCO: Proceedings of the Genetic and evolutionary computation conference 2002, USA, 9-13 July 2002, p. 690.
4. Beck, J. C., Prosser, P., and Selensky, E. On the reformulation of vehicle routing problems and scheduling problems. Technical Report APES-442002, 2002 (APES Research Group).
5. Fisher, M. L. Optimal solution of vehicle routing problems using minimum K-trees. Operations Res., 1994, 42, 626-642.
6. Bompadre, A., Dror, M., and Orlin, J. B. Improved bounds for vehicle routing solutions. Discrete Optimization, 2006, 3, 1-18.
7. Lysgaard, J., Letchford, A. N., and Eglese, R. W. A new branch-and-cut algorithm for capacitated vehicle routing problems. Math Program, 2004, Ser. A100, 423-445.
8. Alba, E. and Dorronsoro, B. Computing nine new bestso-far solutions for capacitated VRP with a cellular genetic algorithm. Inf. Processing Lett., 2005, 98, 225-230.
9. Moghaddam, R. T., Safael, N., and Gholipour, Y. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Appl. Math Comput., 2006, 176, 445-454.
10. Taillard, É. D. Parallel iterative search methods for vehicle routing problems. Networks, 1993, 23, 661-673.
11. Kindervater, G. A. P. and Savelsbergh, M. W. P. Vehicle routing: handling edge exchanges. In Local search in combinatorial optimization (Eds E. H. Aarts and J. K. Lenstra), 1997, pp. 311-336 (Wiley, Chichester).
12. Mukai, N., Feng, J., and Watanabe, T. Heuristic approach based on lambda-interchange for VRTPR-tree on specific vehicle routing problem with time windows. Ind. Engng Applic. Artif. Intell. Expert Syst., 2004, 3029, 224.
13. Renaud, J. and Boctor, F. F. A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Opl Res., 2002, 140, 618-628.
14. Montemanni, R., Barta, J., and Gambardella, L. M. Heuristic and preprocessing techniques for the robust traveling salesman problem with interval data. Technical Report IDSIA-01-06, 2006 (Istituto Dalle Molle di Studi Sull'Intelligenza Arlificiale).
15. Gronalt, M., Hartl, R. F., and Reimann, M. New savings based algorithms for time constrained pickup and delivery of full truckloads. Eur. J. Opl Res., 2003, 151, 520-535.
16. Rochat, Y. and Taillard, É. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics, 1995, 1, 147-167.
17. Xu, J. and Kelly, J. A network flow-based tabu search heuristic for the vehicle routing problem. Transpn Sci., 1996, 30, 379-393.
18. Taillard, É. D., Badeau, P., Gendreau, M., Guertin, F., and Potvln, J.-Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transpn Sci., 1997, 31, 170-186.
19. Archetti, C. and Speranza, M. G. A tabu search algorithm for the split delivery vehicle routing problem. Transpn Sci., 2006, 40, 64-73.
20. Alfredo, F., Montane, T., and Galvao, R. D. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput. Ops Res., 2006, 33, 595-619.
21. Toth, P. and Vigo, D. The granular tabu search (and its application to the vehicle routing problem). Technical Report, 1998 (Dipartimento di Elettronica, Informatica e Sistemistica, Università di Bologna, Italy).
22. Shaw, P. Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of the Fourth International Conference on Principles and practice of constraint programming (CP '98) (Eds M. Maher and J.-F. Puget) 1998, pp. 417-431, (Springer-Verlag).
23. Rousseau, M., Gendreau, M., Pesant, G., and Focacci, F. Solving VRPTWs with constraint programming based column generation. Ann. Operation Res., 2004, 130, 199-216.
24. Gambardella, L. M., Taillard, E., and Agazzi, G. MACSVRPTW: A multiple ant colony system for vehicle routing problems with time windows. In New ideas in optimization (Eds D. Corne, M. Dorigo and F. Glover), 1999, pp. 63-76. (McGraw-Hill, London).
25. Mazzeo, S. and Loiseau, I. An ant colony algorithm for the capacitated vehicle routing. Electronic Notes in Discrete Math., 2004, 18, 181-186.
26. Reimann, M., Doerner, K., and Hartl, R. F. D-ants: savings based ants divide and conquer the vehicle routing problem. Comput. Ops Res., 2004, 31, 563-59.
27. Laporte, G. and Palekar, U. Some applications of the clustered traveling salesman problem. J. Opl Res. Soc., 2002, 53, 972-976.
28. Laporte, G., Asef-Vaziri, A., and Sriskandarajah, C. Some applications of the generalized traveling salesman problem. J. Opl Res. Soc., 1996, 47, 1461-1467.
29. Blais, M. and Laporte, G. Exact solution of the generalized routing problem through graph transformation. J. Opl Res. Soc., 2003, 54, 906-910.
30. Oppen, J. and Lokketangen, A. Arc routing in a node routing environment. Comput. Ops Res., 2006, 33, 1033-1055.
31. Thangiah, S. R. Vehicle routing with time windows using genetic algorithms. In Application and book of genetic algorithms: new frontiers (Ed. L. Chambers), 1995, Vol. 2, pp. 253-277 (CRC Press, Boca Raton).
32. Zhu, K. A new genetic algorithm for VRPTW. In Proceedings of International Conference on Artificial intelligence, 2000, Las Vegas, USA.
33. Louis, S., Yin, X., and Yuan, Z. Multiple vehicle routing with time windows using genetic algorithms. In Proceedings of the Congress on Evolutionary computation, 1999, pp. 1804-1808.
34. Holmberg, K. and Yuan, D. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Ops Res., 2000, 48(3), 461-481.
35. Cordeau, J.-F., Soumis, F., and Desrosiers, J. A Benders decomposition approach for the locomotive and car assignment problem. Transpn Sci., 2000, 34(2), 133-149.
36. Yano, C. and Newman, A. M. Scheduling trains and containers with due dates and dynamic arrivals. Transpn Sci., 2001, 35(2), 181-191.
37. Ballou, R. Business logistics management, planning, organizing and controlling the supply chain, 4th Edition, 1999 (Prentice Hall, Englewood Cliffs, New Jersey).
38. Coutinho-Rodrigues, J. M., Climaco, J. C. N., and Current, J. R. An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput. Ops Res., 1999, 26, 789-798.
39. Pisinger, D. and Ropke, S. A general heuristic for vehicle routing problems. Technical Report, Department of Computer Science, University of Copenhagen, 2005.
40. Bektas, T. The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega, 2006, 34, 209-219.
41. Glynn, P. and Robinson, S. Springer series in operations research, 1997 (Springer, New York).
42. Gillett, B. E. and Miller, L. R. A heuristic algorithm for the vehicle dispatch problem. Ops Res., 1974, 22, 240-349.
43. Laportea, G., Gendreau, M., Potvin, J. Y., and Semet, F. Classical and modern heuristics for the vehicle routing problem. Int. Trans. Opl Res., 2000, 7, 285-300.
44. Desrochers, M. and Verhoog, T. W. A matching based savings algorithm for the vehicle routing problem. In Les Cahiers du GERAD G-89-04, 1989 (École des Hautes Études Commerciales de Montréal).
45. Altinkemer, K. and Gavish, B. Parallel savings based heuristic for the delivery problem. Ops Res., 1991, 39, 456-469.
46. Wark, P. and Holt, J. A repeated matching heuristic for the vehicle routing problem. J. Opl Res. Soc., 1994, 45, 1156-1167.