A dynamic space reduction ant colony optimization for capacitated vehicle routing problem

As a typical meta-heuristic algorithm, ant colony optimization (ACO) has achieved good results in solving discrete combinatorial optimization problems. However, it suffers from poor solutions and the drawback of easily being trapped in local optima. This paper presents a new type of ACO called “dyna...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Soft computing (Berlin, Germany) Jg. 26; H. 17; S. 8745 - 8756
Hauptverfasser:	Cai, Jinsi, Wang, Peng, Sun, Siqing, Dong, Huachao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022
Schlagworte:	Artificial Intelligence Computational Intelligence Control Engineering Mathematical Logic and Foundations Mechatronics Optimization Robotics Ant colony optimization Discrete combinatorial optimization problem Capacitated vehicle routing problem Evolutionary algorithm
ISSN:	1432-7643, 1433-7479
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!