文献类型：期刊文献

英文题名：Hybrid ant colony system for VRP

作者：Qi, Chengming[1]

第一作者：亓呈明

通讯作者：Qi, C.

机构：[1] College of Automation, Beijing Union University, Beijing 100101, China

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

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

年份：2007

卷号：4

期号：4

起止页码：1141-1146

外文期刊名：Journal of Information and Computational Science

收录：EI(收录号：20081811231894);Scopus(收录号：2-s2.0-42549119485)

语种：英文

外文关键词：Algorithms - Combinatorial optimization - Computer simulation - Logistics - Supply chain management

摘要：Vehicle routing problem (VRP) is a typical NP-hard problem in combinatorial optimization. The Ant system is a metaheuristic which is inspired by the trail following behavior of real ant colonies. In this paper, a hybrid ant colony system is proposed which couples with iterated local search (ILS) and randomized algorithm (RA), named IRACS, for solving VRP. In IRACS, only partial customers are randomly chosen to compute the transition probability. Experimental results for some benchmark problems verify that the proposed algorithm can achieve improved solution quality.