Cover Image
QR Code

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...

Full description

Published in:Professional Geographer Vol. 77; no. 6; pp. 690 - 704
Main Authors: Kim, Wanhee, Kim, Hyun, Chun, Yongwan
Format: Article
Published: Taylor & Francis Ltd 2025
Subjects:
Heuristic
Traveling salesman problem
Combinatorial optimization
Routing systems
Mixed integer linear programming
Constraint programming
Route choice
Geospatial data
Online Access:View this record in EBSCOhost

Internet

View this record in EBSCOhost