A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

References

• 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)Google Scholar
• Belenguer J. M., Benavent E. A cutting plane algorithm for the capacitated arc routing problem. (1997) (University of Valencia, Spain) . Unpublished manuscriptGoogle Scholar
• Belenguer J. M., Benavent E., Cognata F. A metaheuristic for the capacitated arc routing problem. (1997) (University of Valencia, Spain) . Unpublished manuscriptGoogle Scholar
• Benavent E. (1997) . <http:ftp://indurain.estadi.uv.ed/pub/CARP>Google Scholar
• Christofides N. The optimum traversal of a graph. Omega (1973) 1:719–732Crossref, Google Scholar
• DeArmon J. S. A comparison of heuristics for the capacitated Chinese postman problem. (1981) (University of Maryland at College Park, College Park, MD) . Master's thesisGoogle Scholar
• Dror M.ARC Routing: Theory Solutions and Applications (2000) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Frederickson G. N. Approximation algorithms for some postman problems. J. ACM (1979) 26:538–554Crossref, Google Scholar
• Glover F. Tabu search--Part I. ORSA J. Comput. (1989) 1:190–206Link, Google 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
• Hansen P., Mladenović N., Voss S., Martello S., Osman I. H., Roucairol C. An introduction to VNS. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1998) (Kluwer Academic Publishers, Boston, MA) 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
• Hertz A., Laporte G., Nanchen-Hugo P. Improvement procedure for the undirected rural postman problem. INFORMS J. Comput. (1999) 11:53–62Link, Google Scholar
• Hertz A., Mittaz M., Dror M. Heuristic algorithms. Arc Routing: Theory, Solutions and Applications (2000) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Hirabayashi R., Saruwatari Y., Nishida N. Tour construction algorithm for the capacitated arc routing problem. Asia-Pacific J. Oper. Res. (1992) 9:155–175Google Scholar
• Kirkpatrick S., Gelatt C. D., Vecchi M. Optimization by simulated annealing. Science (1983) 220:671–680Crossref, Google Scholar
• Lenstra J. K., Rinnooy Kan A. H. G. On general routing problems. Networks (1976) 6:273–280Crossref, Google Scholar
• Martello S., Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. (1990) 28:59–70Crossref, Google Scholar
• Mladenović N., Hansen P. Variable neighborhood search. Comput. Oper. Res. (1997) 34:1097–1100Crossref, Google Scholar
• Pearn W.-L. Approximate solutions for the capacitated arc routing problem. Comput. Oper. Res. (1989) 16:589–600Crossref, Google Scholar