首页|Hybrid IT? Algorithm for Large-Scale Colored Traveling Salesman Problem
Hybrid IT? Algorithm for Large-Scale Colored Traveling Salesman Problem
扫码查看
点击上方二维码区域,可以放大扫码查看
原文链接
万方数据
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 1000 dimensions,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 stan-dard 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 pro-cess,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.