Explaining Genetic Programming-Evolved Routing Policies for Uncertain Capacitated Arc Routing Problems

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{Shaolin_Wang:ieeeTEC2,

• author = "Shaolin Wang and Yi Mei and Mengjie Zhang",
• title = "Explaining Genetic Programming-Evolved Routing Policies for Uncertain Capacitated Arc Routing Problems",
• journal = "IEEE Transactions on Evolutionary Computation",
• year = "2024",
• volume = "28",
• number = "4",
• pages = "918--932",
• month = aug,
• keywords = "genetic algorithms, genetic programming, Task analysis, Routing, Costs, Computational modeling, Vehicle dynamics, Training, Random variables, Capacitated arc routing, hyper-heuristic, interpretability",
• ISSN = "1941-0026",
• DOI = "doi:10.1109/TEVC.2023.3238741",
• size = "15 pages",
• abstract = "Genetic programming has been successfully used to evolve routing policies that can make real-time routing decisions for uncertain arc routing problems. Although the evolved routing policies are highly effective, they are typically very large and complex, and hard to be understood and trusted by real users. Existing studies have attempted to improve the interpretability by developing new genetic programming approaches to evolve both effective and interpretable (e.g., with smaller program size) routing policies. However, they still have limitations due to the trade-off between effectiveness and interpretability. To address this issue, we propose a new post-hoc explanation approach to explaining the effective but complex routing policies evolved by genetic programming. The new approach includes a local ranking explanation and a global explanation module. The local ranking explanation uses particle swarm optimisation to learn an interpretable linear model that accurately explains the local behaviour of the routing policy for each decision situation. Then, the global explanation module uses a clustering technique to summarise the local explanations into a global explanation. The experimental results and case studies on the benchmark datasets show that the proposed method can obtain accurate and understandable explanations of the routing policies evolved for uncertain arc routing problems. Our explanation approach is not restricted to uncertain arc routing, but has a great potential to be generalised to other optimisation and machine learning problems such as learning classifier systems and reinforcement learning.",
• notes = "Also known as \cite{10024365}",

}

Genetic Programming entries for Shaolin Wang Yi Mei Mengjie Zhang

Citations