A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem

Open Webpage

Xueshi Dong, Qing Lin, Fanfan Shen, Qingteng Guo, Qingshun Li

Published: 01 Jan 2023, Last Modified: 10 Jan 2025Swarm Evol. Comput. 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•ITÖ lemma is firstly introduced into hybrid simulated annealing algorithm (GCSA).•The former work provides basic theory of mathematics and physics for the research.•Paper discusses colored bottleneck traveling salesmen problem (CBTSP).•Gene coding is utilized for multiple-scale optimization of CBTSP.•A hybrid simulated annealing algorithm is proposed for CBTSP.•Improved generating neighborhood solution is integrated into GCSA for optimization.•Optimized crossover operator is used in GCSA for improvement.•Experiments demonstrate the effectiveness of the proposed algorithm.