Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

References

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