Skip to main content
Glama
GRABOSM

OpenStreetMap MCP Server

by GRABOSM

optimize_route

Calculate optimal travel routes through multiple locations using the Traveling Salesman Problem algorithm. Supports driving, walking, and cycling profiles with turn-by-turn instructions.

Instructions

Solve Traveling Salesman Problem to find optimal route through all points

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
coordinatesYesArray of [longitude, latitude] coordinates to visit
profileNoRouting profile (default: driving)
roundtripNoReturn to starting point (default: false)
sourceNoSource coordinate constraint
destinationNoDestination coordinate constraint
stepsNoInclude turn-by-turn instructions (default: true)

Latest Blog Posts

MCP directory API

We provide all the information about MCP servers via our MCP API.

curl -X GET 'https://glama.ai/api/mcp/v1/servers/GRABOSM/osm-mcp'

If you have feedback or need assistance with the MCP directory API, please join our Discord server