Discrete Teaching-learning-based optimization Algorithm for Traveling Salesman Problems

摘要：

　　In this paper,a discrete variant of TLBO(DTLBO)is proposed for solving the traveling salesman problem(TSP).In the proposed method,an effective learner representation scheme is redefined based on the characteristics of TSP problem.Moreover,all learners are randomly divided into several sub-swarms with equal amounts of learners so as to increase the diversity of population and reduce the probability of being trapped in local optimum.In each subswarm,the new positions of learners in the teaching phase and the learning phase are generated by the crossover operation,the legality detection and mutation operation,and then the offspring learners are determined based on greedy selection.Finally,to verify the performance of the proposed algorithm,benchmark TSP problems are examined and the results indicate that DTLBO is effective compared with other algorithms used for TSP problems.

作者: Lehui Wu Feng Zou Debao Chen

作者单位: School of Physics and Electronic Information,HuaiBei Normal University,Huaibei,235000,China

会议类型: 国际会议

会议名称: 2017 International Conference on Electronic Information Technology and Computer Engineering (EITCE 2017)(2017电子信息技术与计算机工程国际会议)(EITCE2017)

会议地点: 珠海

会议语种:英文

页码: 1-5

在线出版日期: 2017-09-23（万方平台首次上网日期，不代表论文的发表时间）