A bottleneck-minimized colored traveling salesman problem is an important variant of
colored traveling salesman problems. It is useful in handling the planning problems with
partially overlapped workspace such as the scheduling transportation resources for timely
delivery of goods. In this work, we propose an efficient bi-trajectory hybrid search method for
it. The proposed method integrates a route-based crossover operator to generate promising
offspring solutions, a multi-neighborhood simulated annealing to perform local optimization …