Hybrid ITÖAlgorithm for Large-Scale Colored Traveling Salesman Problem  

作　　者：Xueshi DONG 

机构地区：[1]College of Computer Science and Technology,Qingdao University,Qingdao 266071,China [2]Beijing Key Laboratory of Urban Spatial Information Engineering,Beijing 100038,China [3]School of Computer Science,Wuhan University,Wuhan 430072,China

出　　处：《Chinese Journal of Electronics》2024年第6期1337-1345,共9页电子学报（英文版）

基　　金：supported by the Shandong Provincial Natural Science Foundation of China(Grant No.ZR2023MF092);the Beijing Key Laboratory of Urban Spatial Information Engineering(Grant No.20220109);the Shandong Provincial Key Laboratory of Software Engineering(Shandong University)。

摘　　要：In the fields of intelligent transportation and multi-task cooperation,many practical problems can be modeled by colored traveling salesman problem(CTSP).When solving large-scale CTSP with a scale of more than 1000dimensions,their convergence speed and the quality of their solutions are limited.This paper proposes a new hybrid IT?(HIT?)algorithm,which integrates two new strategies,crossover operator and mutation strategy,into the standard IT?.In the iteration process of HIT?,the feasible solution of CTSP is represented by the double chromosome coding,and the random drift and wave operators are used to explore and develop new unknown regions.In this process,the drift operator is executed by the improved crossover operator,and the wave operator is performed by the optimized mutation strategy.Experiments show that HIT?is superior to the known comparison algorithms in terms of the quality solution.

关 键 词：ITO algorithm Large scale optimization Colored traveling salesman problem Drift operator Wave operator 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]