Delaunay-Triangulation-Based Variable Neighborhood Search to Solve Large-Scale General Colored Traveling Salesman Problems
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Intelligent Transportation Systems"
DOI: 10.1109/tits.2020.2972389
Abstract: A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple traveling salesman problem. It utilizes colors to differentiate the accessibility of its cities to its salesmen. In our prior work, CTSPs are… read more here.
Keywords: salesman; colored traveling; general colored; large scale ... See more keywords