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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on evolutionary computation Jg. 27; H. 6; S. 1633 - 1647
Hauptverfasser:	Wang, Shaolin, Mei, Yi, Zhang, Mengjie
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!