A Spatially Informed Solving Approach for the Traveling Salesman Problem.

The traveling salesman problem (TSP) is a combinatorial optimization problem that seeks to determine the optimal route that minimizes the travel cost among a given set of nodes. Because solving the TSP inherently requires an exhaustive search, examining all possible routes to achieve the optimal sol...

Descripción completa

Detalles Bibliográficos

Publicado en:	Professional Geographer Vol. 77; no. 6; pp. 690 - 704
Autores principales:	Kim, Wanhee, Kim, Hyun, Chun, Yongwan
Formato:	Artículo
Publicado:	Taylor & Francis Ltd 2025
Materias:	Heuristic Traveling salesman problem Combinatorial optimization Routing systems Mixed integer linear programming Constraint programming Route choice Geospatial data
Acceso en línea:	Ver este registro en EBSCOhost