ITO-based evolutionary algorithm to solve traveling salesman problem

2nd International Conference on Mathematical Modeling in Physical Sciences 2013

物理学;数学

Dong, Wenyong^1,2 ; Sheng, Kang^1 ; Yang, Chuanhua^3 ; Yi, Yunfei^1,4

Computer School, Wuhan University, Wuhan, China^1

Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, United States^2

Changjiang Wuhan Waterway Bureau, Wuhan, China^3

Department of Computer and Information Science, Hechi University, Yizhou, China^4

关键词: Algorithm performance;    Meta-heuristic methods;    Parameter set;    Population diversity;    Traveling salesman;    Wave operators;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/490/1/012195/pdf
DOI  :  10.1088/1742-6596/490/1/012195

来源: IOP

【 摘 要 】

In this paper, a ITO algorithm inspired by ITO stochastic process is proposed for Traveling Salesmen Problems (TSP), so far, many meta-heuristic methods have been successfully applied to TSP, however, as a member of them, ITO needs further demonstration for TSP. So starting from designing the key operators, which include the move operator, wave operator, etc, the method based on ITO for TSP is presented, and moreover, the ITO algorithm performance under different parameter sets and the maintenance of population diversity information are also studied.