Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem
Sign Up to like & getrecommendations! Published in 2019 at "IET Intelligent Transport Systems"
DOI: 10.1049/iet-its.2018.5359
Abstract: Coloured travelling salesman problem (CTSP) is an extended model of multiple travelling salesman problems (MTSPs), as one kind of problem in combination optimisation problems, which has been applied to many real-world planning problems such as… read more here.
Keywords: salesman; ctsp; problem; large scale ... See more keywords
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
Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm
Sign Up to like & getrecommendations! Published in 2022 at "Computational Intelligence and Neuroscience"
DOI: 10.1155/2022/1008617
Abstract: The traveling salesman problem is a typical NP hard problem and a typical combinatorial optimization problem. Therefore, an improved artificial cooperative search algorithm is proposed to solve the traveling salesman problem. For the basic artificial… read more here.
Keywords: salesman; problem; traveling salesman; algorithm ... See more keywords
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Sign Up to like & getrecommendations! Published in 2022 at "Axioms"
DOI: 10.3390/axioms11090439
Abstract: The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once. There are a number of… read more here.
Keywords: problem; salesman; phase method; traveling salesman ... See more keywords