A modified ant colony system for solving the travelling salesman problem with time windows

  • Authors:

  • Chi-Bin Cheng;Chun-Pin Mao

  • Affiliations:

  • Department of Information Management, Tamkang University, 151 Ying-chuan Road, Tamsui, Taipei County, Taiwan;Cell Manufacturing Department, AU Optronics Corporation, 1 JhongKe Rd., Central Taiwan Science Park, Taichung, Taiwan

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.98

Visualization

Abstract

The travelling salesman problem with time windows (TSPTW) involves finding the minimum cost tour in which all cities are visited exactly once within their requested time windows. This problem has a number of important practical applications, including scheduling and routing. The problem is regarded as NP-complete, and hence traditional optimization algorithms are inefficient when applied to solve larger scale TSPTW problems. Consequently, the development of approximation algorithms has received considerable attention in recent years. Ant colony optimization (ACO), inspired by the foraging behaviour of real ants, is one of the most attractive approximation algorithms. Accordingly, this study develops a modified ant algorithm, named ACS-TSPTW, based on the ACO technique to solve the TSPTW. Two local heuristics are embedded in the ACS-TSPTW algorithm to manage the time-window constraints of the problem. The numerical results obtained for a series of benchmark problem instances confirm that the performance of the ACS-TSPTW is comparable to that of ACS-Time, an existing ACO scheme for solving the TSPTW problem.