What makes the dynamic capacitated Arc routing problem hard to solve-Reference-Cited by-同舟云学术

What makes the dynamic capacitated Arc routing problem hard to solve

Published:2022-07-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference
language:
Short-container-title:

Author:

Tong Hao¹,Minku Leandro L.¹,Menzel Stefan²,Sendhoff Bernhard²,Yao Xin³

Affiliation:

1. University of Birmingham, Birmingham, UK

2. Honda Research Institute Europe, Offenbach, Germany

3. SUSTech, Shenzhen, China

Funder

Honda Research Institute Europe (HRI-EU)

Guangdong Provincial Key Laboratory

Shenzhen Science and Technology Program

Program for Guangdong Introducing Innovative and Enterpreneurial Teams

Research Institute of Trustworthy Autonomous Systems (RITAS)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3512290.3528756

Reference25 articles.

1. Ángel Corberán , Richard Eglese , Geir Hasle , Isaac Plana , and José María Sanchis . 2020. Arc routing problems: A review of the past, present, and future. Networks (June 2020 ). Ángel Corberán, Richard Eglese, Geir Hasle, Isaac Plana, and José María Sanchis. 2020. Arc routing problems: A review of the past, present, and future. Networks (June 2020).

2. Fabio Daolio , Sébastien Verel , Gabriela Ochoa , and Marco Tomassini . 2013 . Local optima networks of the permutation flow-shop problem . In International Conference on Artificial Evolution (Evolution Artificielle). Springer, 41--52 . Fabio Daolio, Sébastien Verel, Gabriela Ochoa, and Marco Tomassini. 2013. Local optima networks of the permutation flow-shop problem. In International Conference on Artificial Evolution (Evolution Artificielle). Springer, 41--52.

3. Dynamic Salting Route Optimisation using Evolutionary Computation

4. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms;Jones Terry;ICGA,1995

5. A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Hierarchical Dissimilarity Metric for Automated Machine Learning Pipelines, and Visualizing Search Behaviour;Lecture Notes in Computer Science;2024

2. Local Optima Correlation Assisted Adaptive Operator Selection;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12