Multi-neighborhood simulated annealing-based iterated local search for colored traveling salesman problems

Y Zhou, W Xu, ZH Fu, MC Zhou - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …
被引用次数：50 相关文章

Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems

Y Zhou, W Xu, ZH Fu, MC Zhou - IEEE Transactions on Intelligent …, 2022 - dl.acm.org
A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …

Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems

Y Zhou, W Xu, ZH Fu, MC Zhou - IEEE Transactions on Intelligent …, 2022 - trid.trb.org
A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …

Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems

Y Zhou, W Xu, ZH Fu, MC Zhou - IEEE Transactions on …, 2022 - researchwith.njit.edu
A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …