A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem

The capacitated arc routing problem (CARP) is representative of numerous practical applications, and in order to widen its scope, we consider an extended version of this problem that entails both total service time and fixed investment costs. We subsequently propose a hybrid ant colony optimization...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on cybernetics 2011-08, Vol.41 (4), p.1110-1123
Hauptverfasser:	Li-Ning Xing, Rohlfshagen, P., Ying-Wu Chen, Xin Yao
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Ant colony optimization Ant colony optimization (ACO) Benchmark testing Benchmarking capacitated arc routing problem (CARP) Carp Colonies combinatorial optimization Computer architecture Cybernetics Heuristic Heuristic algorithms Local optimization memetic algorithms (MAs) Operations research Optimization Routing Studies Vehicles
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!