skip to main content
10.1145/3321707.3321797acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Novel ensemble genetic programming hyper-heuristics for uncertain capacitated arc routing problem

Authors Info & Claims
Published:13 July 2019Publication History

ABSTRACT

The Uncertain Capacitated Arc Routing Problem (UCARP) is an important problem with many real-world applications. A major challenge in UCARP is to handle the uncertain environment effectively and reduce the recourse cost upon route failures. Genetic Programming Hyper-heuristic (GPHH) has been successfully applied to automatically evolve effective routing policies to make real-time decisions in the routing process. However, most existing studies obtain a single complex routing policy which is hard to interpret. In this paper, we aim to evolve an ensemble of simpler and more interpretable routing policies than a single complex policy. By considering the two critical properties of ensemble learning, i.e., the effectiveness of each ensemble element and the diversity between them, we propose two novel ensemble GP approaches namely DivBaggingGP and DivNichGP. DivBaggingGP evolves the ensemble elements sequentially, while DivNichGP evolves them simultaneously. The experimental results showed that both DivBaggingGP and DivNichGP could obtain more interpretable routing policies than the single complex routing policy. DivNichGP can achieve better test performance than DivBaggingGP as well as the single routing policy evolved by the current state-of-the-art GPHH. This demonstrates the effectiveness of evolving both effective and interpretable routing policies using ensemble learning.

