Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows

  • Authors:
  • Xuan Tan;Xuyao Luo;W. N. Chen;Jun ZHANG

  • Affiliations:
  • SUN Yat-sen University, P.R.China;SUN Yat-sen University, P.R.China;SUN Yat-sen University, P.R.China;SUN Yat-sen University, P.R.China

  • Venue:
  • CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-2 (CIMCA-IAWTIC'06) - Volume 02
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Research on optimization of the Vehicle Routing Problem with Time Windows (VRPTW) is one of the most significant and promising areas of investigation in ant colony system (ACS), since ACS is used to find a near-optimum solution for a discrete optimization problem. As VRPTW is the typical case of discrete optimization problem, in this paper, an ACS was proposed to optimize a VRPTW problem. The numerical experiments of ACS were implemented in the VRPTW problem. The optimized results of ACS are favorably compared with other optimization methods'.