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

  • Authors:
  • R. Montemanni;D. Weyland;L. M. Gambardella

  • Affiliations:
  • -;-;-

  • Venue:
  • ISCCS '11 Proceedings of the 2011 International Symposium on Computer Science and Society
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.