A Multi-Objective Genetic Programming Algorithm with alpha-dominance and Archive for Uncertain Capacitated Arc Routing Problem

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

@Article{Shaolin_Wang:ieeeTEC,

• author = "Shaolin Wang and Yi Mei and Mengjie Zhang",
• title = "A Multi-Objective Genetic Programming Algorithm with alpha-dominance and Archive for Uncertain Capacitated Arc Routing Problem",
• journal = "IEEE Transactions on Evolutionary Computation",
• year = "2023",
• volume = "27",
• number = "6",
• pages = "1633--1647",
• month = dec,
• keywords = "genetic algorithms, genetic programming",
• ISSN = "1089-778X",
• DOI = "doi:10.1109/TEVC.2022.3195165",
• abstract = "The uncertain capacitated arc routing problem is an important combinatorial optimization problem with many applications in the real world. Genetic programming hyper heuristic has been successfully used to automatically evolve routing policies, which can make real-time routing decisions for uncertain capacitated arc routing problems. It is desired to evolve routing policies that are both effective and small/simple to be easily understood. The effectiveness and size are two potentially conflicting objectives. A further challenge is the objective selection bias issue, i.e., it is much more likely to obtain small but ineffective routing policies than the effective ones that are typically large. In this paper, we propose a new multi-objective genetic programming algorithm to evolve effective and small routing policies. The new algorithm employs the a dominance strategy with a newly proposed α adaptation scheme to address the objective selection bias issue. In addition, it cont",
• notes = "also known as \cite{9845191}",

}

Genetic Programming entries for Shaolin Wang Yi Mei Mengjie Zhang

Citations