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 sub-swarm, 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.

[1]  Xin-She Yang,et al.  Discrete cuckoo search algorithm for the travelling salesman problem , 2014, Neural Computing and Applications.

[2]  Dervis Karaboga,et al.  A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..

[3]  Shengxiang Yang,et al.  Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems , 2017, IEEE Transactions on Cybernetics.

[4]  Adewole Philip,et al.  A Genetic Algorithm for Solving Travelling Salesman Problem , 2011 .

[5]  Dan Simon,et al.  Biogeography-Based Optimization , 2022 .

[6]  Mauro Dell'Amico,et al.  Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading , 2010, Comput. Oper. Res..

[7]  Vicky H. Mak-Hau,et al.  Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs , 2007, Discret. Appl. Math..

[9]  Jianxin Zhou,et al.  An improved teaching-learning-based optimization algorithm and its application to a combinatorial optimization problem in foundry industry , 2017, Appl. Soft Comput..

[10]  Alper Hamzadayi,et al.  Testing the performance of teaching-learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling cases , 2014, Inf. Sci..

[11]  Swaroop Darbha,et al.  An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem , 2007, Oper. Res. Lett..

[12]  John Knox,et al.  Tabu search performance on the symmetric traveling salesman problem , 1994, Comput. Oper. Res..

[13]  R. Venkata Rao,et al.  Teaching-Learning-Based Optimization: An optimization method for continuous non-linear large scale problems , 2012, Inf. Sci..