摘要
This research presents a new problem maximum scatter colored traveling salesman problem (MSCTSP), the objective of MSCTSP is to find Hamiltonian cycles with the minimal edge as max as possible, it is used to simulate the real-world applications of network and transport. Since MSCTSP has been proved to be a NP-hard problem, population-based algorithms can be used for solving it. However, the performances are not satisfactory. Thus, it is necessary to develop novel algorithms to obtain high quality feasible solution. Based on the above reason, the paper proposes a novel hybrid ITo (HITo) algorithm, which integrates the two new strategies: crossover operator and mutation strategy, into the standard ITo. In the iteration course of HITo, the dual-chromosome coding is used to code a feasible solution of MSCTSP, and the stochastic drift and volatility operators are used to explore and exploit new unknown region. During the process, drift operator is performed by crossover operator, volatility operator is carried out by mutation strategy, and they are both affected by activity intensity of particles which functionally depends on the radius and temperature. Experiments display HITo shows an improvement over comparative algorithms on solution quality.
学科与关键词
- Hybrid ITO Algorithm for Large-Scale Colored Traveling Salesman ProblemDong, Xueshi*CHINESE JOURNAL OF ELECTRONICS, 2024, 33(6): 1337-1345.
- A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problemDong, Xueshi*; Lin, Qing; Shen, Fanfan; Guo, Qingteng; Li, QingshunSwarm and Evolutionary Computation, 2023, 83: 101406.被引 11
- ITO algorithm with local search for large scale multiple balanced traveling salesmen problemDong, Xueshi*; Xu, Min; Lin, Qing*; Han, Shuning; Li, Qingshun; Guo, QingtengKnowledge-Based Systems, 2021, 229: 107330.被引 15
