Bi-trajectory hybrid search to solve bottleneck-minimized colored traveling salesman problems

Y Zhou, W Xu, M Zhou, ZH Fu - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
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 …
被引用次数：11 相关文章

Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems

Y Zhou, W Xu, M Zhou, ZH Fu - IEEE Transactions on …, 2024 - researchwith.njit.edu
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 …