The Team Orienteering Problem with Time Windows (TOPTW) is a combinatorial optimization problem arising both in industrial scheduling and in transportation. Ant Colony System (ACS) is a well-known metaheuristic framework, and many efficient algorithms for different optimization problems - among them the TOPTW - have been derived from this general framework. In this paper some directions for improving an ACS algorithm for the TOPTW recently appeared in the literature are identified. The resulting algorithm, called Enhanced Ant Colony System is experimentally shown to be extremely effective on some well-known benchmark instances available in the literature.
An enhanced ant colony system for the team orienteering problem with time windows / Montemanni, R; Weyland, D; Gambardella, Lm. - (2011), pp. 381-384. (Intervento presentato al convegno 2011 International Symposium on Computer Science and Society, ISCCS 2011 tenutosi a Kota Kinabalu, Malaysia nel July 2011) [10.1109/ISCCS.2011.95].
An enhanced ant colony system for the team orienteering problem with time windows
Montemanni R;
2011
Abstract
The Team Orienteering Problem with Time Windows (TOPTW) is a combinatorial optimization problem arising both in industrial scheduling and in transportation. Ant Colony System (ACS) is a well-known metaheuristic framework, and many efficient algorithms for different optimization problems - among them the TOPTW - have been derived from this general framework. In this paper some directions for improving an ACS algorithm for the TOPTW recently appeared in the literature are identified. The resulting algorithm, called Enhanced Ant Colony System is experimentally shown to be extremely effective on some well-known benchmark instances available in the literature.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
