solve_traveling_salesman_problem
Calculate the shortest route for visiting all given locations with the Traveling Salesman Problem solver. Input locations, optional distance matrix, and time limits to optimize route planning efficiently.
Instructions
Solve Traveling Salesman Problem (TSP) to find the shortest route visiting all locations.
Input Schema
Name | Required | Description | Default |
---|---|---|---|
distance_matrix | No | ||
locations | Yes | ||
return_to_start | No | ||
start_location | No | ||
time_limit_seconds | No |