An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

References

• Ahr D. Contributions to multiple postmen problems. (2004) . Ph.D. thesis, University of Heidelberg, Heidelberg, GermanyGoogle Scholar
• Amberg A., Voss S. A hierarchical relaxation lower bound for the capacitated arc routing problem. Proc. 35th Annual Hawaii Internat. Conf. System Sci. (2002) Crossref, Google Scholar
• Assad A. A., Golden B. L., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Arc routing methods and applications. Network Routing, Handbooks in Operations Research and Management Science (1995) (North-Holland, Amsterdam) 375–483Google Scholar
• Baldacci R., Maniezzo V. Exact methods based on node-routing formulations for undirected arc-routing problems. Networks (2006) 47:52–60Crossref, Google Scholar
• Belenguer J. M., Benavent E. The capacitated arc routing problem: Valid inequalities and facets. Computational Optim. Appl. (1998) 10:165–187Crossref, Google Scholar
• Belenguer J. M., Benavent E. A cutting plane algorithm for the capacitated arc routing problem. Comput. Oper. Res. (2003) 30:705–728Crossref, Google Scholar
• Benavent E., Campos V., Corberán A., Mota E. The capacitated arc routing problem: Lower bounds. Networks (1992) 22:669–690Crossref, Google Scholar
• Bertsimas D. J. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40:574–585Link, Google Scholar
• Bertsimas D. J., Jaillet P., Odoni A. R. A priori optimization. Oper. Res. (1990) 38:1019–1033Link, Google Scholar
• Beullens P., Muyldermans L., Cattrysse D., Van Oudheusden D. A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. (2003) 147:629–643Crossref, Google Scholar
• Brandão J., Eglese R. A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. (2008) 35:1112–1126Crossref, Google Scholar
• Doerner K. F., Hartl R. F., Maniezzo V., Reimann M. Applying ant colony optimization to the capacitated arc routing problem. Lecture Notes in Computer Science (2004) 3172(Springer, Berlin) 420–421Google Scholar
• Dror M.Arc Routing Theory, Solutions, and Applications (2000) (Kluwer, Boston) Crossref, Google Scholar
• Dueck G. New optimization heuristics: The great deluge algorithm and the record-to-record travel. J. Computational Phys. (1993) 104:86–92Crossref, Google Scholar
• Eglese R. W., Letchford A., Dror M. Polyhedral theory for arc routing problems. Arc Routing. Theory, Solutions, and Applications (2000) (Kluwer, Boston) 199–230Crossref, Google Scholar
• Eiselt H. A., Gendreau M., Laporte G. Arc routing problems. Part II: The rural postman problem. Oper. Res. (1995) 43:399–414Link, Google Scholar
• Fleury G., Lacomme P., Prins C. Evolutionary algorithms for stochastic arc routing problems. Lecture Notes Comput. Sci. (2004) 3005(Springer, Berlin) 501–512Crossref, Google Scholar
• Fleury G., Lacomme P., Prins C. Stochastic capacitated arc routing problem. (2005a) . Research Report LIMOS/RR-05–12, Université Blaise Pascal, Clermont-Ferrand, FranceGoogle Scholar
• Fleury G., Lacomme P., Prins C., Ramdane-Chérif W. Improving robustness of solutions to arc routing problems. J. Oper. Res. Soc. (2005b) 56:526–538Crossref, Google Scholar
• Gendreau M., Laporte G., Séguin R. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. (1996) 44:469–477Link, Google Scholar
• Ghiani G., Improta G., Laporte G. The capacitated arc routing problem with intermediate facilities. Networks (2001) 37:134–143Crossref, Google Scholar
• Ghiani G., Laganà D., Laporte G., Musmanno R. A branch-and-cut algorithm for the undirected capacitated arc routing problem. (2009) . Working paper, HEC, Montreal, Quebec, CanadaGoogle Scholar
• Golden B. L., Wong R. T. Capacitated arc routing problems. Networks (1981) 11: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:47–59Crossref, Google Scholar
• Gómez-Cabrero D., Belenguer J. M., Benavent E. Cutting plane and column generation for the capacitated arc routing problem. Proc. ORP3 Conf. (2005) Valencia, SpainGoogle Scholar
• Hertz A., Mittaz M. A variable neighbourhood descent algorithm for the undirected capacitated arc routing problem. Transportation Sci. (2001) 35:425–434Link, Google Scholar
• Hertz A., Laporte G., Mittaz M. A tabu search heuristic for the capacitated arc routing problem. Oper. Res. (2000) 48:129–135Link, Google Scholar
• Hirabayashi R., Saruwatari Y., Nishida N. Tour construction algorithm for the capacitated arc routing problems. Asia-Pacific J. Oper. Res. (1992a) 9:155–175Google Scholar
• Hirabayashi R., Saruwatari Y., Nishida N. Node duplication lower bounds for the capacitated arc routing problem. J. Oper. Res. Soc. Japan (1992b) 35:119–133Google 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
• Lenstra J. K., Rinnooy Kan A. G. H. On general routing problems. Networks (1976) 5:273–280Crossref, Google Scholar
• Letchford A. N., Oukil A. Exploiting sparsity in pricing routines for the capacitated arc routing problem. Computers Oper. Res. (2009) 36:2320–2327Crossref, Google Scholar
• Li F., Golden B. L., Wasil E. A. A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. (2007) 34:2734–2742Crossref, 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:1823–1837Crossref, Google Scholar
• Polacek M., Doerner K. F., Hartl R. F., Maniezzo V. A variable neighbourhood search for the capacitated arc routing problem with intermediate facilities. J. Heuristics (2008) 14:405–423Crossref, Google Scholar
• Ropke S., Pisinger D. An adaptive large neighbourhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. (2006) 40:455–472Link, Google Scholar
• Shaw P. A new local search algorithm providing high quality solutions to vehicle routing problems. (1997) . Technical report, Department of Computer Science, University of Strathclyde, Glasgow, ScotlandGoogle Scholar
• Welz S. A. Optimal solutions for the capacitated arc routing problem using integer programming. (1994) . Unpublished doctoral dissertation, Department of Quantitative Analysis and Operations Management, University of Cincinnati, CincinnatiGoogle Scholar
• Wøhlk S. New lower bounds for the capacitated arc routing problem. Comput. Oper. Res. (2006) 33:3458–3472Crossref, Google Scholar
• Wøhlk S., Golden B. L., Raghavan S., Wasil E. A. A decade of capacitated arc routing. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, Boston) 29–48Crossref, Google Scholar