tsp_solve
Computes a short round-trip route visiting every given city and returning to the starting point using a nearest-neighbor heuristic.
Instructions
Find a short tour visiting all cities and returning to start (traveling salesman, nearest-neighbor heuristic).
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": {
"cities": "<cities>"
},
"name": "tsp_solve"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| cities | Yes | Array of {name, x, y} city locations |