[{"data":1,"prerenderedAt":66},["ShallowReactive",2],{"docs-\u002Fdocs\u002Frouting-platform\u002Foptimized-route":3,"_apollo:default":62,"_apollo:stationEditor":63,"_apollo:feedManagement":64,"_apollo:transferAnalyst":65},{"id":4,"title":5,"body":6,"description":15,"extension":55,"meta":56,"navigation":57,"path":58,"seo":59,"stem":60,"__hash__":61},"content\u002Fdocs\u002Frouting-platform\u002Foptimized-route.md","Optimized route",{"type":7,"value":8,"toc":52},"minimark",[9,16,26,31,39],[10,11,12],"div",{},[13,14],"account-tiers",{"beta":15},"",[17,18,19,20,25],"p",{},"Plan a route visiting several locations in the most efficient order, solving the traveling salesman problem. The request is the same as ",[21,22,24],"a",{"href":23},"\u002Fdocumentation\u002Frouting-platform\u002Froute\u002F","street routing","; the service chooses the order of the locations.",[27,28],"openapi-endpoint",{"doc":29,"path":30},"routing","\u002Fvalhalla\u002Foptimized_route",[17,32,33,34,38],{},"See the ",[21,35,37],{"href":36},"\u002Fdocumentation\u002Frouting-platform\u002F","Routing Platform overview"," for API access, travel modes, and the machine-readable schema.",[17,40,41,45,46],{},[42,43,44],"strong",{},"Reference:"," ",[21,47,51],{"href":48,"rel":49},"https:\u002F\u002Fvalhalla.github.io\u002Fvalhalla\u002Fapi\u002Foptimized\u002Fapi-reference\u002F",[50],"nofollow","Valhalla optimized route API reference",{"title":15,"searchDepth":53,"depth":53,"links":54},2,[],"md",{},true,"\u002Fdocs\u002Frouting-platform\u002Foptimized-route",{"title":5,"description":15},"docs\u002Frouting-platform\u002Foptimized-route","2C1J7HFUawWQ3xKWj0GLjRVRl0WdYbQxOx_xgQpNmdI",{},{},{},{},1790811156717]