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

package/dist/runs.d.ts

@@ -258,7 +258,7 @@ export interface components {
          *     New values may be added; clients must accept unknown values and handle
          *     them generically, for example by showing `message`.
          *
-         *     Known values: `unreachable`, `max_leg_travel`, `required_skills`, `serves_tags`, `capacity`, `time_window`, `eligible_vehicles`, `shift_end`, `max_distance`, `max_route_duration`, `max_stops`, `sequence`, `tag_order`, `shipment`, `break`, `multi_trip`, `same_vehicle`, `same_day`, `same_route`, `compatible_vehicles`, `synchronized`, `time_lag`, `all_or_none`, `period_limit`, `quota`, `unknown`. An open set: a later release may add values, so accept any string and handle the ones you know.
+         *     Known values: `unreachable`, `max_leg_travel`, `required_skills`, `serves_tags`, `capacity`, `time_window`, `eligible_vehicles`, `shift_end`, `max_distance`, `max_route_duration`, `max_stops`, `sequence`, `tag_order`, `shipment`, `break`, `multi_trip`, `unload_before_end`, `same_vehicle`, `same_day`, `same_route`, `compatible_vehicles`, `synchronized`, `time_lag`, `all_or_none`, `period_limit`, `quota`, `max_intake`, `unknown`. An open set: a later release may add values, so accept any string and handle the ones you know.
          * @example capacity
          */
         ConstraintCode: string;
@@ -365,6 +365,24 @@ export interface components {
             id: string;
             /** @description Where the depot is. */
             location: components["schemas"]["Place"];
+            /**
+             * @description The most load the depot may receive across the whole request, per
+             *     named dimension: a tip site's intake limit. Not per day: it sums every
+             *     shift of every day.
+             *
+             *     Counted is the load on board on arrival at each reload here (including
+             *     a shift's `initial_load` on its first trip and the final tip of
+             *     `unload_before_end`), plus the load on board at the end of a shift
+             *     whose `end` is this depot (not with `unload_before_end`, which unloads
+             *     at a reload first). A shift's start never counts, and an unused shift
+             *     receives nothing. A dimension left out is uncapped; `0` means the
+             *     depot takes none of it. A hard limit: a task that would overfill every
+             *     depot its trip can tip at stays unassigned (reason `max_intake`).
+             *
+             *     Each dimension must be one a task or vehicle declares, and some shift
+             *     must reload here, or end here without `unload_before_end`.
+             */
+            max_intake?: null | components["schemas"]["Quantities"];
             /**
              * Format: double
              * @description Money charged once per reload visit, in the objective's currency.
@@ -628,10 +646,10 @@ export interface components {
              */
             preferences?: components["schemas"]["VehiclePreference"][] | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Importance of a must-serve task when not all of them fit: the solver
-             *     maximises the summed `priority` of served tasks before any cost. `>= 1`,
-             *     default `1` (maximise the count). A rank, not money — it never makes a
+             *     maximises the summed `priority` of served tasks before any cost. `1` to
+             *     `4294967295`, default `1` (maximise the count). A rank, not money — it never makes a
              *     task droppable; use `drop_cost` for that. Both set is a 400.
              * @example 3
              */
@@ -690,7 +708,10 @@ export interface components {
             tags?: string[] | null;
             /**
              * @description Soft target for this task, measured at its arrival (default) or
-             *     departure. On a shipment it is measured on the **delivery** leg.
+             *     departure. On a shipment it is measured on the **delivery** leg and
+             *     cannot be combined with `delivery.target` (HTTP 400
+             *     `conflicting_fields`); `pickup.target` adds a separate target on the
+             *     pickup leg.
              */
             target?: null | components["schemas"]["Target"];
             /** @description Time windows for this visit. */
@@ -819,7 +840,7 @@ export interface components {
              */
             max_route_duration_s?: number | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Hard cap on served stops across the period's shifts; a job counts as
              *     one stop. Start, end, break and reload stops in `routes[].stops` do not
              *     count; a shipment counts as two stops.
@@ -865,7 +886,7 @@ export interface components {
          */
         PlanRoute: {
             /**
-             * Format: int32
+             * Format: uint32
              * @description On solve, the first `locked_count` stops stay where they are (already
              *     dispatched). Counts every listed stop. Cannot be combined with a
              *     `reload` stop, and must not exceed the route's stop count — both are
@@ -1108,7 +1129,7 @@ export interface components {
              */
             id: string;
             /**
-             * Format: int32
+             * Format: uint32
              * @description The cap on counted stops; a job counts as one stop.
              *     Start, end, break and reload stops in `routes[].stops` do not count; a
              *     shipment counts as two stops.
@@ -1152,8 +1173,10 @@ export interface components {
          *     its pickup. A shipment's own id in `stops`, or a shipment carrying the
          *     `tag` of a `same_vehicle` or `same_day` relation, is rejected with HTTP 400
          *     `not_supported`: relations never silently skip a member. `same_route`,
-         *     `time_lag`, `compatible_vehicles`, `all_or_none` and `tag_order` reject a
-         *     shipment with HTTP 400 as well.
+         *     `time_lag`, `compatible_vehicles` and `tag_order` reject a shipment with
+         *     HTTP 400 as well. `all_or_none` alone takes a shipment's own id, naming both
+         *     legs, in a group that is exactly one `consecutive` chain; such a chain may
+         *     also be jobs only.
          * @example {
          *       "stops": [
          *         "job-1",
@@ -1166,20 +1189,25 @@ export interface components {
         /**
          * All or none
          * @description All or none: either every member in `stops` is served, or none is.
-         *     Sets no timing; combine with `synchronized` or `time_lag` for when.
-         *     Hard. Overlapping `all_or_none` relations chain: one on A and B plus
+         *     Sets no timing; a coupled group takes its timing from the
+         *     `synchronized` or `time_lag` relation that names its members. Hard.
+         *     Overlapping `all_or_none` relations chain: one on A and B plus
          *     one on B and C serve all three together or none of them. A group with
          *     a task in a vehicle's locked prefix (`plan.routes[].locked_count`) is
          *     exempt. A member that could be served but is held back because
          *     another cannot reports `all_or_none` in `unassigned[].reasons`.
          *
-         *     Every task must also be named by a `synchronized` or `time_lag`
-         *     relation; a task named by neither is rejected with HTTP 400.
+         *     A member may be a shipment id (both legs). Members are coupled by
+         *     `synchronized`/`time_lag`, or the group's stops (a shipment as its two
+         *     legs) are exactly one `consecutive` chain with no member coupled by
+         *     `synchronized` or `time_lag`, directly or through a `sequence` or
+         *     `consecutive` relation. A task named by neither is rejected with HTTP 400, as is a
+         *     shipment-leg id: name the shipment.
          */
         RelationAllOrNone: {
             /**
-             * @description Job ids, at least two. A shipment's own id or a shipment-leg stop id
-             *     is rejected with HTTP 400.
+             * @description Job ids or shipment ids, at least two. A shipment-leg stop id is
+             *     rejected with HTTP 400.
              * @example [
              *       "job-1",
              *       "job-2"
@@ -1227,6 +1255,7 @@ export interface components {
          *     route. A member that is unassigned is skipped, so only listed
          *     neighbours that are both served are adjacent. Members on different
          *     routes are unconstrained; add `same_route` to keep them together.
+         *     Put a chain in an `all_or_none` to serve it whole or not at all.
          */
         RelationConsecutive: {
             /**
@@ -1483,14 +1512,14 @@ export interface components {
         /** @description One problem in a request. */
         RequestIssue: {
             /**
-             * Format: int64
+             * Format: uint64
              * @description `limit_exceeded` only: the count this request has.
              */
             actual?: number | null;
             /** @description What is wrong. */
             code: components["schemas"]["ErrorItemCode"];
             /**
-             * Format: int64
+             * Format: uint64
              * @description `limit_exceeded` only: the published cap.
              */
             limit?: number | null;
@@ -1819,9 +1848,9 @@ export interface components {
              * @description Seconds past this task's `target.at`, measured at the stop's arrival
              *     (plus any `windowed` break taken on arrival there, idle before it
              *     included) or departure per `target.on`; `0` when met. Present only on a task
-             *     stop carrying a target. A shipment's target is measured on its
-             *     delivery leg, so it appears on the `:delivery` stop and never on the
-             *     `:pickup` stop.
+             *     stop carrying a target. A shipment's own `target` is measured on its
+             *     delivery leg, so it appears on the `:delivery` stop; a `pickup.target`
+             *     or `delivery.target` appears on that leg's stop.
              * @example 0
              */
             target_lateness_s?: number | null;
@@ -1977,7 +2006,7 @@ export interface components {
              */
             polyline?: null | components["schemas"]["PolylineDetail"];
             /**
-             * Format: int64
+             * Format: uint64
              * @description Random seed for the search. Default `42`: omitting it is the same as
              *     sending `42`, so send different values to explore different plans.
              *     Repeated runs on one machine usually return an identical plan; a
@@ -2239,7 +2268,7 @@ export interface components {
              */
             unassigned_priority: number;
             /**
-             * Format: int32
+             * Format: uint32
              * @description How many hard-constraint violations the plan has (the `violations`
              *     arrays on routes and stops list them). Always `0` on a solve result.
              * @example 0
@@ -2379,7 +2408,7 @@ export interface components {
         /** @description How the search behind a plan ended. */
         SearchInfo: {
             /**
-             * Format: int64
+             * Format: uint64
              * @description Search iterations performed. `0` when nothing was searched.
              * @example 48210
              */
@@ -2405,7 +2434,7 @@ export interface components {
              */
             cost: number;
             /**
-             * Format: int64
+             * Format: uint64
              * @description Milliseconds since the search started (the clock of
              *     `summary.timings.search_ms`).
              */
@@ -2550,10 +2579,11 @@ export interface components {
             /**
              * Format: int32
              * @description Maximum trips (depot legs) in this shift, across all reload depots.
-             *     Counts trips, not reloads: `trips = reloads_used + 1`. `max_trips: 1`
-             *     means a single trip — reloads are permitted in `reloads` but the cap
-             *     prevents ever using one. `reloads` present with `max_trips` absent
-             *     means unlimited trips. A single reload depot can only be
+             *     Counts trips, not reloads: `trips = reloads_used + 1`, where the final
+             *     unload of `unload_before_end` is not counted. `max_trips: 1` means a
+             *     single trip — reloads are permitted in `reloads` but the cap prevents
+             *     ever using one, other than that final unload. `reloads` present with
+             *     `max_trips` absent means unlimited trips. A single reload depot can only be
              *     revisited up to 8 times per shift regardless of `max_trips`;
              *     a `max_trips` beyond that against one depot
              *     is accepted but the extra headroom is unreachable — list more than
@@ -2627,6 +2657,16 @@ export interface components {
              * @example 2026-07-01T17:00:00+02:00
              */
             to: string;
+            /**
+             * @description When `true`, a route that would end with load on board first unloads
+             *     at one of this shift's `reloads` depots: a final `reload` stop, at the
+             *     depot the solver finds cheapest, taking that depot's
+             *     `service_duration_s` and `per_reload`. It does not count toward
+             *     `max_trips`. A route whose last trip carries no load ends without one.
+             *     `true` without `reloads` is rejected with HTTP 400
+             *     `conflicting_fields`. Default `false`.
+             */
+            unload_before_end?: boolean | null;
         };
         /**
          * @description The `Costs` fields for one shift, minus `per_used_vehicle`. A shift is one
@@ -2696,7 +2736,7 @@ export interface components {
              */
             max_route_duration_s?: number | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Maximum stops served in this shift; a job counts as one stop.
              *     Start, end, break and reload stops in `routes[].stops` do not count; a
              *     shipment counts as two stops.
@@ -2825,10 +2865,10 @@ export interface components {
              */
             preferences?: components["schemas"]["VehiclePreference"][] | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Importance of a must-serve task when not all of them fit: the solver
-             *     maximises the summed `priority` of served tasks before any cost. `>= 1`,
-             *     default `1` (maximise the count). A rank, not money — it never makes a
+             *     maximises the summed `priority` of served tasks before any cost. `1` to
+             *     `4294967295`, default `1` (maximise the count). A rank, not money — it never makes a
              *     task droppable; use `drop_cost` for that. Both set is a 400.
              * @example 3
              */
@@ -2862,7 +2902,10 @@ export interface components {
             tags?: string[] | null;
             /**
              * @description Soft target for this task, measured at its arrival (default) or
-             *     departure. On a shipment it is measured on the **delivery** leg.
+             *     departure. On a shipment it is measured on the **delivery** leg and
+             *     cannot be combined with `delivery.target` (HTTP 400
+             *     `conflicting_fields`); `pickup.target` adds a separate target on the
+             *     pickup leg.
              */
             target?: null | components["schemas"]["Target"];
         };
@@ -2920,6 +2963,14 @@ export interface components {
              * @example 60
              */
             setup_duration_s?: number | null;
+            /**
+             * @description Soft target for this leg, measured at its arrival (default) or
+             *     departure. Same type, units and validation as the task-level
+             *     `target`. The shipment's own `target` is measured on the delivery
+             *     leg, so sending it with `delivery.target` is rejected with HTTP 400
+             *     (`conflicting_fields`).
+             */
+            target?: null | components["schemas"]["Target"];
             /** @description Time windows for this stop. */
             time_windows?: components["schemas"]["TimeWindow"][] | null;
         };
@@ -3221,7 +3272,7 @@ export interface components {
             /** @description How the search ended. */
             search: components["schemas"]["SearchInfo"];
             /**
-             * Format: int32
+             * Format: uint32
              * @description Routes with at least one task stop: one per used shift.
              * @example 1
              */
@@ -3245,7 +3296,7 @@ export interface components {
              */
             travel_estimated?: boolean;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Distinct vehicles with at least one route.
              * @example 1
              */
@@ -3324,17 +3375,17 @@ export interface components {
          */
         TaskCounts: {
             /**
-             * Format: int32
+             * Format: uint32
              * @description Tasks on a route.
              */
             served: number;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Tasks on no route: the length of `unassigned`.
              */
             unassigned: number;
             /**
-             * Format: int32
+             * Format: uint32
              * @description The unassigned tasks that carry no `drop_cost`: tasks the plan was
              *     required to serve and did not.
              */
@@ -3493,13 +3544,13 @@ export interface components {
          */
         Timings: {
             /**
-             * Format: int64
+             * Format: uint64
              * @description Time spent in the search. Absent on `/evaluate`, which runs none, and
              *     on `/suggest`, which has no separate search figure.
              */
             search_ms?: number | null;
             /**
-             * Format: int64
+             * Format: uint64
              * @description From the request's arrival to the end of the search (of the scoring,
              *     on `/evaluate`; of the suggestion search, on `/suggest`): fetching
              *     travel times and waiting for capacity included, building the response
@@ -3846,7 +3897,7 @@ export interface components {
              */
             max_route_duration_s?: number | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Maximum stops served per shift; a job counts as one stop.
              *     Start, end, break and reload stops in `routes[].stops` do not count; a
              *     shipment counts as two stops.
@@ -3931,15 +3982,16 @@ export interface components {
              */
             code: components["schemas"]["ConstraintCode"];
             /**
-             * @description The capacity dimension over its limit. Only on `capacity`.
+             * @description The capacity dimension over its limit. Only on `capacity`,
+             *     `unload_before_end` and `max_intake`.
              * @example weight
              */
             dimension?: string | null;
             /**
              * Format: int64
              * @description How far over the limit, in `unit`. On `capacity`, `time_window` (the
-             *     seconds late), `shift_end`, `max_distance`, `max_route_duration` and
-             *     `quota`.
+             *     seconds late), `shift_end`, `max_distance`, `max_route_duration`,
+             *     `quota`, `unload_before_end` and `max_intake`.
              * @example 15
              */
             excess?: number | null;

package/dist/v3.d.ts

@@ -54,7 +54,7 @@ export interface paths {
         put?: never;
         /**
          * Suggest best insertions for the tasks outside the plan
-         * @description Takes the same body as `POST /v3/routing/evaluate` (`problem` + committed `plan`), plus optional `options`. Every task of `problem` that is not in `plan` is a task to place: finds its feasible insertion positions and returns them as `insertions`, ranked by `delta.cost`, the change in the plan's cost in money. Each insertion lists the stops it adds (`placements`) and every plan route it changes, whole (`routes`): swap those routes into `plan` to apply it. An empty `insertions` carries a `reason` whose `code` is `time_limit`, `candidates_exhausted` or `infeasible` (an open set) and whose `message` says the same in English. The committed plan is never modified. Limitation: suggest never opens a new reload trip on a multi-trip vehicle.
+         * @description Takes the same body as `POST /v3/routing/evaluate` (`problem` + committed `plan`), plus optional `options`. Every task of `problem` that is not in `plan` is a task to place: finds its feasible insertion positions and returns them as `insertions`, ranked by `delta.cost`, the change in the plan's cost in money. The members of a `synchronized` or `time_lag` group outside `plan` are one task to place: each insertion places every member, and with the default `on: service_start` a crew's members start within `max_spread_s` of one another (`service_start`); a `time_lag` keeps its lag. Each insertion lists the stops it adds (`placements`) and every plan route it changes, whole (`routes`): swap those routes into `plan` to apply it. An empty `insertions` carries a `reason` whose `code` is `time_limit`, `candidates_exhausted` or `infeasible` (an open set) and whose `message` says the same in English. The committed plan is never modified. Limitation: suggest never opens a new reload trip on a multi-trip vehicle.
          */
         post: operations["suggest"];
         delete?: never;
@@ -296,7 +296,7 @@ export interface components {
          *     New values may be added; clients must accept unknown values and handle
          *     them generically, for example by showing `message`.
          *
-         *     Known values: `unreachable`, `max_leg_travel`, `required_skills`, `serves_tags`, `capacity`, `time_window`, `eligible_vehicles`, `shift_end`, `max_distance`, `max_route_duration`, `max_stops`, `sequence`, `tag_order`, `shipment`, `break`, `multi_trip`, `same_vehicle`, `same_day`, `same_route`, `compatible_vehicles`, `synchronized`, `time_lag`, `all_or_none`, `period_limit`, `quota`, `unknown`. An open set: a later release may add values, so accept any string and handle the ones you know.
+         *     Known values: `unreachable`, `max_leg_travel`, `required_skills`, `serves_tags`, `capacity`, `time_window`, `eligible_vehicles`, `shift_end`, `max_distance`, `max_route_duration`, `max_stops`, `sequence`, `tag_order`, `shipment`, `break`, `multi_trip`, `unload_before_end`, `same_vehicle`, `same_day`, `same_route`, `compatible_vehicles`, `synchronized`, `time_lag`, `all_or_none`, `period_limit`, `quota`, `max_intake`, `unknown`. An open set: a later release may add values, so accept any string and handle the ones you know.
          * @example capacity
          */
         ConstraintCode: string;
@@ -403,6 +403,24 @@ export interface components {
             id: string;
             /** @description Where the depot is. */
             location: components["schemas"]["Place"];
+            /**
+             * @description The most load the depot may receive across the whole request, per
+             *     named dimension: a tip site's intake limit. Not per day: it sums every
+             *     shift of every day.
+             *
+             *     Counted is the load on board on arrival at each reload here (including
+             *     a shift's `initial_load` on its first trip and the final tip of
+             *     `unload_before_end`), plus the load on board at the end of a shift
+             *     whose `end` is this depot (not with `unload_before_end`, which unloads
+             *     at a reload first). A shift's start never counts, and an unused shift
+             *     receives nothing. A dimension left out is uncapped; `0` means the
+             *     depot takes none of it. A hard limit: a task that would overfill every
+             *     depot its trip can tip at stays unassigned (reason `max_intake`).
+             *
+             *     Each dimension must be one a task or vehicle declares, and some shift
+             *     must reload here, or end here without `unload_before_end`.
+             */
+            max_intake?: null | components["schemas"]["Quantities"];
             /**
              * Format: double
              * @description Money charged once per reload visit, in the objective's currency.
@@ -650,6 +668,7 @@ export interface components {
          *           "arrival": "2026-07-01T09:30:00+02:00",
          *           "id": "job-2",
          *           "latest_arrival": "2026-07-01T10:15:00+02:00",
+         *           "service_start": "2026-07-01T09:30:00+02:00",
          *           "shift": "mon",
          *           "type": "job",
          *           "vehicle": "v1"
@@ -814,10 +833,10 @@ export interface components {
              */
             preferences?: components["schemas"]["VehiclePreference"][] | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Importance of a must-serve task when not all of them fit: the solver
-             *     maximises the summed `priority` of served tasks before any cost. `>= 1`,
-             *     default `1` (maximise the count). A rank, not money — it never makes a
+             *     maximises the summed `priority` of served tasks before any cost. `1` to
+             *     `4294967295`, default `1` (maximise the count). A rank, not money — it never makes a
              *     task droppable; use `drop_cost` for that. Both set is a 400.
              * @example 3
              */
@@ -876,7 +895,10 @@ export interface components {
             tags?: string[] | null;
             /**
              * @description Soft target for this task, measured at its arrival (default) or
-             *     departure. On a shipment it is measured on the **delivery** leg.
+             *     departure. On a shipment it is measured on the **delivery** leg and
+             *     cannot be combined with `delivery.target` (HTTP 400
+             *     `conflicting_fields`); `pickup.target` adds a separate target on the
+             *     pickup leg.
              */
             target?: null | components["schemas"]["Target"];
             /** @description Time windows for this visit. */
@@ -1005,7 +1027,7 @@ export interface components {
              */
             max_route_duration_s?: number | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Hard cap on served stops across the period's shifts; a job counts as
              *     one stop. Start, end, break and reload stops in `routes[].stops` do not
              *     count; a shipment counts as two stops.
@@ -1034,6 +1056,7 @@ export interface components {
          *       "arrival": "2026-07-01T09:30:00+02:00",
          *       "id": "s1:pickup",
          *       "latest_arrival": "2026-07-01T10:15:00+02:00",
+         *       "service_start": "2026-07-01T09:30:00+02:00",
          *       "shift": "mon",
          *       "type": "pickup",
          *       "vehicle": "v1"
@@ -1054,10 +1077,23 @@ export interface components {
              * @description Latest arrival that still keeps the rest of the route feasible
              *     (RFC 3339, in the offset of `arrival`) — the smaller of the task's own time-window latest and
              *     the route's forward slack here. Under priced lateness it may be
-             *     **earlier** than `arrival`.
+             *     **earlier** than `arrival`. For a `synchronized` or `time_lag` member it
+             *     is at most `arrival` plus the wait before `service_start`: arriving
+             *     later would move the start its partners are booked to meet.
              * @example 2026-07-01T10:15:00+02:00
              */
             latest_arrival: string;
+            /**
+             * Format: date-time
+             * @description Service start (RFC 3339, in the offset of `arrival`): `arrival` plus
+             *     any wait for the time window or a break, and for a `synchronized` or
+             *     `time_lag` member the hold for its partners, as `service_start` on the
+             *     route stop. With the default `on: service_start`, the members of a
+             *     crew start here within the relation's `max_spread_s`: the booking time
+             *     (`on: departure` aligns their ends instead; a `time_lag` keeps its lag).
+             * @example 2026-07-01T09:30:00+02:00
+             */
+            service_start: string;
             /** @description Shift of that plan route. */
             shift: string;
             /**
@@ -1092,7 +1128,7 @@ export interface components {
          */
         PlanRoute: {
             /**
-             * Format: int32
+             * Format: uint32
              * @description On solve, the first `locked_count` stops stay where they are (already
              *     dispatched). Counts every listed stop. Cannot be combined with a
              *     `reload` stop, and must not exceed the route's stop count — both are
@@ -1341,7 +1377,7 @@ export interface components {
              */
             id: string;
             /**
-             * Format: int32
+             * Format: uint32
              * @description The cap on counted stops; a job counts as one stop.
              *     Start, end, break and reload stops in `routes[].stops` do not count; a
              *     shipment counts as two stops.
@@ -1385,8 +1421,10 @@ export interface components {
          *     its pickup. A shipment's own id in `stops`, or a shipment carrying the
          *     `tag` of a `same_vehicle` or `same_day` relation, is rejected with HTTP 400
          *     `not_supported`: relations never silently skip a member. `same_route`,
-         *     `time_lag`, `compatible_vehicles`, `all_or_none` and `tag_order` reject a
-         *     shipment with HTTP 400 as well.
+         *     `time_lag`, `compatible_vehicles` and `tag_order` reject a shipment with
+         *     HTTP 400 as well. `all_or_none` alone takes a shipment's own id, naming both
+         *     legs, in a group that is exactly one `consecutive` chain; such a chain may
+         *     also be jobs only.
          * @example {
          *       "stops": [
          *         "job-1",
@@ -1399,20 +1437,25 @@ export interface components {
         /**
          * All or none
          * @description All or none: either every member in `stops` is served, or none is.
-         *     Sets no timing; combine with `synchronized` or `time_lag` for when.
-         *     Hard. Overlapping `all_or_none` relations chain: one on A and B plus
+         *     Sets no timing; a coupled group takes its timing from the
+         *     `synchronized` or `time_lag` relation that names its members. Hard.
+         *     Overlapping `all_or_none` relations chain: one on A and B plus
          *     one on B and C serve all three together or none of them. A group with
          *     a task in a vehicle's locked prefix (`plan.routes[].locked_count`) is
          *     exempt. A member that could be served but is held back because
          *     another cannot reports `all_or_none` in `unassigned[].reasons`.
          *
-         *     Every task must also be named by a `synchronized` or `time_lag`
-         *     relation; a task named by neither is rejected with HTTP 400.
+         *     A member may be a shipment id (both legs). Members are coupled by
+         *     `synchronized`/`time_lag`, or the group's stops (a shipment as its two
+         *     legs) are exactly one `consecutive` chain with no member coupled by
+         *     `synchronized` or `time_lag`, directly or through a `sequence` or
+         *     `consecutive` relation. A task named by neither is rejected with HTTP 400, as is a
+         *     shipment-leg id: name the shipment.
          */
         RelationAllOrNone: {
             /**
-             * @description Job ids, at least two. A shipment's own id or a shipment-leg stop id
-             *     is rejected with HTTP 400.
+             * @description Job ids or shipment ids, at least two. A shipment-leg stop id is
+             *     rejected with HTTP 400.
              * @example [
              *       "job-1",
              *       "job-2"
@@ -1460,6 +1503,7 @@ export interface components {
          *     route. A member that is unassigned is skipped, so only listed
          *     neighbours that are both served are adjacent. Members on different
          *     routes are unconstrained; add `same_route` to keep them together.
+         *     Put a chain in an `all_or_none` to serve it whole or not at all.
          */
         RelationConsecutive: {
             /**
@@ -1716,14 +1760,14 @@ export interface components {
         /** @description One problem in a request. */
         RequestIssue: {
             /**
-             * Format: int64
+             * Format: uint64
              * @description `limit_exceeded` only: the count this request has.
              */
             actual?: number | null;
             /** @description What is wrong. */
             code: components["schemas"]["ErrorItemCode"];
             /**
-             * Format: int64
+             * Format: uint64
              * @description `limit_exceeded` only: the published cap.
              */
             limit?: number | null;
@@ -2052,9 +2096,9 @@ export interface components {
              * @description Seconds past this task's `target.at`, measured at the stop's arrival
              *     (plus any `windowed` break taken on arrival there, idle before it
              *     included) or departure per `target.on`; `0` when met. Present only on a task
-             *     stop carrying a target. A shipment's target is measured on its
-             *     delivery leg, so it appears on the `:delivery` stop and never on the
-             *     `:pickup` stop.
+             *     stop carrying a target. A shipment's own `target` is measured on its
+             *     delivery leg, so it appears on the `:delivery` stop; a `pickup.target`
+             *     or `delivery.target` appears on that leg's stop.
              * @example 0
              */
             target_lateness_s?: number | null;
@@ -2140,7 +2184,7 @@ export interface components {
              */
             unassigned_priority: number;
             /**
-             * Format: int32
+             * Format: uint32
              * @description How many hard-constraint violations the plan has (the `violations`
              *     arrays on routes and stops list them). Always `0` on a solve result.
              * @example 0
@@ -2280,7 +2324,7 @@ export interface components {
         /** @description How the search behind a plan ended. */
         SearchInfo: {
             /**
-             * Format: int64
+             * Format: uint64
              * @description Search iterations performed. `0` when nothing was searched.
              * @example 48210
              */
@@ -2306,7 +2350,7 @@ export interface components {
              */
             cost: number;
             /**
-             * Format: int64
+             * Format: uint64
              * @description Milliseconds since the search started (the clock of
              *     `summary.timings.search_ms`).
              */
@@ -2451,10 +2495,11 @@ export interface components {
             /**
              * Format: int32
              * @description Maximum trips (depot legs) in this shift, across all reload depots.
-             *     Counts trips, not reloads: `trips = reloads_used + 1`. `max_trips: 1`
-             *     means a single trip — reloads are permitted in `reloads` but the cap
-             *     prevents ever using one. `reloads` present with `max_trips` absent
-             *     means unlimited trips. A single reload depot can only be
+             *     Counts trips, not reloads: `trips = reloads_used + 1`, where the final
+             *     unload of `unload_before_end` is not counted. `max_trips: 1` means a
+             *     single trip — reloads are permitted in `reloads` but the cap prevents
+             *     ever using one, other than that final unload. `reloads` present with
+             *     `max_trips` absent means unlimited trips. A single reload depot can only be
              *     revisited up to 8 times per shift regardless of `max_trips`;
              *     a `max_trips` beyond that against one depot
              *     is accepted but the extra headroom is unreachable — list more than
@@ -2528,6 +2573,16 @@ export interface components {
              * @example 2026-07-01T17:00:00+02:00
              */
             to: string;
+            /**
+             * @description When `true`, a route that would end with load on board first unloads
+             *     at one of this shift's `reloads` depots: a final `reload` stop, at the
+             *     depot the solver finds cheapest, taking that depot's
+             *     `service_duration_s` and `per_reload`. It does not count toward
+             *     `max_trips`. A route whose last trip carries no load ends without one.
+             *     `true` without `reloads` is rejected with HTTP 400
+             *     `conflicting_fields`. Default `false`.
+             */
+            unload_before_end?: boolean | null;
         };
         /**
          * @description The `Costs` fields for one shift, minus `per_used_vehicle`. A shift is one
@@ -2597,7 +2652,7 @@ export interface components {
              */
             max_route_duration_s?: number | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Maximum stops served in this shift; a job counts as one stop.
              *     Start, end, break and reload stops in `routes[].stops` do not count; a
              *     shipment counts as two stops.
@@ -2739,10 +2794,10 @@ export interface components {
              */
             preferences?: components["schemas"]["VehiclePreference"][] | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Importance of a must-serve task when not all of them fit: the solver
-             *     maximises the summed `priority` of served tasks before any cost. `>= 1`,
-             *     default `1` (maximise the count). A rank, not money — it never makes a
+             *     maximises the summed `priority` of served tasks before any cost. `1` to
+             *     `4294967295`, default `1` (maximise the count). A rank, not money — it never makes a
              *     task droppable; use `drop_cost` for that. Both set is a 400.
              * @example 3
              */
@@ -2776,7 +2831,10 @@ export interface components {
             tags?: string[] | null;
             /**
              * @description Soft target for this task, measured at its arrival (default) or
-             *     departure. On a shipment it is measured on the **delivery** leg.
+             *     departure. On a shipment it is measured on the **delivery** leg and
+             *     cannot be combined with `delivery.target` (HTTP 400
+             *     `conflicting_fields`); `pickup.target` adds a separate target on the
+             *     pickup leg.
              */
             target?: null | components["schemas"]["Target"];
         };
@@ -2834,6 +2892,14 @@ export interface components {
              * @example 60
              */
             setup_duration_s?: number | null;
+            /**
+             * @description Soft target for this leg, measured at its arrival (default) or
+             *     departure. Same type, units and validation as the task-level
+             *     `target`. The shipment's own `target` is measured on the delivery
+             *     leg, so sending it with `delivery.target` is rejected with HTTP 400
+             *     (`conflicting_fields`).
+             */
+            target?: null | components["schemas"]["Target"];
             /** @description Time windows for this stop. */
             time_windows?: components["schemas"]["TimeWindow"][] | null;
         };
@@ -2873,7 +2939,7 @@ export interface components {
              */
             polyline?: null | components["schemas"]["PolylineDetail"];
             /**
-             * Format: int64
+             * Format: uint64
              * @description Random seed for the search. Default `42`: omitting it is the same as
              *     sending `42`, so send different values to explore different plans.
              *     Repeated runs on one machine usually return an identical plan; a
@@ -3227,15 +3293,18 @@ export interface components {
          */
         SuggestOptions: {
             /**
-             * Format: int32
+             * Format: uint32
              * @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 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.
+             *     `max(8, 4 × max_insertions)` partial placements. A `synchronized` or
+             *     `time_lag` group is the exception: every start slot of each member is
+             *     tried, each other member at its cheapest slot, whatever this value. A
+             *     single-stop task has every feasible position considered unless
+             *     `time_limit_s` runs out first.
              * @default 5
              * @example 5
              */
@@ -3394,6 +3463,7 @@ export interface components {
          *                   "arrival": "2026-07-01T09:30:00+02:00",
          *                   "id": "job-2",
          *                   "latest_arrival": "2026-07-01T10:15:00+02:00",
+         *                   "service_start": "2026-07-01T09:30:00+02:00",
          *                   "shift": "mon",
          *                   "type": "job",
          *                   "vehicle": "v1"
@@ -3439,11 +3509,12 @@ export interface components {
              */
             timings: components["schemas"]["Timings"];
             /**
-             * @description `true` when `options.time_limit_s` cut the search short, or a
+             * @description `true` when `options.time_limit_s` cut the search short, a
              *     multi-member unit came back empty after the search had discarded
              *     candidates (an inconclusive "not found"; its `reason.code` is
-             *     `candidates_exhausted`). Lists may then be incomplete or missing the
-             *     best insertion. A single visit's only level is never pruned, so its
+             *     `candidates_exhausted`), or a crew lists fewer than `max_insertions`
+             *     after a member's cheapest slot was refused and its other slots went
+             *     untried. Lists may then be incomplete or missing the best insertion. A single visit's only level is never pruned, so its
              *     empty list is proof of infeasibility unless the budget cut it, and its
              *     `reason.code` is then `time_limit`.
              */
@@ -3525,7 +3596,7 @@ export interface components {
             /** @description How the search ended. */
             search: components["schemas"]["SearchInfo"];
             /**
-             * Format: int32
+             * Format: uint32
              * @description Routes with at least one task stop: one per used shift.
              * @example 1
              */
@@ -3549,7 +3620,7 @@ export interface components {
              */
             travel_estimated?: boolean;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Distinct vehicles with at least one route.
              * @example 1
              */
@@ -3628,17 +3699,17 @@ export interface components {
          */
         TaskCounts: {
             /**
-             * Format: int32
+             * Format: uint32
              * @description Tasks on a route.
              */
             served: number;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Tasks on no route: the length of `unassigned`.
              */
             unassigned: number;
             /**
-             * Format: int32
+             * Format: uint32
              * @description The unassigned tasks that carry no `drop_cost`: tasks the plan was
              *     required to serve and did not.
              */
@@ -3659,6 +3730,7 @@ export interface components {
          *               "arrival": "2026-07-01T09:30:00+02:00",
          *               "id": "job-2",
          *               "latest_arrival": "2026-07-01T10:15:00+02:00",
+         *               "service_start": "2026-07-01T09:30:00+02:00",
          *               "shift": "mon",
          *               "type": "job",
          *               "vehicle": "v1"
@@ -3695,10 +3767,9 @@ export interface components {
             /** @description Why `insertions` is empty; absent otherwise. */
             reason?: null | components["schemas"]["SuggestReason"];
             /**
-             * @description The unit's lead: its first member in placement order. That is the
-             *     visit, the shipment, the first stop of a `sequence` chain in the
-             *     unit, or else the member that comes first in problem order (`jobs`,
-             *     then `shipments`).
+             * @description The unit's lead: the visit, the shipment, the first stop of a
+             *     `sequence` chain in the unit, or else, a crew included, the member
+             *     that comes first in problem order (`jobs`, then `shipments`).
              * @example job-2
              */
             task: string;
@@ -3856,13 +3927,13 @@ export interface components {
          */
         Timings: {
             /**
-             * Format: int64
+             * Format: uint64
              * @description Time spent in the search. Absent on `/evaluate`, which runs none, and
              *     on `/suggest`, which has no separate search figure.
              */
             search_ms?: number | null;
             /**
-             * Format: int64
+             * Format: uint64
              * @description From the request's arrival to the end of the search (of the scoring,
              *     on `/evaluate`; of the suggestion search, on `/suggest`): fetching
              *     travel times and waiting for capacity included, building the response
@@ -4223,7 +4294,7 @@ export interface components {
              */
             max_route_duration_s?: number | null;
             /**
-             * Format: int32
+             * Format: uint32
              * @description Maximum stops served per shift; a job counts as one stop.
              *     Start, end, break and reload stops in `routes[].stops` do not count; a
              *     shipment counts as two stops.
@@ -4308,15 +4379,16 @@ export interface components {
              */
             code: components["schemas"]["ConstraintCode"];
             /**
-             * @description The capacity dimension over its limit. Only on `capacity`.
+             * @description The capacity dimension over its limit. Only on `capacity`,
+             *     `unload_before_end` and `max_intake`.
              * @example weight
              */
             dimension?: string | null;
             /**
              * Format: int64
              * @description How far over the limit, in `unit`. On `capacity`, `time_window` (the
-             *     seconds late), `shift_end`, `max_distance`, `max_route_duration` and
-             *     `quota`.
+             *     seconds late), `shift_end`, `max_distance`, `max_route_duration`,
+             *     `quota`, `unload_before_end` and `max_intake`.
              * @example 15
              */
             excess?: number | null;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@solvice/routing",
-  "version": "0.19.1-beta.0",
+  "version": "0.19.3-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",