References

  1. S.K. Amponsah and S. Salhi. 2004. The Investigation of a Class of Capacitated Arc Routing Problems: The Collection of Garbage in Developing Countries. Waste Management 24, 7 (2004), 711--721.Google ScholarGoogle ScholarCross RefCross Ref
  2. José Brandão and Richard Eglese. 2008. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 35, 4 (2008), 1112--1126. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Grant Dick, Caitlin A Owen, and Peter A Whigham. 2018. Evolving bagging ensembles using a spatially-structured niching method. In Proceedings of the Genetic and Evolutionary Computation Conference. ACM, 418--425. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Karl F Doerner, Richard F Hartl, Vittorio Maniezzo, and Marc Reimann. 2004. Applying ant colony optimization to the capacitated arc routing problem. In International Workshop on Ant Colony Optimization and Swarm Intelligence. Springer, 420--421.Google ScholarGoogle ScholarCross RefCross Ref
  5. Moshe Dror. 2012. Arc routing: theory, solutions and applications. Springer Science & Business Media.Google ScholarGoogle ScholarCross RefCross Ref
  6. Marko Durasević and Domagoj Jakobović. 2018. Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment. Genetic Programming and Evolvable Machines 19, 1--2 (2018), 53--92. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Richard W Eglese and Leon YO Li. 1996. A tabu search based heuristic for arc routing with a capacity constraint and time deadline. In Meta-Heuristics. Springer, 633--649.Google ScholarGoogle Scholar
  8. Gérard Fleury, Philippe Lacomme, and Christian Prins. 2004. Evolutionary algorithms for stochastic arc routing problems. In Workshops on Applications of Evolutionary Computation. Springer, 501--512.Google ScholarGoogle ScholarCross RefCross Ref
  9. Bruce L Golden and Richard T Wong. 1981. Capacitated arc routing problems. Networks 11, 3 (1981), 305--315.Google ScholarGoogle ScholarCross RefCross Ref
  10. H. Handa, L. Chapman, and Xin Yao. 2005. Dynamic salting route optimisation using evolutionary computation. In IEEE Congress on Evolutionary Computation. 158--165.Google ScholarGoogle ScholarCross RefCross Ref
  11. H. Handa, L. Chapman, and Xin Yao. 2006. Robust route optimization for gritting/salting trucks: a CERCIA experience. IEEE Computational Intelligence Magazine 1, 1 (2006), 6--9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Alain Hertz, Gilbert Laporte, and Michel Mittaz. 2000. A tabu search heuristic for the capacitated arc routing problem. Operations research 48, 1 (2000), 129--135. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Torsten Hildebrandt and Jürgen Branke. 2015. On using surrogates with genetic programming. Evolutionary computation 23, 3 (2015), 343--367. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Josiah Jacobsen-Grocott, Yi Mei, Gang Chen, and Mengjie Zhang. 2017. Evolving heuristics for Dynamic Vehicle Routing with Time Windows using genetic programming. In IEEE Congress on Evolutionary Computation. IEEE, 1948--1955.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Philippe Lacomme, Christian Prins, and Wahiba Ramdane-Chérif. 2001. A genetic algorithm for the capacitated arc routing problem and its extensions. In Workshops on Applications of Evolutionary Computation. Springer, 473--483. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Philippe Lacomme, Christian Prins, and Wahiba Ramdane-Cherif. 2004. Competitive memetic algorithms for arc routing problems. Annals of Operations Research 131, 1--4 (2004), 159--185.Google ScholarGoogle ScholarCross RefCross Ref
  17. Philippe Lacomme, Christian Prins, and Alain Tanguy. 2004. First competitive ant colony scheme for the CARP. In International Workshop on Ant Colony Optimization and Swarm Intelligence. Springer, 426--427.Google ScholarGoogle ScholarCross RefCross Ref
  18. Yuxin Liu, Yi Mei, Mengjie Zhang, and Zili Zhang. 2017. Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem. In Proceedings of the Genetic and Evolutionary Computation Conference. ACM, 290--297. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Sean Luke, Liviu Panait, Gabriel Balan, Sean Paus, Zbigniew Skolicki, Jeff Bassett, Robert Hubley, and A Chircop. 2006. Ecj: A java-based evolutionary computation research system. Downloadable versions and documentation can be found at the following url: http://cs.gmu.edu/eclab/projects/ecj (2006).Google ScholarGoogle Scholar
  20. Jordan MacLachlan, Yi Mei, Juergen Branke, and Mengjie Zhang. 2018. An Improved Genetic Programming Hyper-Heuristic for the Uncertain Capacitated Arc Routing Problem. In Australasian Joint Conference on Artificial Intelligence. Springer, 432--444.Google ScholarGoogle Scholar
  21. Yi Mei, Ke Tang, and Xin Yao. 2009. A global repair operator for capacitated arc routing problem. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 39, 3 (2009), 723--734. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Yi Mei, Ke Tang, and Xin Yao. 2010. Capacitated arc routing problem in uncertain environments. In IEEE Congress on Evolutionary Computation. IEEE, 1--8.Google ScholarGoogle ScholarCross RefCross Ref
  23. Yi Mei, Ke Tang, and Xin Yao. 2011. Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem. IEEE Transactions on Evolutionary Computation 15, 2 (2011), 151--165. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Yi Mei and Mengjie Zhang. 2018. Genetic Programming Hyper-heuristic for Multi-vehicle Uncertain Capacitated Arc Routing Problem. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '18). ACM, New York, NY, USA, 141--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Sangyoon Oh, Min Su Lee, and Byoung-Tak Zhang. 2011. Ensemble learning with active example selection for imbalanced biomedical data classification. IEEE/ACM transactions on computational biology and bioinformatics 8, 2 (2011), 316--325. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Mahesh Pal. 2005. Random forest classifier for remote sensing classification. International Journal of Remote Sensing 26, 1 (2005), 217--222.Google ScholarGoogle ScholarCross RefCross Ref
  27. John Park, Su Nguyen, Mengjie Zhang, and Mark Johnston. 2015. Evolving ensembles of dispatching rules using genetic programming for job shop scheduling. In European Conference on Genetic Programming. Springer, 92--104.Google ScholarGoogle ScholarCross RefCross Ref
  28. Alain Pétrowski. 1996. A clearing procedure as a niching method for genetic algorithms. In Evolutionary Computation, 1996., Proceedings of IEEE International Conference on. IEEE, 798--803.Google ScholarGoogle ScholarCross RefCross Ref
  29. Ulrike Ritzinger, Jakob Puchinger, and Richard F Hartl. 2016. A survey on dynamic and stochastic vehicle routing problems. International Journal of Production Research 54, 1 (2016), 215--231.Google ScholarGoogle ScholarCross RefCross Ref
  30. Lei Shi, Xinming Ma, Lei Xi, Qiguo Duan, and Jingying Zhao. 2011. Rough set and ensemble learning based semi-supervised algorithm for text classification. Expert Systems with Applications 38, 5 (2011), 6300--6306. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Ke Tang, Yi Mei, and Xin Yao. 2009. Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Transactions on Evolutionary Computation 13, 5 (2009), 1151--1166. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Juan Wang, Ke Tang, Jose A Lozano, and Xin Yao. 2016. Estimation of the distribution algorithm with a stochastic local search for uncertain capacitated arc routing problems. IEEE Transactions on Evolutionary Computation 20, 1 (2016), 96--109.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Juan Wang, Ke Tang, and Xin Yao. 2013. A memetic algorithm for uncertain capacitated arc routing problems. In Memetic Computing (MC), 2013 IEEE Workshop on. IEEE, 72--79.Google ScholarGoogle ScholarCross RefCross Ref
  34. Thomas Weise, Alexandre Devert, and Ke Tang. 2012. A developmental solution to (dynamic) capacitated arc routing problems using genetic programming. In Proceedings of the 14th annual conference on Genetic and evolutionary computation. ACM, 831--838. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Sanne Wøhlk. 2008. A decade of capacitated arc routing. In The vehicle routing problem: latest advances and new challenges. Springer, 29--48.Google ScholarGoogle Scholar
  36. Lean Yu, Shouyang Wang, and Kin Keung Lai. 2008. Credit risk assessment with a multistage neural network ensemble learning approach. Expert systems with applications 34, 2 (2008), 1434--1444. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Zhi-Hua Zhou. 2012. Ensemble methods: foundations and algorithms. Chapman and Hall/CRC. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Novel ensemble genetic programming hyper-heuristics for uncertain capacitated arc routing problem

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference
      July 2019
      1545 pages
      ISBN:9781450361118
      DOI:10.1145/3321707

      Copyright © 2019 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 13 July 2019

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader