Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm

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 collaborative search algorithm, firstly, the sigm...

Descripción completa

Detalles Bibliográficos
Autores principales: Liu, Guangjun, Xu, Xiaoping, Wang, Feng, Tang, Yangli
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi 2022
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9019308/
https://www.ncbi.nlm.nih.gov/pubmed/35463281
http://dx.doi.org/10.1155/2022/1008617

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9019308/
https://www.ncbi.nlm.nih.gov/pubmed/35463281
http://dx.doi.org/10.1155/2022/1008617

Ejemplares similares