@solvice/routing 0.18.2-beta.0 → 0.19.1-beta.0

package/dist/runs.d.ts

@@ -210,7 +210,7 @@ export interface components {
              * Format: int64
              * @description Trigger threshold in seconds (strict `>` — the break fires when the
              *     accumulator exceeds this). EU 561/2006 drive rule: `16200` (4 h 30).
-             *     Must be `> 0` and fit in 32 bits.
+             *     Must be `> 0` and at most 2,147,483,647.
              * @example 14400
              */
             threshold_s: number;
@@ -239,7 +239,7 @@ export interface components {
             /**
              * @description Not supported on V3: a windowed break is taken wherever the
              *     vehicle is when it starts, so a `location` here is rejected with
-             *     HTTP 400 `not_supported`. Set only by the V2 compatibility mapper.
+             *     HTTP 400 `not_supported`.
              */
             location?: null | components["schemas"]["Place"];
             /** @description The window bounding the break's **start**. */
@@ -330,7 +330,7 @@ export interface components {
              *     shifts only `per_route`. Default `0`. Use it to minimise distinct
              *     vehicles; use `per_route` to price each working day. Not accepted on
              *     `shifts[].costs`. When any vehicle has a non-zero rate and any vehicle
-             *     has several shifts, the problem solves without decomposition.
+             *     has several shifts, the request is solved as a whole rather than split into parts, which can make a large request slower.
              * @example 400
              */
             per_used_vehicle?: number | null;
@@ -375,7 +375,7 @@ export interface components {
              *     cannot see — typically the driver labour for the unload itself
              *     (`service_duration_s` × the hourly rate). Without it, a reload that
              *     consumes only *slack* is free in the objective: it adds no route
-             *     duration, so the solver will happily insert one to displace time that
+             *     duration, so the solver may insert one to displace time that
              *     `objective.costs.per_wait_hour` would otherwise charge as idle, parking
              *     the vehicle at a depot for no capacity benefit.
              * @example 38.66
@@ -467,8 +467,8 @@ export interface components {
          *     each other. The solver adds `per_entry` to the objective each time a
          *     route enters a group from a job outside it, the first entry included;
          *     entering from the shift's start or from a reload is free. Keeping each
-         *     group in one visit minimises the "passing-waypoint" / area re-entry count
-         *     last-mile fleets track. Presence of this object enables the feature; omit
+         *     group in one visit minimises how often a route comes back to an area it
+         *     already served. Presence of this object enables the feature; omit
          *     it to disable.
          * @example {
          *       "distance_metric": "straight_line",
@@ -542,7 +542,7 @@ export interface components {
              *     this prices the vehicle that did, so a task rated badly everywhere is
              *     the first one dropped when capacity runs out. It lives in the cost tier,
              *     below `priority`, and adds to `preferences`, `drop_cost` and travel.
-             *     Not applied by decomposition: a problem that sets it solves monolithically.
+             *     A request that sets it is solved as a whole rather than split into parts, which can make a large request slower.
              */
             assignment_costs?: components["schemas"]["AssignmentCost"][] | null;
             /**
@@ -705,10 +705,8 @@ export interface components {
          *     - `osm`: OpenStreetMap free-flow times. No traffic, so
          *       `travel.departure_time` is rejected with 400.
          *     - `tomtom_real_time`: TomTom live traffic at the moment of the request.
-         *       **Not yet enabled: currently always rejected with 403 `feature_not_enabled`.** Once enabled:
-         *       `travel.departure_time` is rejected; every vehicle must use the `car`
-         *       profile; at most 100 distinct locations; up to ~25 s of matrix fetch at
-         *       100 locations.
+         *       **Not available:** a request that sets it is rejected with 403
+         *       `feature_not_enabled`. Use `tomtom`.
          *     - `straight_line`: great-circle distance at `travel.speed_kmh`, no road
          *       network. `travel.departure_time`, `options.polyline` and any vehicle
          *       `profile` other than `car` are rejected with 400.
@@ -758,8 +756,8 @@ export interface components {
              *     rank, and a date with no shift adds none. Unserved tasks pay nothing;
              *     the charge never outranks `priority` and cannot be combined with
              *     `drop_cost`. Absent or `0` = off; a single-date request is charged
-             *     nothing. A problem that sets it, even on one date, solves without
-             *     decomposition, like `assignment_costs`. Reported as `score.components.delay`. A positive
+             *     nothing. Like `assignment_costs`, a request that sets it, even on one
+             *     date, is solved as a whole rather than split into parts. Reported as `score.components.delay`. A positive
              *     rate below `0.00001` is rejected, as is a rate whose total over the
              *     later workdays exceeds `21474.83647` (`out_of_range`).
              * @example 5
@@ -942,7 +940,9 @@ export interface components {
         };
         /**
          * PlanStopReload
-         * @description A reload at a depot: the next trip starts there.
+         * @description A reload at a depot: the next trip starts there. It sits between two
+         *     task stops, or first on a shift with a non-zero `initial_load`: the unload
+         *     before the first job.
          */
         PlanStopReload: {
             /**
@@ -1133,8 +1133,8 @@ export interface components {
         };
         /**
          * @description A hard constraint between tasks, selected by `type`: `sequence`,
-         *     `tag_order`, `same_vehicle`, `same_day`, `same_route`, `synchronized`,
-         *     `time_lag`, `compatible_vehicles` or `all_or_none`.
+         *     `consecutive`, `tag_order`, `same_vehicle`, `same_day`, `same_route`,
+         *     `synchronized`, `time_lag`, `compatible_vehicles` or `all_or_none`.
          *     Each type carries only its own fields; any other `type` is rejected with
          *     HTTP 400.
          *
@@ -1351,8 +1351,8 @@ export interface components {
             /**
              * Format: int64
              * @description Maximum spread between the synchronized instants in seconds
-             *     (`0` = exact simultaneity). Required. A negative value, or one that
-             *     does not fit in 32 bits, is rejected with HTTP 400 `out_of_range`.
+             *     (`0` = exact simultaneity). Required. A negative value, or one above
+             *     2,147,483,647, is rejected with HTTP 400 `out_of_range`.
              */
             max_spread_s: number;
             /**
@@ -1381,7 +1381,7 @@ export interface components {
          *
          *     Jobs only: if a tag named here selects a **shipment**, the request is
          *     rejected with HTTP 400 (a shipment's two legs already carry their own
-         *     hard precedence, which tag ordering cannot compose with yet). Drop the
+         *     hard precedence, which tag ordering does not combine with). Drop the
          *     tag from the shipment.
          */
         RelationTagOrder: {
@@ -1413,13 +1413,14 @@ export interface components {
             /**
              * Format: int64
              * @description Upper bound on `t(to) − t(from)` in seconds. Absent = unbounded.
-             *     Must fit in 32 bits and be `>= min_s` (HTTP 400 otherwise).
+             *     From −2,147,483,648 to 2,147,483,647 and `>= min_s` (HTTP 400
+             *     otherwise).
              */
             max_s?: number | null;
             /**
              * Format: int64
-             * @description Lower bound on `t(to) − t(from)` in seconds. Default `0`. Must fit
-             *     in 32 bits.
+             * @description Lower bound on `t(to) − t(from)` in seconds. Default `0`. From
+             *     −2,147,483,648 to 2,147,483,647.
              * @default 0
              */
             min_s?: number | null;
@@ -1768,7 +1769,7 @@ export interface components {
             load_after?: null | components["schemas"]["Quantities"];
             /**
              * @description Stop location `[longitude, latitude]` (GeoJSON order). Absent on
-             *     every `break` stop, including a break with a pinned location, and on
+             *     every `break` stop, and on
              *     `start`/`end` stops for a genuinely open end (no configured
              *     coordinate for that end of the shift). A virtual (location-less) job
              *     has no coordinate of its own and reports its nearest located
@@ -2272,8 +2273,8 @@ export interface components {
         ScoreComponents: {
             /**
              * Format: double
-             * @description Cost of the serving vehicle's `assignment_costs[].cost` (or the task's
-             *     default assignment cost), in currency units.
+             * @description Cost of the serving vehicle's `assignment_costs[].cost`, in currency
+             *     units.
              */
             assignment: number;
             /**
@@ -2365,7 +2366,7 @@ export interface components {
             /**
              * Format: double
              * @description The price of the time window each task was served in, in currency
-             *     units (`time_windows[].cost`).
+             *     units (`time_windows[].choice_cost`).
              */
             window_choice: number;
             /**
@@ -2437,9 +2438,9 @@ export interface components {
              *     no-op. It multiplies the vehicle's own rate (the shift's
              *     `service_factor` if set, else the vehicle's): effective service time =
              *     `service_duration_s / (shift_or_vehicle_factor * factor)`. Same
-             *     direction and `[0.001, 5]` range as `vehicles[].service_factor`. V2's
-             *     `proficiency.durationModifier` multiplied duration instead; the V2
-             *     compatibility layer sends its inverse (`1 / durationModifier`) here.
+             *     direction and `[0.001, 5]` range as `vehicles[].service_factor`.
+             *     Migrating from V2: `proficiency.durationModifier` multiplied duration
+             *     instead, so send `1 / durationModifier` here.
              * @example 1.25
              */
             factor: number;
@@ -2523,12 +2524,14 @@ export interface components {
              * @description Load already on the vehicle at shift start (pre-loaded), per
              *     dimension. Occupies capacity on the first trip only — flushed at the
              *     first reload — so it reduces first-trip room per dimension, enforced
-             *     by the per-trip capacity constraint. Not validated against
-             *     `capacity` at request time: a value at or beyond capacity is
-             *     accepted and surfaces as a solve-time result (jobs left unassigned,
-             *     or deferred until the vehicle's first reload flushes it), not an
-             *     HTTP 400. A dimension named here but absent from `capacity` behaves
-             *     the same as capacity `0` in that dimension.
+             *     by the per-trip capacity constraint. A value above the capacity in that
+             *     dimension is rejected with HTTP 400 (`out_of_range`). The capacity is
+             *     resolved per dimension: the shift's capacity when it defines the
+             *     dimension, otherwise the vehicle's. If the vehicle has a capacity map
+             *     that omits the dimension, the capacity is `0`; if the vehicle has no
+             *     capacity map and the shift does not define the dimension, it is
+             *     unlimited. At capacity, the vehicle has no room until it unloads, so
+             *     the solver may start the route with a reload at one of `reloads`.
              */
             initial_load?: null | components["schemas"]["Quantities"];
             /**
@@ -2604,6 +2607,19 @@ export interface components {
             skills?: components["schemas"]["VehicleSkill"][] | null;
             /** @description Where the shift starts. Absent = open start. */
             start?: null | components["schemas"]["ShiftPlace"];
+            /**
+             * @description When `true`, the shift starts at its first task: travel from `start`
+             *     to the first task takes no time, so the first arrival is `from`
+             *     plus the `start` handling, and waiting there counts from `from`.
+             *     That travel's distance is still charged at `per_travel_km` and reported, so
+             *     vehicles that start closer to their work stay cheaper; its time is not
+             *     charged and counts toward no duration, break or leg limit.
+             *     `free_start_travel` instead makes the travel free altogether. `true`
+             *     without `start`, or together with `free_start_travel`, is rejected with
+             *     HTTP 400 `conflicting_fields`. Default `false`.
+             * @example false
+             */
+            start_at_first_task?: boolean | null;
             /**
              * Format: date-time
              * @description Shift end (RFC 3339 instant, UTC offset required; hard unless `max_overtime_s` set). The
@@ -2757,7 +2773,7 @@ export interface components {
              *     this prices the vehicle that did, so a task rated badly everywhere is
              *     the first one dropped when capacity runs out. It lives in the cost tier,
              *     below `priority`, and adds to `preferences`, `drop_cost` and travel.
-             *     Not applied by decomposition: a problem that sets it solves monolithically.
+             *     A request that sets it is solved as a whole rather than split into parts, which can make a large request slower.
              */
             assignment_costs?: components["schemas"]["AssignmentCost"][] | null;
             /** @description Delivery leg (load off). */
@@ -3106,10 +3122,10 @@ export interface components {
             /**
              * @description How the best plan improved during the search, oldest first: the
              *     starting plan, every improvement (thinned to at most 500 entries), and
-             *     the final plan, which equals `summary.score` (it can equal, or after
-             *     the final repair be slightly worse than, the entry before it). Present on
-             *     every solve; absent on evaluate, which does not search. A large solve
-             *     the solver splits into clusters has the final entry alone.
+             *     the final plan, which equals `summary.score` (it can equal, or be
+             *     slightly worse than, the entry before it). Present on every solve;
+             *     absent on evaluate, which does not search. A large request that is
+             *     solved in parts has the final entry alone.
              */
             search_progress?: components["schemas"]["SearchProgressPoint"][] | null;
             /** @description Aggregate statistics for the solve run. */
@@ -3462,8 +3478,8 @@ export interface components {
             /**
              * Format: date-time
              * @description Latest allowed start of service (RFC 3339 instant, UTC offset
-             *     required), measured from arrival plus any windowed break taken first
-             *     (#1750 D1). Hard unless `per_late_hour` prices lateness.
+             *     required). Service starts after any windowed break taken on arrival.
+             *     Hard unless `per_late_hour` prices lateness.
              * @example 2026-07-01T12:00:00+02:00
              */
             to: string;
@@ -3567,7 +3583,7 @@ export interface components {
              * @description The constraint that refused the task on at least one vehicle (or
              *     `all_or_none`, for a task its group holds back), in the vocabulary of
              *     the evaluate violations' `code`. A task lists one reason
-             *     per constraint, once each, in [`ConstraintCode`] order. Absent on the
+             *     per constraint, once each, in the order the `code` values are listed. Absent on the
              *     single reason of a `time_limit` or `priced_out` task, which names no
              *     constraint.
              */
@@ -3609,7 +3625,9 @@ export interface components {
              *     vehicle, named in `constraint`, once each, `unreachable` first
              *     (`unknown` when no constraint was recorded); a task that fits but
              *     whose `all_or_none` group holds it back has the one reason
-             *     `all_or_none`. Otherwise there is one reason with no `constraint`.
+             *     `all_or_none`, and one whose all-or-none `synchronized`/`time_lag`
+             *     group cannot be placed together has `synchronized` and/or `time_lag`.
+             *     Otherwise there is one reason with no `constraint`.
              */
             reasons: components["schemas"]["UnassignedReason"][];
             /**
@@ -3624,7 +3642,7 @@ export interface components {
             task: string;
         };
         /**
-         * @description A vehicle type available to serve tasks.
+         * @description A vehicle available to serve tasks.
          * @example {
          *       "capacity": {
          *         "volume": 20,
@@ -3724,9 +3742,9 @@ export interface components {
              *     this vehicle multiplies whichever applies: effective service time =
              *     `service_duration_s / (shift_or_vehicle_factor * task_factor)`.
              *
-             *     V2's `durationModifier` went the other way (it MULTIPLIED duration,
-             *     `0.8` = 20% faster); the V2 compatibility layer inverts it and sends it
-             *     as the task's `service_factors[].factor = 1 / durationModifier`.
+             *     Migrating from V2: `durationModifier` went the other way (it multiplied
+             *     duration, `0.8` = 20% faster), so send `1 / durationModifier` as the
+             *     task's `service_factors[].factor`.
              * @default 1
              */
             service_factor?: number | null;
@@ -3812,7 +3830,7 @@ export interface components {
              *     `free_start_travel`/`free_end_travel`, or absent on an open start or
              *     end, is exempt. Absent = no cap. Must be > 0: `0` would make every
              *     leg too long rather than mean "no cap", so it is rejected with HTTP
-             *     400 `out_of_range`, as is a value that does not fit in 32 bits. A
+             *     400 `out_of_range`, as is a value above 2,147,483,647. A
              *     breach is reported as `max_leg_travel`.
              * @example 3600
              */
@@ -3869,7 +3887,7 @@ export interface components {
         /**
          * @description A capability a vehicle or shift provides, at a proficiency level:
          *     `{ "name": "gas", "level": 3 }`. Always an object; a bare string is
-         *     rejected at parse.
+         *     rejected with HTTP 400.
          * @example {
          *       "level": 3,
          *       "name": "gas"
@@ -3908,7 +3926,7 @@ export interface components {
              *     `period_limit` and `quota` are route-level; `sequence` and `shipment`
              *     are on the stop; `unreachable`, `max_leg_travel` and `capacity` can be
              *     either. `unknown`
-             *     means the insertion check refused a stop without naming a constraint
+             *     means a stop was refused without a specific constraint being named
              *     (not expected in practice).
              */
             code: components["schemas"]["ConstraintCode"];
@@ -3952,8 +3970,8 @@ export interface components {
          *     shift is charged on its own part. An empty, non-exempt shift pays for its whole share, so pair the
          *     term with `costs.per_route` or `per_used_vehicle` only when both are meant.
          *     See `vehicles[].workload_weight` to give a part-time vehicle a smaller
-         *     share. A problem that sets the term solves without decomposition, like
-         *     `assignment_costs`.
+         *     share. Like `assignment_costs`, a request that sets the term is solved as
+         *     a whole rather than split into parts.
          */
         WorkloadShare: {
             /**

package/dist/v3.d.ts

@@ -34,7 +34,7 @@ export interface paths {
         put?: never;
         /**
          * Solve a vehicle routing problem
-         * @description Assigns the jobs and shipments in `problem` to the vehicles' shifts and returns the routes, the `plan` they follow and any tasks left unassigned, each with the reasons. The request is validated first: an invalid one is rejected with a 400 whose `errors[]` says what to fix. Travel times and distances for the request's locations are then looked up, and the search runs for up to `options.time_limit_s` seconds (default 150 ms plus 4 ms per task; maximum 60). Send a previous result's `plan` to re-optimize starting from it. `POST /v3/routing/evaluate` and `POST /v3/routing/suggest` take the same `problem`.
+         * @description Assigns the jobs and shipments in `problem` to the vehicles' shifts and returns the routes, the `plan` they follow and any tasks left unassigned, each with the reasons. The request is validated first: an invalid one is rejected with a 400 whose `errors[]` says what to fix. Travel times and distances for the request's locations are then looked up, and the search runs for up to `options.time_limit_s` seconds (default 150 ms plus 4 ms per task; maximum 60). A problem of more than 400 tasks (jobs and shipments together) is a 400: submit one of up to 10,000 tasks to `POST /v3/routing/runs`, which takes the same body. Send a previous result's `plan` to re-optimize starting from it. `POST /v3/routing/evaluate` and `POST /v3/routing/suggest` take the same `problem`.
          */
         post: operations["solve"];
         delete?: never;
@@ -248,7 +248,7 @@ export interface components {
              * Format: int64
              * @description Trigger threshold in seconds (strict `>` — the break fires when the
              *     accumulator exceeds this). EU 561/2006 drive rule: `16200` (4 h 30).
-             *     Must be `> 0` and fit in 32 bits.
+             *     Must be `> 0` and at most 2,147,483,647.
              * @example 14400
              */
             threshold_s: number;
@@ -277,7 +277,7 @@ export interface components {
             /**
              * @description Not supported on V3: a windowed break is taken wherever the
              *     vehicle is when it starts, so a `location` here is rejected with
-             *     HTTP 400 `not_supported`. Set only by the V2 compatibility mapper.
+             *     HTTP 400 `not_supported`.
              */
             location?: null | components["schemas"]["Place"];
             /** @description The window bounding the break's **start**. */
@@ -368,7 +368,7 @@ export interface components {
              *     shifts only `per_route`. Default `0`. Use it to minimise distinct
              *     vehicles; use `per_route` to price each working day. Not accepted on
              *     `shifts[].costs`. When any vehicle has a non-zero rate and any vehicle
-             *     has several shifts, the problem solves without decomposition.
+             *     has several shifts, the request is solved as a whole rather than split into parts, which can make a large request slower.
              * @example 400
              */
             per_used_vehicle?: number | null;
@@ -413,7 +413,7 @@ export interface components {
              *     cannot see — typically the driver labour for the unload itself
              *     (`service_duration_s` × the hourly rate). Without it, a reload that
              *     consumes only *slack* is free in the objective: it adds no route
-             *     duration, so the solver will happily insert one to displace time that
+             *     duration, so the solver may insert one to displace time that
              *     `objective.costs.per_wait_hour` would otherwise charge as idle, parking
              *     the vehicle at a depot for no capacity benefit.
              * @example 38.66
@@ -564,8 +564,8 @@ export interface components {
          *     each other. The solver adds `per_entry` to the objective each time a
          *     route enters a group from a job outside it, the first entry included;
          *     entering from the shift's start or from a reload is free. Keeping each
-         *     group in one visit minimises the "passing-waypoint" / area re-entry count
-         *     last-mile fleets track. Presence of this object enables the feature; omit
+         *     group in one visit minimises how often a route comes back to an area it
+         *     already served. Presence of this object enables the feature; omit
          *     it to disable.
          * @example {
          *       "distance_metric": "straight_line",
@@ -728,7 +728,7 @@ export interface components {
              *     this prices the vehicle that did, so a task rated badly everywhere is
              *     the first one dropped when capacity runs out. It lives in the cost tier,
              *     below `priority`, and adds to `preferences`, `drop_cost` and travel.
-             *     Not applied by decomposition: a problem that sets it solves monolithically.
+             *     A request that sets it is solved as a whole rather than split into parts, which can make a large request slower.
              */
             assignment_costs?: components["schemas"]["AssignmentCost"][] | null;
             /**
@@ -891,10 +891,8 @@ export interface components {
          *     - `osm`: OpenStreetMap free-flow times. No traffic, so
          *       `travel.departure_time` is rejected with 400.
          *     - `tomtom_real_time`: TomTom live traffic at the moment of the request.
-         *       **Not yet enabled: currently always rejected with 403 `feature_not_enabled`.** Once enabled:
-         *       `travel.departure_time` is rejected; every vehicle must use the `car`
-         *       profile; at most 100 distinct locations; up to ~25 s of matrix fetch at
-         *       100 locations.
+         *       **Not available:** a request that sets it is rejected with 403
+         *       `feature_not_enabled`. Use `tomtom`.
          *     - `straight_line`: great-circle distance at `travel.speed_kmh`, no road
          *       network. `travel.departure_time`, `options.polyline` and any vehicle
          *       `profile` other than `car` are rejected with 400.
@@ -944,8 +942,8 @@ export interface components {
              *     rank, and a date with no shift adds none. Unserved tasks pay nothing;
              *     the charge never outranks `priority` and cannot be combined with
              *     `drop_cost`. Absent or `0` = off; a single-date request is charged
-             *     nothing. A problem that sets it, even on one date, solves without
-             *     decomposition, like `assignment_costs`. Reported as `score.components.delay`. A positive
+             *     nothing. Like `assignment_costs`, a request that sets it, even on one
+             *     date, is solved as a whole rather than split into parts. Reported as `score.components.delay`. A positive
              *     rate below `0.00001` is rejected, as is a rate whose total over the
              *     later workdays exceeds `21474.83647` (`out_of_range`).
              * @example 5
@@ -1169,7 +1167,9 @@ export interface components {
         };
         /**
          * PlanStopReload
-         * @description A reload at a depot: the next trip starts there.
+         * @description A reload at a depot: the next trip starts there. It sits between two
+         *     task stops, or first on a shift with a non-zero `initial_load`: the unload
+         *     before the first job.
          */
         PlanStopReload: {
             /**
@@ -1366,8 +1366,8 @@ export interface components {
         };
         /**
          * @description A hard constraint between tasks, selected by `type`: `sequence`,
-         *     `tag_order`, `same_vehicle`, `same_day`, `same_route`, `synchronized`,
-         *     `time_lag`, `compatible_vehicles` or `all_or_none`.
+         *     `consecutive`, `tag_order`, `same_vehicle`, `same_day`, `same_route`,
+         *     `synchronized`, `time_lag`, `compatible_vehicles` or `all_or_none`.
          *     Each type carries only its own fields; any other `type` is rejected with
          *     HTTP 400.
          *
@@ -1584,8 +1584,8 @@ export interface components {
             /**
              * Format: int64
              * @description Maximum spread between the synchronized instants in seconds
-             *     (`0` = exact simultaneity). Required. A negative value, or one that
-             *     does not fit in 32 bits, is rejected with HTTP 400 `out_of_range`.
+             *     (`0` = exact simultaneity). Required. A negative value, or one above
+             *     2,147,483,647, is rejected with HTTP 400 `out_of_range`.
              */
             max_spread_s: number;
             /**
@@ -1614,7 +1614,7 @@ export interface components {
          *
          *     Jobs only: if a tag named here selects a **shipment**, the request is
          *     rejected with HTTP 400 (a shipment's two legs already carry their own
-         *     hard precedence, which tag ordering cannot compose with yet). Drop the
+         *     hard precedence, which tag ordering does not combine with). Drop the
          *     tag from the shipment.
          */
         RelationTagOrder: {
@@ -1646,13 +1646,14 @@ export interface components {
             /**
              * Format: int64
              * @description Upper bound on `t(to) − t(from)` in seconds. Absent = unbounded.
-             *     Must fit in 32 bits and be `>= min_s` (HTTP 400 otherwise).
+             *     From −2,147,483,648 to 2,147,483,647 and `>= min_s` (HTTP 400
+             *     otherwise).
              */
             max_s?: number | null;
             /**
              * Format: int64
-             * @description Lower bound on `t(to) − t(from)` in seconds. Default `0`. Must fit
-             *     in 32 bits.
+             * @description Lower bound on `t(to) − t(from)` in seconds. Default `0`. From
+             *     −2,147,483,648 to 2,147,483,647.
              * @default 0
              */
             min_s?: number | null;
@@ -2001,7 +2002,7 @@ export interface components {
             load_after?: null | components["schemas"]["Quantities"];
             /**
              * @description Stop location `[longitude, latitude]` (GeoJSON order). Absent on
-             *     every `break` stop, including a break with a pinned location, and on
+             *     every `break` stop, and on
              *     `start`/`end` stops for a genuinely open end (no configured
              *     coordinate for that end of the shift). A virtual (location-less) job
              *     has no coordinate of its own and reports its nearest located
@@ -2173,8 +2174,8 @@ export interface components {
         ScoreComponents: {
             /**
              * Format: double
-             * @description Cost of the serving vehicle's `assignment_costs[].cost` (or the task's
-             *     default assignment cost), in currency units.
+             * @description Cost of the serving vehicle's `assignment_costs[].cost`, in currency
+             *     units.
              */
             assignment: number;
             /**
@@ -2266,7 +2267,7 @@ export interface components {
             /**
              * Format: double
              * @description The price of the time window each task was served in, in currency
-             *     units (`time_windows[].cost`).
+             *     units (`time_windows[].choice_cost`).
              */
             window_choice: number;
             /**
@@ -2338,9 +2339,9 @@ export interface components {
              *     no-op. It multiplies the vehicle's own rate (the shift's
              *     `service_factor` if set, else the vehicle's): effective service time =
              *     `service_duration_s / (shift_or_vehicle_factor * factor)`. Same
-             *     direction and `[0.001, 5]` range as `vehicles[].service_factor`. V2's
-             *     `proficiency.durationModifier` multiplied duration instead; the V2
-             *     compatibility layer sends its inverse (`1 / durationModifier`) here.
+             *     direction and `[0.001, 5]` range as `vehicles[].service_factor`.
+             *     Migrating from V2: `proficiency.durationModifier` multiplied duration
+             *     instead, so send `1 / durationModifier` here.
              * @example 1.25
              */
             factor: number;
@@ -2424,12 +2425,14 @@ export interface components {
              * @description Load already on the vehicle at shift start (pre-loaded), per
              *     dimension. Occupies capacity on the first trip only — flushed at the
              *     first reload — so it reduces first-trip room per dimension, enforced
-             *     by the per-trip capacity constraint. Not validated against
-             *     `capacity` at request time: a value at or beyond capacity is
-             *     accepted and surfaces as a solve-time result (jobs left unassigned,
-             *     or deferred until the vehicle's first reload flushes it), not an
-             *     HTTP 400. A dimension named here but absent from `capacity` behaves
-             *     the same as capacity `0` in that dimension.
+             *     by the per-trip capacity constraint. A value above the capacity in that
+             *     dimension is rejected with HTTP 400 (`out_of_range`). The capacity is
+             *     resolved per dimension: the shift's capacity when it defines the
+             *     dimension, otherwise the vehicle's. If the vehicle has a capacity map
+             *     that omits the dimension, the capacity is `0`; if the vehicle has no
+             *     capacity map and the shift does not define the dimension, it is
+             *     unlimited. At capacity, the vehicle has no room until it unloads, so
+             *     the solver may start the route with a reload at one of `reloads`.
              */
             initial_load?: null | components["schemas"]["Quantities"];
             /**
@@ -2505,6 +2508,19 @@ export interface components {
             skills?: components["schemas"]["VehicleSkill"][] | null;
             /** @description Where the shift starts. Absent = open start. */
             start?: null | components["schemas"]["ShiftPlace"];
+            /**
+             * @description When `true`, the shift starts at its first task: travel from `start`
+             *     to the first task takes no time, so the first arrival is `from`
+             *     plus the `start` handling, and waiting there counts from `from`.
+             *     That travel's distance is still charged at `per_travel_km` and reported, so
+             *     vehicles that start closer to their work stay cheaper; its time is not
+             *     charged and counts toward no duration, break or leg limit.
+             *     `free_start_travel` instead makes the travel free altogether. `true`
+             *     without `start`, or together with `free_start_travel`, is rejected with
+             *     HTTP 400 `conflicting_fields`. Default `false`.
+             * @example false
+             */
+            start_at_first_task?: boolean | null;
             /**
              * Format: date-time
              * @description Shift end (RFC 3339 instant, UTC offset required; hard unless `max_overtime_s` set). The
@@ -2671,7 +2687,7 @@ export interface components {
              *     this prices the vehicle that did, so a task rated badly everywhere is
              *     the first one dropped when capacity runs out. It lives in the cost tier,
              *     below `priority`, and adds to `preferences`, `drop_cost` and travel.
-             *     Not applied by decomposition: a problem that sets it solves monolithically.
+             *     A request that sets it is solved as a whole rather than split into parts, which can make a large request slower.
              */
             assignment_costs?: components["schemas"]["AssignmentCost"][] | null;
             /** @description Delivery leg (load off). */
@@ -3173,10 +3189,10 @@ export interface components {
             /**
              * @description How the best plan improved during the search, oldest first: the
              *     starting plan, every improvement (thinned to at most 500 entries), and
-             *     the final plan, which equals `summary.score` (it can equal, or after
-             *     the final repair be slightly worse than, the entry before it). Present on
-             *     every solve; absent on evaluate, which does not search. A large solve
-             *     the solver splits into clusters has the final entry alone.
+             *     the final plan, which equals `summary.score` (it can equal, or be
+             *     slightly worse than, the entry before it). Present on every solve;
+             *     absent on evaluate, which does not search. A large request that is
+             *     solved in parts has the final entry alone.
              */
             search_progress?: components["schemas"]["SearchProgressPoint"][] | null;
             /** @description Aggregate statistics for the solve run. */
@@ -3215,10 +3231,10 @@ export interface components {
              * @description Max ranked `insertions` in each `suggestions[]` entry, `1` to `10`;
              *     default 5. It caps the insertions per entry, not the number of
              *     entries: every task outside `plan` still gets its entry. Values outside
-             *     the range are a 400, never clamped. It also sets the search's beam
-             *     width, `max(8, 4 × max_insertions)`: for a unit of several stops, which
-             *     is never searched exhaustively, each stop after the unit's first keeps
-             *     at most that many partial placements. A single-stop task has every
+             *     the range are a 400, never clamped. It also sets how widely a unit of
+             *     several stops is searched (such a unit is never searched exhaustively):
+             *     each stop after the unit's first keeps at most
+             *     `max(8, 4 × max_insertions)` partial placements. A single-stop task has every
              *     feasible position considered unless `time_limit_s` runs out first.
              * @default 5
              * @example 5
@@ -3245,7 +3261,7 @@ export interface components {
          *     }
          */
         SuggestReason: {
-            /** @description Branch on this. Open set; see [`SuggestReasonCode`]. */
+            /** @description Branch on this. Open set: accept values you do not know. */
             code: components["schemas"]["SuggestReasonCode"];
             /**
              * @description `code` as an English sentence, for people and logs. Do not parse it.
@@ -3825,8 +3841,8 @@ export interface components {
             /**
              * Format: date-time
              * @description Latest allowed start of service (RFC 3339 instant, UTC offset
-             *     required), measured from arrival plus any windowed break taken first
-             *     (#1750 D1). Hard unless `per_late_hour` prices lateness.
+             *     required). Service starts after any windowed break taken on arrival.
+             *     Hard unless `per_late_hour` prices lateness.
              * @example 2026-07-01T12:00:00+02:00
              */
             to: string;
@@ -3930,7 +3946,7 @@ export interface components {
              * @description The constraint that refused the task on at least one vehicle (or
              *     `all_or_none`, for a task its group holds back), in the vocabulary of
              *     the evaluate violations' `code`. A task lists one reason
-             *     per constraint, once each, in [`ConstraintCode`] order. Absent on the
+             *     per constraint, once each, in the order the `code` values are listed. Absent on the
              *     single reason of a `time_limit` or `priced_out` task, which names no
              *     constraint.
              */
@@ -3972,7 +3988,9 @@ export interface components {
              *     vehicle, named in `constraint`, once each, `unreachable` first
              *     (`unknown` when no constraint was recorded); a task that fits but
              *     whose `all_or_none` group holds it back has the one reason
-             *     `all_or_none`. Otherwise there is one reason with no `constraint`.
+             *     `all_or_none`, and one whose all-or-none `synchronized`/`time_lag`
+             *     group cannot be placed together has `synchronized` and/or `time_lag`.
+             *     Otherwise there is one reason with no `constraint`.
              */
             reasons: components["schemas"]["UnassignedReason"][];
             /**
@@ -4001,7 +4019,7 @@ export interface components {
             warnings: components["schemas"]["RequestIssue"][];
         };
         /**
-         * @description A vehicle type available to serve tasks.
+         * @description A vehicle available to serve tasks.
          * @example {
          *       "capacity": {
          *         "volume": 20,
@@ -4101,9 +4119,9 @@ export interface components {
              *     this vehicle multiplies whichever applies: effective service time =
              *     `service_duration_s / (shift_or_vehicle_factor * task_factor)`.
              *
-             *     V2's `durationModifier` went the other way (it MULTIPLIED duration,
-             *     `0.8` = 20% faster); the V2 compatibility layer inverts it and sends it
-             *     as the task's `service_factors[].factor = 1 / durationModifier`.
+             *     Migrating from V2: `durationModifier` went the other way (it multiplied
+             *     duration, `0.8` = 20% faster), so send `1 / durationModifier` as the
+             *     task's `service_factors[].factor`.
              * @default 1
              */
             service_factor?: number | null;
@@ -4189,7 +4207,7 @@ export interface components {
              *     `free_start_travel`/`free_end_travel`, or absent on an open start or
              *     end, is exempt. Absent = no cap. Must be > 0: `0` would make every
              *     leg too long rather than mean "no cap", so it is rejected with HTTP
-             *     400 `out_of_range`, as is a value that does not fit in 32 bits. A
+             *     400 `out_of_range`, as is a value above 2,147,483,647. A
              *     breach is reported as `max_leg_travel`.
              * @example 3600
              */
@@ -4246,7 +4264,7 @@ export interface components {
         /**
          * @description A capability a vehicle or shift provides, at a proficiency level:
          *     `{ "name": "gas", "level": 3 }`. Always an object; a bare string is
-         *     rejected at parse.
+         *     rejected with HTTP 400.
          * @example {
          *       "level": 3,
          *       "name": "gas"
@@ -4285,7 +4303,7 @@ export interface components {
              *     `period_limit` and `quota` are route-level; `sequence` and `shipment`
              *     are on the stop; `unreachable`, `max_leg_travel` and `capacity` can be
              *     either. `unknown`
-             *     means the insertion check refused a stop without naming a constraint
+             *     means a stop was refused without a specific constraint being named
              *     (not expected in practice).
              */
             code: components["schemas"]["ConstraintCode"];
@@ -4329,8 +4347,8 @@ export interface components {
          *     shift is charged on its own part. An empty, non-exempt shift pays for its whole share, so pair the
          *     term with `costs.per_route` or `per_used_vehicle` only when both are meant.
          *     See `vehicles[].workload_weight` to give a part-time vehicle a smaller
-         *     share. A problem that sets the term solves without decomposition, like
-         *     `assignment_costs`.
+         *     share. Like `assignment_costs`, a request that sets the term is solved as
+         *     a whole rather than split into parts.
          */
         WorkloadShare: {
             /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@solvice/routing",
-  "version": "0.18.2-beta.0",
+  "version": "0.19.1-beta.0",
   "description": "TypeScript client for the Solvice V3 routing API, generated from its OpenAPI spec.",
   "license": "Apache-2.0",
   "homepage": "https://docs.solvice.io/guides/platform/sdks/typescript",