optimize

To solve the travelling salesman problem, that is, to build the best route for passing all the specified checkpoints and get the time of arrival at each of them, use the route/optimize command:

svc=route/optimize&params={
  "pathMatrix": [
    [<uint>, ...],
    ...
  ],
  "pointSchedules": [
    {
      "from": <uint>,
      "to": <uint>,
      "waitInterval": <uint>
    },
    ...
  ],
  "flags": <uint>
}

The pathMatrix parameter must always be a square matrix, where the size corresponds to the number of the specified points.

Example:

"pathMatrix": [[0, 1, 2], [3, 0, 4], [5, 6, 0]]

This input defines the movement time (in minutes) between three points. In other words, it shows how long it takes to travel from one point to another.

Let’s analyze each row of the matrix.

The first row [0, 1, 2] means:

• From point 1 to point 1: 0 minutes
• From point 1 to point 2: 1 minute
• From point 1 to point 3: 2 minutes

The second row [3, 0, 4] means:

• From point 2 to point 1: 3 minutes
• From point 2 to point 2: 0 minutes
• From point 2 to point 3: 4 minutes

The third row [5, 6, 0] means:

• From point 3 to point 1: 5 minutes
• From point 3 to point 2: 6 minutes
• From point 3 to point 3: 0 minutes

There is always a zero in each row because it represents the travel time from a point to itself.

Problem condition flags are represented as hexadecimal values.

If the request is completed successfully, the response is returned in the following format:

{
  "success": <bool>,  /* A value of 1 means the problem is solved and all conditions (defined by the flags) are met. A value of 0 means the problem is not solved, or solved with not all of the conditions being met. */
  "order": [
    {
      "tm": 0,          /* Arrival time in seconds. */
      "tmf": "<text>",  /* Formatted arrival time. Example: "hours:minutes". */
      "id": 0           /* Matrix point index, starting from 0. */
    },
    ...                /* Results for other points. */
  ]
}

If the request fails, an error code is returned.