An Enhanced Ant Colony System for the Team Orienteering Problem with Time Windows

Author

Montemanni, R. ; Weyland, D. ; Gambardella, L.M.

Author_Institution

Ist. Dalle Molle di Studi sull´´Intell. Artificiale (IDSIA), Manno, Switzerland

fYear

2011

fDate

16-17 July 2011

Firstpage

381

Lastpage

384

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.

Keywords

combinatorial mathematics; optimisation; scheduling; transportation; combinatorial optimization problem; enhanced ant colony system; industrial scheduling; metaheuristic framework; team orienteering problem; time windows; transportation; Computers; Operations research; Optimization; Probabilistic logic; Proposals; Routing; Vehicles; Combinatorial optimization; ant colony optimization; metaheuristics; team orienteering problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Society (ISCCS), 2011 International Symposium on

Conference_Location

Kota Kinabalu

Print_ISBN

978-1-4577-0644-8

Type

conf

DOI

10.1109/ISCCS.2011.95

Filename

6004465