Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic

This article finds feasible solutions to the travelling salesman problem, obtaining the route with the shortest distance to visit n cities just once, returning to the starting city. The problem addressed is clustering the cities, then using the NEH heuristic, which provides an initial solution that...

Descripción completa

Detalles Bibliográficos
Autores principales: Anaya Fuentes, Gustavo Erick, Hernández Gress, Eva Selene, Seck Tuoh Mora, Juan Carlos, Medina Marín, Joselito
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2018
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6104944/
https://www.ncbi.nlm.nih.gov/pubmed/30133477
http://dx.doi.org/10.1371/journal.pone.0201868

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6104944/
https://www.ncbi.nlm.nih.gov/pubmed/30133477
http://dx.doi.org/10.1371/journal.pone.0201868

Ejemplares similares