期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：5
DOI：10.15680/ijircce.2015.0305025
出版社：S&S Publications
摘要：Travelling salesman problem (TSP) is a routing problem, which is a sub-problem of many applicationdomains such as transportation, network communication. In this paper, we propose a novel methodology which solvesthe problem ACO algorithm has defined with well distribution strategy in which total search space area is partitioninto P numbers of hyper-cubic quadrants where P is the dimension of total search space is updating ant colonyoptimization heuristic parameter that improve the performance When solving TSP. From experimental Results, wecan see that proposed algorithm is giving better showing than other standard algorithms
关键词：pheromone; global minima; ant colony optimization; travelling salesman problem; NACO.
