neshan_tsp
Optimizes the visiting order of multiple destinations using the Traveling Salesman Problem algorithm to minimize route distance. Supports round trips and flexible start/end points.
Instructions
Find the optimal visiting order for multiple destinations (TSP).
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"waypoints": "<waypoints>"
},
"name": "neshan_tsp"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| waypoints | Yes | Stops as [[lat, lng], ...] (first item is the start). | |
| round_trip | No | If True, the route returns to the start point. | |
| last_is_any_point | No | Let the optimizer choose any stop as the end. | |
| source_is_any_point | No | Let the optimizer choose any stop as start. |