Split-delivery capacitated arc-routing problem: Lower bound and metaheuristic

Transportation Science

Volumn 44, Issue 2, 2010, Pages 206-220

  Belenguer, José Manuel ^a   Benavent, Enrique ^a   Labadi, Nacima ^b   Prins, Christian ^b   Reghioui, Mohamed ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^c Abdelmalek Essaadi University   (Morocco)

Author keywords

Capacitated arc routing problem; CARP; Cutting plane; Evolutionary local search; SDCARP; Split delivery

Indexed keywords

EVOLUTIONARY ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); REFUSE COLLECTION;

CAPACITATED ARC ROUTING PROBLEM; CARP; CUTTING PLANES; LOCAL SEARCH; SDCARP; SPLIT DELIVERY;

NETWORK ROUTING;

EID: 77952524153     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1090.0305     Document Type: Article

References (31)

1. Archetti, C., R. Mansini, M. G. Speranza. 2005. Complexity and reducibility of the skip delivery problem. Transportation Sci. 39(2) 182-187.
2. Archetti, C., M. W. P. Savelsbergh, M. G. Speranza. 2006. Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. 40(2) 226-234.
3. Archetti, C., M. G. Speranza, A. Hertz. 2006. A tabu search algorithm for the split delivery vehicle routing problem. Transportation Sci. 40(1) 64-73.
4. Archetti, C., M. G. Speranza, M. W. P. Savelsbergh. 2008. An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1) 22-31.
5. Baldacci, R., V. Maniezzo. 2006. Exact methods based on noderouting formulations for undirected arc routing problems. Networks 47(1) 52-60.
6. Belenguer, J. M., E. Benavent. 1998. The capacitated arc routing problem: Valid inequalities and facets. Comput. Optim. Appl. 10(2) 165-187.
7. Belenguer, J. M., E. Benavent. 2003. A cutting plane algorithm for the capacitated arc routing problem. Comput. Oper. Res. 30(5) 705-728.
8. Belenguer, J. M., M. C. Martinez, E. Mota. 2000. A lower bound for the split delivery vehicle routing problem. Oper. Res. 48(5) 801-810.
9. Boudia, M., C. Prins, M. Reghioui. 2007. An effective memetic algorithm with population management for the split-delivery vehicle routing problem. T. Bartz-Beielstein, M. J. Blesa-Aguilera, C. Blum, B. Naujoks, A. Roti, G. Rudolph, M. Sampels, eds. Hybrid Metaheuristics, Vol. 4771, Lecture Notes in Computer Science. Springer, Berlin, 16-30.
10. Brandão, J., R. Eglese. 2008. A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 35(4) 1112-1126. (Pubitemid 47558960)
11. Chen, S., B. L. Golden, E. Wasil. 2007. The split delivery vehicle routing problem: Applications, algorithms, test problems and computational results. Networks 49(4) 318-329.
12. Dror, M. 2000. Arc Routing: Theory, Solutions, and Applications. Kluwer Academic Publishers, Boston.
13. Dror, M., P. Trudeau. 1989. Savings by split delivery routing. Transportation Sci. 23(2) 141-145.
14. Dror, M., P. Trudeau. 1990. Split delivery routing. Naval Res. Logist. 37 383-402.
15. Feo, T. A., J. Bard. 1989. Flight scheduling and maintenance base planning. Management Sci. 35(12) 1415-1432.
16. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability. Freeman, San Francisco, 213.
17. Golden, B. L., R. T. Wong. 1981. Capacitated arc routing problems. Networks 11(3) 305-315.
18. Golden, B. L., J. S. DeArmon, E. K. Baker. 1983. Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 10(1) 47-59.
19. Guéguen, C. 1999. Exact solution methods for vehicle routing problems. Unpublished doctoral dissertation, Central School of Paris, Paris.
20. Hertz, A., G. Laporte, M. Mittaz. 2000. A tabu search heuristic for the capacitated arc routing problem. Oper. Res. 48(1) 129-135.
21. Labadi, N., C. Prins, M. Reghioui. 2008a. An evolutionary algorithm with distance measure for the split delivery capacitated arc routing problem. C. Cotta, J. Van Hemert, eds. Recent Advances in Evolutionary Computation for Combinatorial Optimization, Vol.153, Studies in Computational Intelligence. Springer, Berlin, 275-294.
22. Labadi, N., C. Prins, M. Reghioui. 2008b. GRASP with path relinking for the capacitated arc routing problem with time windows. A. Fink, F. Rothlauf, eds. Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management, Vol.144, Studies in Computational Intelligence. Springer, Berlin, 111-135.
23. Lacomme, P., C. Prins, W. Ramdane-Chérif. 2004. Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131 159-185. (Pubitemid 39187378)
24. Longo, H., M. Poggi de Aragão, E. Uchoa. 2006. Solving capacitated arc routing problems using a transformation to the CVRP. Comput. Oper. Res. 33(6) 1823-1837.
25. Lourenço, H. R., O. Martin, T. Stützle. 2002. Iterated local search. F. Glover, G. Kochenberger, eds. Handbook of Metaheuristics. Kluwer, Boston, 321-353.
26. Mladenović, N., P. Hansen. 1997. Variable neighborhood search. Comput. Oper. Res. 24(11) 1097-1100.
27. Mota, E., V. Campos, A. Corberán. 2007. A new metaheuristic for the vehicle routing problem with split demands. C. Cotta, J. Van Hemert, eds. Evolutionary Computation in Combinatorial Optimization, Vol.4446, Lecture Notes in Computer Science. Springer, Berlin, 121-129.
28. Mullaseril, P. A., M. Dror, J. Leung. 1997. Split-delivery routing heuristics in livestock feed distribution. J. Oper. Res. Soc. 48(2) 107-116.
29. Padberg, M. W., M. R. Rao. 1982. Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7(1) 67-80.
30. Sörensen, K., M. Sevaux. 2006. MA|PM: Memetic algorithms with population management. Comput. Oper. Res. 33(5) 1214-1225.
31. Wolf, S., P. Merz. 2007. Evolutionary local search for the super-peer selection problem and the p-hub median problem. T. Bartz- Beielstein, M. J. Blesa-Aguilera, C. Blum, B. Naujoks, A. Roti, G. Rudolph, M. Sampels, eds. Hybrid Metaheuristics, Vol.4771, Lecture Notes in Computer Science. Springer, Berlin, 1-15.