Improved Ant Colony Algorithm for Vehicle Routing Problem

Vehicle routing problem is a typical NP hard problem in combinatorial optimization. This paper proposes an improved algorithm, namely Immune Ant Colony Algorithm to solve the problem of vehicle routing problem. The algorithm is based on the intelligent optimization idea- Ant Colony Algorithm and Artificial Immune Algorithm. In this paper, in order to solve the problem of vehicle routing problem effectively four aspects are modified to improve the basic ant colony algorithm. And the improved Artificial Immune Algorithm is used to solve the problem of Ant Colony Algorithm to be apt to plunge into as the local optimum solution. On the basis of these improvements, the framework of the new algorithm—Immune Ant Colony Algorithm is given. Finally, it was proved that Immune Colony Algorithm can quicken the convergence rate to obtain optimal solution and decrease computing time. In addition, the computing simulation examples show its validity.


  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 3339-3344
  • Monograph Title: ICLEM 2010: Logistics For Sustained Economic Development: Infrastructure, Information, Integration

Subject/Index Terms

Filing Info

  • Accession Number: 01525516
  • Record Type: Publication
  • ISBN: 9780784411391
  • Files: TRIS, ASCE
  • Created Date: Nov 12 2013 1:53PM