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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (3) hide show
  1. package/dist/runs.d.ts +1 -1
  2. package/dist/v3.d.ts +2 -2
  3. package/package.json +1 -1
package/dist/runs.d.ts CHANGED
@@ -1987,7 +1987,7 @@ export interface components {
1987
1987
  seed?: number | null;
1988
1988
  /**
1989
1989
  * Format: double
1990
- * @description Search time budget in seconds, fractions allowed. Default when omitted:
1990
+ * @description Upper bound on the search time in seconds, fractions allowed. Default when omitted:
1991
1991
  * 150 ms plus 4 ms per task (jobs and shipments combined), so 100 tasks
1992
1992
  * search for 0.55 s. Maximum 3600: a larger value is rejected with HTTP 400.
1993
1993
  * A value below 0.1 is raised to a 100 ms floor. Pure search time:
package/dist/v3.d.ts CHANGED
@@ -34,7 +34,7 @@ export interface paths {
34
34
  put?: never;
35
35
  /**
36
36
  * Solve a vehicle routing problem
37
- * @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 `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`.
37
+ * @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`.
38
38
  */
39
39
  post: operations["solve"];
40
40
  delete?: never;
@@ -2868,7 +2868,7 @@ export interface components {
2868
2868
  seed?: number | null;
2869
2869
  /**
2870
2870
  * Format: double
2871
- * @description Search time budget in seconds, fractions allowed. Default when omitted:
2871
+ * @description Upper bound on the search time in seconds, fractions allowed. Default when omitted:
2872
2872
  * 150 ms plus 4 ms per task (jobs and shipments combined), so 100 tasks
2873
2873
  * search for 0.55 s. Maximum 60: a larger value is rejected with HTTP 400.
2874
2874
  * A value below 0.1 is raised to a 100 ms floor. Pure search time:
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@solvice/routing",
3
- "version": "0.18.0-beta.0",
3
+ "version": "0.18.2-beta.0",
4
4
  "description": "TypeScript client for the Solvice V3 routing API, generated from its OpenAPI spec.",
5
5
  "license": "Apache-2.0",
6
6
  "homepage": "https://docs.solvice.io/guides/platform/sdks/typescript",