文献类型：会议论文

英文题名：An improved ant colony algorithm for VRPTW

作者：Qi, Chengming[1]; Sun, Yunchuan[2]

第一作者：亓呈明

通讯作者：Qi, C.

机构：[1] College of Automation, Beijing Union University, Beijing 100101, China; [2] School of Economics and Business Administration, Beijing Normal University, Beijing 100875, China

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

通讯机构：[1]College of Automation, Beijing Union University, Beijing 100101, China|[1141751]北京联合大学城市轨道交通与物流学院;[11417]北京联合大学;

会议论文集：Proceedings - International Conference on Computer Science and Software Engineering, CSSE 2008

会议日期：December 12, 2008 - December 14, 2008

会议地点：Wuhan, Hubei, China

语种：英文

外文关键词：Software engineering - Vehicle routing

摘要：The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem. The primary objective of VRPTW is defined as the minimization of the number of routes or vehicles. Minimization of the total travel cost is secondary objective. This paper proposes an improved algorithm based on the Ant Colony System (ACS), which hybridized with randomized algorithm(RACS-VRPTW). In two objectives of VRPTW, only partial customers are randomly chosen to compute the transition probability. Experiments on various aspects of the algorithm and computational results for partial benchmark problems are reported. We compare our approach with some other meta-heuristics and show that our results are competitive. ? 2008 IEEE.