文献类型：会议论文

中文题名：A Modified Ant Algorithm for Solving the Vehicle Routing Problem

作者：Chengming Qi[1];

第一作者：亓呈明

机构：[1]College of Automation, Beijing Union University, Beijing 100101, P.R.China;

第一机构：北京联合大学城市轨道交通与物流学院

会议论文集：The 2007 International Conference on Intelligent Systems and Knowledge Engineering(第二届智能系统与知识工程国际会议)论文集

会议日期：20071015

会议地点：成都

主办单位：中国电子学会;四川省电子学会

语种：英文

中文关键词：Ant colony system;Combinatorial op-timization;Randomized algorithm;Vehicle routing problem.

摘要：The ant system is a metaheuristic developed for the solution of hard combinatorial optimization problems. In this paper, through an analysis of the constructive procedure of the solution in the Ant Colony System (ACS), a modified algorithm for solving Vehicle Routing Problem (VRP), based on the ACS Hybridized with Randomized Algo-rithm(HRACS), is proposed. In HRACS, only par-tial customers are randomly chosen to compute the transition probability. Experiments on vari-ous aspects of the algorithm and computational results for fourteen benchmark problems are re-ported. We compare our approach with some other meta-heuristics and show that our results are com-petitive.