Cargando…
Sense of direction and conscientiousness as predictors of performance in the Euclidean travelling salesman problem
A salesperson wishes to visit a number of cities before returning home using the shortest possible route, whilst only visiting each city once. This optimization problem, called the Travelling Salesman Problem, is difficult to solve using exhaustive algorithms due to the exponential growth in the num...
Autores principales: | Kyritsis, Markos, Blathras, George, Gulliver, Stephen, Varela, Vasiliki-Alexia |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5727545/ https://www.ncbi.nlm.nih.gov/pubmed/29264418 http://dx.doi.org/10.1016/j.heliyon.2017.e00461 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
The traveling salesman problem and its variations
por: Gutin, Gregory, et al.
Publicado: (2007) -
The multi-stripe travelling salesman problem
por: Çela, Eranda, et al.
Publicado: (2017) -
The traveling salesman problem: a computational study
por: Applegate, David L, et al.
Publicado: (2006) -
A closer look at the travelling salesman problem
por: Østergaard, Christina V
Publicado: (2020)