A Multi-Objective Genetic Programming Algorithm With α Dominance and Archive for Uncertain Capacitated Arc Routing Problem

The uncertain capacitated arc routing problem (UCARP) 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 U...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on evolutionary computation Vol. 27; no. 6; pp. 1633 - 1647
Main Authors:	Wang, Shaolin, Mei, Yi, Zhang, Mengjie
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Archives & records Bias Capacitated arc routing Combinatorial analysis Costs Effectiveness Genetic algorithms Genetic programming hyper-heuristic multiobjective Optimization Policies Programming Routing Statistics Task analysis Training
ISSN:	1089-778X, 1941-0026
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!