Skip to main content
SpringerLink
Log in

Competitive Memetic Algorithms for Arc Routing Problems

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The Capacitated Arc Routing Problem or CARP arises in applications like waste collection or winter gritting. Metaheuristics are tools of choice for solving large instances of this NP-hard problem. The paper presents basic components that can be combined into powerful memetic algorithms (MAs) for solving an extended version of the CARP (ECARP). The best resulting MA outperforms all known heuristics on three sets of benchmark files containing in total 81 instances with up to 140 nodes and 190 edges. In particular, one open instance is broken by reaching a tight lower bound designed by Belenguer and Benavent, 26 best-known solutions are improved, and all other best-known solutions are retrieved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Amberg, A., W. Domschke, and S. Voß. (2000). “Multiple Center Capacitated Arc Routing Problems: A Tabu Search Algorithm Using Capacitated Trees.” European Journal of Operational Research 124, 360-376.

    Article  Google Scholar 

  • Amberg, A. and S. Voß. (2002). “A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem.” In R.H. Sprague (Hrsg.), Proceedings of the 35th Annual Hawaii International Conference on System Sciences, DTIST02. Piscataway: IEEE, pp. 1-10.

    Google Scholar 

  • Barr, R.S., B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stewart Jr. (1995). “Designing and Reporting on Computational Experiments with Heuristic Methods.” Journal of Heuristics 1, 9-32.

    Google Scholar 

  • Belenguer, J.M., E. Benavent, and F. Cognata. (1997). “Un Metaheuristico Para el Problema de Rutas por Arcos con Capacidades.” In 23th National SEIO Meeting, Valencia, Spain.

    Google Scholar 

  • Belenguer, J.M. and E. Benavent. (2003). “A Cutting Plane Algorithm for the Capacitated Arc Routing Problem.” Computers and Operations Research 30(5), 705-728.

    Article  Google Scholar 

  • Belenguer, J.M. and E. Benavent. (1998). “The Capacitated Arc Routing Problem: Valid Inequalities and Facets.” Computational Optimization and Applications 10, 165-187.

    Article  Google Scholar 

  • Benavent, E., V. Campos, and A. Corberán. (1992). “The Capacitated Arc Routing Problem: Lower Bounds.” Networks 22, 669-690.

    Google Scholar 

  • Benavent, E. and D. Soler. (1999). “The Directed Rural Postman Problem with Turn Penalties.” Transportation Science 33(4), 408-418.

    Google Scholar 

  • Beullens, P., L. Muyldermans, D. Cattrysse, and D. Van Oudheusden. (2003). “A Guided Local Search Heuristic for the Capacitated Arc Routing Problem.” European Journal of Operational Research 147(3), 629-643.

    Article  Google Scholar 

  • Cheung, B.K.S., A. Langevin, and B. Villeneuve. (2001). “High Performing Evolutionary Techniques for Solving Complex Location Problems in Industrial System Design.” Journal of Intelligent Manufacturing 12(5-6), 455-466.

    Google Scholar 

  • Corberán, A., R. Martí, and A. Romero. (2000). “Heuristics for the Mixed Rural Postman Problem.” Computers and Operations Research 27, 183-203.

    Article  Google Scholar 

  • Cormen, T.H., C.L. Leiserson, and M.L. Rivest. (1990). Introduction to Algorithms. MIT Press.

  • DeArmon, J.S. (1981). “A Comparison of Heuristics for the Capacitated Chinese Postman Problem.” Master’s Thesis, The University of Maryland at College Park, MD, USA.

    Google Scholar 

  • Eglese, R.W. (1994). “Routing Winter Gritting Vehicles.” Discrete Applied Mathematics 48(3), 231-244.

    Article  Google Scholar 

  • Eglese, R.W. and L.Y.O. Li. (1996). “A Tabu Search Based Heuristic for Arc Routing with a Capacity Constraint and Time Deadline.” In I.H. Osman and J.P. Kelly (eds.), Metaheuristics: Theory and Applications. Kluwer, pp. 633-650.

  • French, S. (1982). Sequencing and Scheduling. Chichester: Ellis Horwood.

    Google Scholar 

  • Ghianni, G., G. Improta, and G. Laporte. (2001). “The Capacitated Arc Routing Problem with Intermediate Facilities.” Networks 37(3), 134-143.

    Google Scholar 

  • Golden, B.L. and R.T. Wong. (1981). “Capacitated Arc Routing Problems.” Networks 11, 305-315.

    Google Scholar 

  • Golden, B.L., J.S. DeArmon, and E.K. Baker. (1983). “Computational Experiments with Algorithms for a Class of Routing Problems.” Computers and Operation Research 10(1), 47-59.

    Google Scholar 

  • Greistorfer, P. (2003). “A Tabu Scatter Search Metaheuristic for the Arc Routing Problem.” Computers and Industrial Engineering 44(2), 249-266.

    Article  Google Scholar 

  • Hartmann, S. (1998). “A Competitive Genetic Algorithm for Resource-Constrained Project Scheduling.” Naval Research Logistics 45(7), 733-750.

    Article  Google Scholar 

  • Hertz, A., G. Laporte, and P. Nanchen-Hugo. (1999). “Improvement Procedures for the Undirected Rural Postman Problem.” INFORMS Journal on Computing 11(1), 53-62.

    Google Scholar 

  • Hertz, A., G. Laporte, and M. Mittaz. (2000). “A Tabu Search Heuristic for the Capacitated Arc Routing Problem.” Operations Research 48(1), 129-135.

    Article  Google Scholar 

  • Hirabayashi, R., Y. Saruwatari, and N. Nishida. (1992). “Tour Construction Algorithm for the Capacitated Arc Routing Problem.” Asia-Pacific Journal of Operational Research 9, 155-175.

    Google Scholar 

  • Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.

  • Lacomme, P., C. Prins, and W. Ramdane-Chérif. (2001). “A Genetic Algorithm for the CARP and its Extensions.” In E.J.W. Boers et al. (eds.), Applications of Evolutionnary Computing, Lecture Notes in Computer Science, Vol. 2037. Springer, pp. 473-483.

  • Moscato, P. (1999). “Memetic Algorithms: A Short Introduction.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. McGraw-Hill, pp. 219-234.

  • Mourão, M.C. and T. Almeida. (2000). “Lower-Bounding and Heuristic Methods for a Refuse Collection Vehicle Routing Problem.” European Journal of Operational Research 121, 420-434.

    Article  Google Scholar 

  • Oliver, I.M., D.J. Smith, and J.R.C. Holland. (1987). “A Study of Permutation Crossover Operators on the Traveling Salesman Problem.” In J.J. Grefenstette (ed.), Proceedings of the 2nd Int. Conf. on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum, pp. 224-230.

    Google Scholar 

  • Pearn, W.L. (1989). “Approximate Solutions for the Capacitated Arc Routing Problem.” Computers and Operations Research 16(6), 589-600.

    Article  Google Scholar 

  • Pearn, W.L. (1991). “Augment-Insert Algorithms for the Capacitated Arc Routing Problem.” Computers and Operations Research 18(2), 189-198.

    Article  Google Scholar 

  • Potvin, J.-Y. and S. Bengio. (1996). “The Vehicle Routing Problem with Time Windows — Part II: Genetic Search.” INFORMS Journal on Computing 8(2), 165-172.

    Google Scholar 

  • Prins, C. (2000). “Competitive Genetic Algorithms for the Open-Shop Scheduling Problem.” Mathematical Methods of Operations Research 51, 540-564.

    Google Scholar 

  • Reeves, C.R. (1995). “A Genetic Algorithm for Flowshop Sequencing.” Computers and Operations Research 22(1), 5-13.

    Article  Google Scholar 

  • SPEC. (2001). “Standard Performance Evaluation Corporation.” http://www.spec.org

  • Ulusoy, G. (1985). “The Fleet Size and Mix Problem for Capacitated Arc Routing.” European Journal of Operational Research 22, 329-337.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Blaise Pascal –, Computer Science Laboratory, (CNRS UMR 6158), BP 10125, 63173, Aubière Cedex, France

    Philippe Lacomme

  2. University of Technology of Troyes – Industrial Systems Optimization Laboratory (LOSI), BP 2060, 10010, Troyes Cedex, France

    Christian Prins

  3. BP 2060, 10010, Troyes Cedex, France

    Wahiba Ramdane-Cherif

Authors
  1. Philippe Lacomme
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Prins
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wahiba Ramdane-Cherif
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lacomme, P., Prins, C. & Ramdane-Cherif, W. Competitive Memetic Algorithms for Arc Routing Problems. Ann Oper Res 131, 159–185 (2004). https://doi.org/10.1023/B:ANOR.0000039517.35989.6d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:ANOR.0000039517.35989.6d

Search

Navigation