期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 36, 期 3, 页码 6995-7001出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2008.08.026
关键词
TSP (traveling salesman problem); Genetic algorithm; Heterogeneous pairing selection; Reinforcement mutation
类别
资金
- National Natural Science Foundation of China [60573169]
TSP (traveling salesman problem) is one of the typical NP-hard problems in combinatorial optimization problem. An improved genetic algorithm with reinforcement mutation, named RMGA, was proposed to solve the TSP in this paper, The core of RMGA lies in the use of heterogeneous pairing selection instead of random pairing selection in EAX and the construction of reinforcement mutation operator, named RLM, by modifying the Q-learning algorithm and applying it to those individual generated from modified EAX The experimental results on small and large size TSP instances in TSPLIB (traveling salesman problem library) have shown that RMGA could almost get optimal tour every time in reasonable time and thus outperformed the known EAX-GA and LKH in the quality of solutions and the running time. (c) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据