摘要
Abstract
Traveling salesman problem (TSP), a typical NP-hard problem, is one of the hot researching topics in the combined optimization area. It has already attracted many researchers from all areas. CTSP, a promotion of TSP deformation, is more complex than TSP, and has a wide range of applications. Genetic algorithm (GA) has the ability of conducting a stochastic global searching. However, using ability of feedback information is poor,convergence is slow, and its solving efficiency is low. Ant colony system (ACS) algorithm not only has the ability of parallel global searching, but also can avoid converging to a local minimal solution to possibility of stopping evolution. It lacks initial information and slow convergence. GA and ACS can be combined into CIA,which can be used to solve CTSP, having good properties of fully using information and fast convergence.关键词
TSP/CTSP/遗传算法/蚁群算法/混合智能算法Key words
TSP/ CTSP/ genetic algorithm/ ACS algorithm/ combined intelligent algorithm分类
信息技术与安全科学
