摘要
阐述遗传算法针对一类NP完全的组合优化问题——旅行商问题,提出采用高级算子操作对遗传算法进行改进,仅利用城市间的距离信息求解中国旅行商问题,用很短的时间得到了16719km这一最优结果.
In this paper, genetic algorithms are focusing on a kind of NP complete combination optimum problem —— traveling salesman problem, puts forward adopting senior operators to improve genetic algorithny. Only distances between the cities are used in the improved genetic algorithms, and 16 719 km has been obtained in the shortest time.
出处
《哈尔滨商业大学学报（自然科学版）》
CAS
2005年第4期517-518,521,共3页
Journal of Harbin University of Commerce：Natural Sciences Edition
关键词
遗传算法
组合优化
旅行商问题
交换算子
genetic algorithms
combination optimum
traveling salesman problem
senior operator
