文献类型：会议论文

英文题名：An Ant Colony System hybridized with randomized algorithm for TSP

作者：Qi, Chenming

第一作者：亓呈明

通讯作者：Qi, CM[1]

机构：[1]Beijing Union Univ, Coll Automat, Beijing 100101, Peoples R China

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

通讯机构：[1]corresponding author), Beijing Union Univ, Coll Automat, Beijing 100101, Peoples R China.|[1141751]北京联合大学城市轨道交通与物流学院;[11417]北京联合大学;

会议论文集：8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing/3rd ACIS International Workshop on Self-Assembling Wireless Networks

会议日期：JUL 30-AUG 01, 2007

会议地点：Qungdao, PEOPLES R CHINA

语种：英文

外文关键词：Ant Colony System; combinatorial optimization; randomized algorithm; TSP

摘要：Ant algorithms are a recently developed, population-based approach which has been successfully applied to several NP-hard combinatorial optimization problems. In this paper, through an analysis of the constructive procedure of the solution in the Ant Colony System (ACS), we present an Ant Colony. System Hybridized with Randomized Algorithm(RAACS). In RAACS, only partial cities are randomly chosen to compute the state transition probability. Experimental results for solving the Traveling Salesman Problems(TSP) with both ACS and RAACS demonstrate that averagely speaking, the proposed method is better in both the quality of solutions and the speed of convergence compared with the A CS.