Loading solver…

Routing - Simple Routing

Problem: find the shortest route for one vehicle to visit every location and return to the depot.

Show code

import {
  FirstSolutionStrategy,
  RoutingIndexManager,
  RoutingModel,
} from 'or-tools-wasm/routing';


const locations = [
  { x: 480, y: 310 },
  ...Array.from({ length: 20 }, () => ({
    x: 52 + Math.random() * 856,
    y: 52 + Math.random() * 516,
  })),
];

const manager = new RoutingIndexManager(locations.length, 1, 0);
const routing = new RoutingModel(manager);
const transit = routing.registerTransitCallback((from, to) => {
  const a = locations[manager.indexToNode(from)];
  const b = locations[manager.indexToNode(to)];
  return Math.round(Math.hypot(a.x - b.x, a.y - b.y));
});
routing.setArcCostEvaluatorOfAllVehicles(transit);

const result = await routing.solve({
  firstSolutionStrategy: FirstSolutionStrategy.PATH_CHEAPEST_ARC,
  executor: 'worker',
});
console.log(result.status, result.assignment?.objectiveValue());

One vehicle starts and ends at the depot.
Every customer location must be visited exactly once.
The travel cost is the straight-line distance between two locations.
Before solving, the map shows the locations without a chosen route.
After solving, the route line shows the visit order and return to the depot.

Executor Destinations

Route

Run the solver to view the route.

Status / Response: