Thomas Weise
Alexandre Devert
ABSTRACT
A developmental, ontogenic approach to Capacitated Arc Routing Problems (CARPs) is introduced. The genotypes of this method are constructive heuristics specified as trees of mathematical functions which are evolved with Genetic Programming (GP). In a genotype-phenotype mapping, they guide a virtual vehicle which starts at the depot. The genotype is used to compute a heuristic value for each edge with unsatisfied demands. Local information such as the visiting costs from the current position, the remaining load of the vehicle, and the edge demands are available to the heuristic. The virtual vehicle then serves the edge with the lowest heuristic value and is located at its end. This process is repeated until all requirements have been satisfied. The resulting phenotypes are sets of tours which, in turn, are sequences of edges. We show that our method has three advantages: 1) The genotypes can be reused to seed the population in new GP runs. 2) The size of the genotypes is independent from the problem scale. 3) The evolved heuristics even work well in modified or dynamic scenarios and are robust in the presence of noise.
- E. Benavent, V. Campos, A. Corberán, and E. Mota. The Capacitated Arc Routing Problem. Lower Bounds. Networks, 22(7):669--690, 1992.Google Scholar
- P. J. Bentley and S. P. Kumar. The Ways to Grow Designs: A Comparison of Embryogenies for an Evolutionary Design Problem. In Genetic and Evolutionary Computation Conference (GECCO'99), pages 35--43. Morgan Kaufmann, 1999.Google Scholar
- J. Brandão and R. W. Eglese. A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem. Computers & Operations Research, 35(4):1112--1126, 2008. Google ScholarDigital Library
- E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and R. Qu. A Survey of Hyper-Heuristics. Computer Science Technical Report NOTTCS-TR-SUB-0906241418-2747, University of Nottingham: Nottingham, UK, 2009.Google Scholar
- E. K. Burke, M. Hyde, G. Kendall, and J. R. Woodward. A Genetic Programming Hyper-Heuristic Approach for Evolving Two Dimensional Strip Packing Heuristics. IEEE Transactions on Evolutionary Computation, 14(6):942--958, 2010. Google ScholarDigital Library
- J. S. DeArmon. A Comparison of Heuristics for the Capacitated Chinese Postman Problem. Master's thesis, University of Maryland: College Park, USA, 1981.Google Scholar
- A. Devert. Building Processes Optimization: Toward an Artificial Ontogeny based Approach. PhD thesis, Université Paris-Sud, 2009.Google Scholar
- A. Devert, N. Bredèche, and M. Schoenauer. Robustness and the halting problem for multicellular artificial ontogeny. IEEE Transactions on Evolutionary Computation, 15(3):387--404, 2011. Google ScholarDigital Library
- A. Devert, T. Weise, and K. Tang. A Study on Scalable Representations for Evolutionary Optimization of Ground Structures. Evolutionary Computation, 20, 2012. Google ScholarDigital Library
- M. Dror, editor. Arc Routing: Theory, Solutions and Applications. Springer, 2000.Google Scholar
- R. W. Eglese. Routing Winter Gritting Vehicles. Discrete Applied Mathematics, 48(3):231--244, 1994. Google ScholarDigital Library
- R. W. Eglese and L. Y. O. Li. A Tabu Search based Heuristic for Arc Routing with a Capacity Constraint and Time Deadline. In Meta-heuristics Theory and Applications, pages 633--649. Kluwer, 1996.Google Scholar
- H. A. Eiselt, M. Gendrau, and G. Laporte. Arc Routing Problems, Part I: The Chinese Postman Problem. Operations Research, 43(2):231--242, 1995.Google ScholarDigital Library
- N. S. Estévez and H. Lipson. Dynamical Blueprints: Exploiting Levels of System-Environment Interaction. In 9th Genetic and Evolutionary Computation Conference, pages 238--244. ACM, 2007. Google ScholarDigital Library
- R. W. Floyd. Algorithm 97 (SHORTEST PATH). Communications of the ACM, 5(6):345, 1962. Google ScholarDigital Library
- B. L. Golden and R. T. Wong. Capacitated Arc Routing Problems. Networks, 11(3):305--315, 1981.Google Scholar
- H. Handa, L. Chapman, and X. Yao. Robust Route Optimization for Gritting/Salting Trucks: A CERCIA Experience. IEEE Computational Intelligence Mag., 1(1):6--9, 2006. Google ScholarDigital Library
- H. Handa, D. Lin, L. Chapman, and X. Yao. Robust Solution of Salting Route Optimisation Using Evolutionary Algorithms. In IEEE Congress on Evolutionary Computation (CEC'06), pages 3098--3105. IEEE, 2006.Google Scholar
- A. Hertz, G. Laporte, and M. Mittaz. A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Operations Research, 48(1):129--135, 2000. Google ScholarDigital Library
- D. Jakobović and L. Budin. Dynamic Scheduling with Genetic Programming. In 9th European Conference Genetic Programming (EuroGP'06), volume 3905 of LNCS, pages 73--84. Springer, 2006. Google ScholarDigital Library
- M. Kiuchi, Y. Shinano, R. Hirabayashi, and Y. Saruwatari. An Exact Algorithm for the Capacitated Arc Routing Problem using Parallel Branch and Bound Method. In Abstracts of the Nat. Conf. of the Operations Research Soc. of Japan, pages 28--29, 1995. In Japanese.Google Scholar
- J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992. Google ScholarDigital Library
- M. Kwan. Graphic Programming Using Odd or Even Points. Chinese Mathematics, 1:273--277, 1962.Google Scholar
- P. Lacomme, C. Prins, andW. Ramdane-Chérif. Competitive Memetic Algorithms for Arc Routing Problems. Annals of Operations Research, 131(1-4):159--185, 2004.Google ScholarCross Ref
- P. Lacomme, C. Prins, and A. Tanguy. First competitive ant colony scheme for the carp. In 4th Intl. Workshop on Ant Colony Optimization and Swarm Intelligence, pages 426--427. Springer, 2004.Google ScholarCross Ref
- L. Y. O. Li and R. W. Eglese. An Interactive Algorithm for Vehicle Routing for Winter - Gritting. The Journal of the Operational Research Society, 47(2):217--228, 1996.Google Scholar
- Y. Mei, K. Tang, and X. Yao. A Global Repair Operator for Capacitated Arc Routing Problem. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 39 (3):723--734, 2009. Google ScholarDigital Library
- Y. Mei, K. Tang, and X. Yao. Decomposition-Based Memetic Algorithm for Multi-Objective Capacitated Arc Routing Problem. IEEE Transactions on Evolutionary Computation, 15(2):151--165, 2011. Google ScholarDigital Library
- M. O'Neill and C. Ryan. Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language, volume 4. Springer, 2003. Google ScholarDigital Library
- R. Ros and N. Hansen. A Simple Modification in CMAES Achieving Linear Time and Space Complexity. In 10th International Conference on Parallel Problem Solving from Nature, pages 296--305. Springer, 2008. Google ScholarDigital Library
- P. Ross. Hyper-Heuristics. In Search Methodologies - Introductory Tutorials in Optimization and Decision Support Techniques, chapter 17, pages 529--556. Springer, 2005.Google Scholar
- C. Ryan, J. J. Collins, and M. O'Neill. Grammatical Evolution: Evolving Programs for an Arbitrary Language. In First European Workshop on Genetic Programming, pages 83--95. Springer, 1998. Google ScholarDigital Library
- K. Tang, Y. Mei, and X. Yao. Memetic Algorithm with Extended Neighborhood Search for Capacitated Arc Routing Problems. IEEE Transactions on Evolutionary Computation, 13(5):1151--1166, 2009. Google ScholarDigital Library
- G. Ulusoy. The Fleet Size and Mix Problem for Capacitated Arc Routing. European Journal of Operational Research, 22 (3):329--337, 1985.Google ScholarCross Ref
- S. Wøhlk. A Decade of Capacitated Arc Routing. In The Vehicle Routing Problem: Latest Advances and New Challenges, volume 43, pages 29--48. Springer, 2008.Google Scholar
Index Terms
- A developmental solution to (dynamic) capacitated arc routing problems using genetic programming
Recommendations
Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem
GECCO '17: Proceedings of the Genetic and Evolutionary Computation ConferenceUncertain Capacitated Arc Routing Problem (UCARP) is a variant of the well-known CARP. It considers a variety of stochastic factors to reflect the reality where the exact information such as the actual task demand and accessibilities of edges are ...
A genetic algorithm for a bi-objective capacitated arc routing problem
The capacitated arc routing problem (CARP) is a very hard vehicle routing problem for which the objective-in its classical form-is the minimization of the total cost of the routes. In addition, one can seek to minimize also the cost of the longest ...
Capacitated arc routing problem with deadheading demands
Capacitated arc routing problem (CARP) is the determination of vehicle tours that serve all positive-demand edges (required edge) exactly once without exceeding vehicle capacity while minimizing sum of all tour costs. In CARP, total demand of a tour is ...
Comments