The close-open mixed vehicle routing problem

European Journal of Operational Research

Volumn 220, Issue 2, 2012, Pages 349-360

  Liu, Ran ^a   Jiang, Zhibin ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Close and open; Memetic algorithm; Metaheuristics; Vehicle routing

Indexed keywords

INTEGER PROGRAMMING; VEHICLES;

CLOSE AND OPENS; COMPUTATIONAL EXPERIMENT; MEMETIC ALGORITHMS; META HEURISTICS; MIX-INTEGER PROGRAMMING; RUNNING TIME; VARIABLE COSTS; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 84859787370     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.01.061     Document Type: Article

References (70)

1. Achuthan, N. R., Caccetta, L., Hill, S. P., 2003. An improved branch-and-cut algorithm for the capacitated vehicle routing problem. Transportation Science 37, 153.
2. Albareda-Sambola, M., Fernández, E., Laporte, G., 2009. The capacity and distance constrained plant location problem. Computers and Operations Research 36, 597-611.
3. Augerat, P., Belenger, J., Benavent, E., Corberan, A., Naddef, D., Rinaldi, G., 1995. Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Technical Report: RR 949-M.
4. Azi, N., Gendreau, M., Potvin, J.-Y., 2010. An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research 202, 756-763.
5. Baldacci, R., Christofides, N., Mingozzi, A., 2008. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming 115, 351-385.
6. Bodin, L., 1990. Twenty years of routing and scheduling. Operations Research 38, 571-579.
7. Bolduc, M., Renaud, J., Boctor, F., 2007. A heuristic for the routing and carrier selection problem. European Journal of Operational Research 183, 926-932. (Pubitemid 46891135)
8. Bolduc, M. C., Renaud, J., Boctor, F., Laporte, G., 2008. A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. Journal of the Operational Research Society 59, 776-787. (Pubitemid 351641210)
9. Brandão, J., 2004. A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research 157, 552-564.
10. Braysy, O., Gendreau, M., 2005a. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Science 39, 104-118. (Pubitemid 40466664)
11. Braysy, O., Gendreau, M., 2005b. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science 39, 119-139. (Pubitemid 40453880)
12. Campos, V., Laguna, M., Marti, R., 2005. Context-independent scatter and tabu search for permutation problems. Informs Journal on Computing 17, 111-122. (Pubitemid 40308574)
13. Côté, J.-F., Potvin, J.-Y., 2009. A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research 198, 464-469.
14. Chu, C. W., 2005. A heuristic algorithm for the truckload and less-than-truckload problem. European Journal of Operational Research 165, 657-667.
15. Clarke, G., Wright, J. W., 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568-581.
16. Cordeau, J., Gendreau, M., Laporte, G., 1997. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105-119. (Pubitemid 127360996)
17. Cordeau, J., Gendreau, M., Laporte, G., Potvin, J., Semet, F., 2002. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53, 512-522. (Pubitemid 34550664)
18. Cordeau, J. F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J. S., 2005. New heuristics for the vehicle routing problem. Logistics Systems: Design and Optimization, 279-297.
19. Cordeau, J. F., Laporte, G., Savelsbergh, M. W. P., Vigo, D., 2007. Vehicle routing. Transportation 14, 367-428.
20. Crevier, B., Cordeau, J. F., Laporte, G., 2007. The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research 176, 756-773. (Pubitemid 44537609)
21. Dantzig, G. B., Ramser, J. H., 1959. The truck dispatching problem. Management Science 6, 80-91.
22. Derigs, U., Kaiser, R., 2007. Applying the attribute based hill climber heuristic to the vehicle routing problem. European Journal of Operational Research 177, 719-732.
23. Desrochers, M., Laporte, G., 1991. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 10, 27-36.
24. Desrosiers, J., Pelletier, P., Soumis, F., 1983. Plus court chemin avec contraintes d'horaires. RAIRO. Recherche opérationnelle 17, 357-377 (in French).
25. Ergun, Orlin, J. B., Steele-Feldman, A., 2006. Creating very large scale neighborhoods out of smaller ones by compounding moves. Journal of Heuristics 12, 115-140. (Pubitemid 43234618)
26. Falkenauer, E., Bouffouix, S., 1991. In: A Genetic Algorithm for Job Shop. (vol. 821), IEEE, pp. 824-829.
27. Fisher, M. L., Jaikumar, R., 1981. A generalized assignment heuristic for vehicle routing. Networks 11, 109-124. (Pubitemid 13506979)
28. Fleszar, K., Osman, I. H., Hindi, K. S., 2009. A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research 195, 803-809.
29. Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P., Reis, M., Uchoa, E., Werneck, R. F., 2006. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106, 491-511.
30. Gendreau, M., Hertz, A., Laporte, G., 1994. A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276-1290.
31. Goldberg, D. E., Robert Lingle, J., 1985. Alleles lociand the traveling salesman problem. In Proceedings of the 1st International Conference on Genetic Algorithms, L. Erlbaum Associates Inc, pp. 154-159.
32. Golden, B., Assad, A., Levy, L., Gheysens, F., 1984. The fleet size and mix vehicle routing problem. Computers and Operations Research 11, 49-66. (Pubitemid 14486847)
33. Hertz, A., Widmer, M., 2003. Guidelines for the use of meta-heuristics in combinatorial optimization. European Journal of Operational Research 151, 247-252.
34. Holland, J., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press.
35. Homberger, J., Gehring, H., 2005. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162, 220-238.
36. Irnich, S., Funke, B., Grünert, T., 2006. Sequential search and its application to vehicle-routing problems. Computers and Operations Research 33, 2405-2429. (Pubitemid 41802296)
37. Kara, I., Laporte, G., Bektas, T., 2004. A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. European Journal of Operational Research 158, 793-795.
38. Kek, A., Cheu, R., Meng, Q., 2008. Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots. Mathematical and Computer Modelling 47, 140-152. (Pubitemid 47615411)
39. Laporte, G., 1992. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 59, 345-358.
40. Laporte, G., 2009. Fifty years of vehicle routing. Transportation Science 43, 408-416.
41. Laporte, G., Desrochers, M., Nobert, Y., 1984. Two exact algorithms for the distanceconstrained vehicle routing problem. Networks 14 (161̈ C172).
42. Laporte, G., Nobert, Y., Desrochers, M., 1985. Optimal routing under capacity and distance restrictions. Operations Research 33, 1050-1073. (Pubitemid 15589837)
43. Laporte, G., Semet, F., 2002. Classical heuristics for the capacitated VRP. The Vehicle Routing Problem, 109-128.
44. Letchford, A., Lysgaard, J., Eglese, R., 2006. A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society 58, 1642-1651.
45. Letchford, A. N., Salazar-González, J. J., 2006. Projection results for vehicle routing. Mathematical Programming 105, 251-274. (Pubitemid 41788320)
46. Li, C., Simchi-Levi, D., Desrochers, M., 1992. On the distance constrained vehicle routing problem. Operations Research 40, 790-799.
47. Li, F., Golden, B., Wasil, E., 2007. The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Computers and Operations Research 34, 2918-2930. (Pubitemid 46356729)
48. Li, X. Y., Tian, P., Leung, S. C. H., 2009. An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems. Journal of the Operational Research Society 60, 1012-1025.
49. Liu, R., Jiang, Z., Liu, X., Chen, F., 2010. Task selection and routing problems in collaborative truckload transportation. Transportation Research Part E: Logistics and Transportation Review 46, 1071-1085.
50. Liu, S., Huang, W., Ma, H., 2009. An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transportation Research Part E: Logistics and Transportation Review 45, 434-445.
51. Lysgaard, J., Letchford, A., Eglese, R., 2004. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100, 423-445. (Pubitemid 40878095)
52. Mester, D., Bräysy, O., 2005. Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers and Operations Research 32, 1593-1614.
53. Mester, D., Braysy, O., 2007. Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers and Operations Research 34, 2964-2975. (Pubitemid 46356733)
54. Nagata, Y., 2007. Edge assembly crossover for the capacitated vehicle routing problem. Evolutionary Computation in Combinatorial Optimization, 142-153.
55. Oliver, I., Smith, D., Holland, J., 1987. A study of permutation crossover operators on the traveling salesman problem. In: L. Erlbaum Associates Inc., Hillsdale, NJ, USA, pp. 224-230.
56. Pisinger, D., Ropke, S., 2007. A general heuristic for vehicle routing problems. Computers and Operations Research 34, 2403-2435. (Pubitemid 46073431)
57. Prins, C., 2004. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31, 1985-2002. (Pubitemid 38728564)
58. Reimann, M., Doerner, K., Hartl, R. F., 2004. D-ants: aavings based ants divide and conquer the vehicle routing problem. Computers and Operations Research 31, 563-591. (Pubitemid 38098444)
59. Repoussis, P. P., Paraskevopoulos, D. C., Zobolas, G., Tarantilis, C. D., Ioannou, G., 2009. A web-based decision support system for waste lube oils collection and recycling. European Journal of Operational Research 195, 676-700.
60. Repoussis, P. P., Tarantilis, C. D., Bräysy, O., Ioannou, G., 2010. A hybrid evolution strategy for the open vehicle routing problem. Computers and Operations Research 37, 443-455.
61. Russell, R., Chiang, W.-C., Zepeda, D., 2008. Integrating multi-product production and distribution in newspaper logistics. Computers and Operations Research 35, 1576-1588. (Pubitemid 47488630)
62. Salari, M., Toth, P., Tramontani, A., 2010. An ILP improvement procedure for the open vehicle routing problem. Computers and Operations Research 37, 2106-2120.
63. Salhi, S., Sari, M., 1997. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research 103, 95-112. (Pubitemid 127396732)
64. Sariklis, D., Powell, S., 2000. A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society 51, 564-573.
65. Solomon, M. M., 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35, 254-265.
66. Sörensen, K., Sevaux, M., 2006. MA|PM: Memetic algorithms with population management. Computers and Operations Research 33, 1214-1225. (Pubitemid 41428287)
67. Taillard, É., 1993. Parallel iterative search methods for vehicle routing problems. Networks 23, 661-673.
68. Tarantilis, C. D., Ioannou, G., Kiranoudis, C. T., Prastacos, G. P., 2005. Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society 56, 588-596. (Pubitemid 40567544)
69. Toth, P., Vigo, D., 2002. Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics 123, 487-512.
70. Zachariadis, E. E., Kiranoudis, C. T., 2010. An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Computers and Operations Research 37, 712-723.