# HALOWERK VRP Plan — Vehicle Routing Problem Solver

> HALOWERK VRP Plan — Vehicle Routing Problem Solver is a paid API for AI agents from lauf.halowerk.com, paid per call via x402, $0.006/call, status unknown (last checked 2026-10-12).

Solves a capacitated vehicle routing problem with time windows (CVRPTW), returning an optimized delivery/visit plan for a fleet of vehicles across a set of jobs.

## Facts

- Endpoint: POST https://lauf.halowerk.com/v1/vrp-plan?utm_source=zero.xyz
- Price: $0.006/call
- Payment: x402
- Status: unknown
- Last checked: 2026-10-12
- Activations on Zero: 0
- Tags: x402
- Canonical page: https://www.zero.xyz/c/halowerk-vrp-plan-vehicle-routing-problem-solver-4b5ba786
- Structured record (JSON): https://api.zero.xyz/v1/capabilities/cap_7MNUesXz1pFmvDKocvX5k

Status and success rate cover calls made through Zero and Zero's own probes. Third-party monitors may report differently.

## How to call it through Zero

Zero handles the 402 payment challenge and records the run. With the Zero CLI installed (`npm i -g @zeroxyz/cli`):

```sh
zero fetch --capability halowerk-vrp-plan-vehicle-routing-problem-solver-4b5ba786 -d '<json body>'
```

Example prompt: I have 3 delivery vans (each with a capacity of 500 kg, working 8am–6pm) and 15 customer stops to visit today — each with a demand between 20 and 80 kg and a time window they're available. Can you solve the vehicle routing problem and give me the optimal route plan for each van, using the travel times I'll provide in a 16x16 duration matrix?

## When to prefer this

Choose this endpoint when you need a fast, pay-per-call VRP solver with time windows and capacity constraints for small-to-medium fleets (up to 4 vehicles, 20 jobs) without managing your own OR infrastructure. Ideal for agents that need on-demand route optimization without a subscription. Particularly suited when you already have a precomputed travel duration matrix (e.g. from a mapping API). For larger fleets or more complex constraints, consider a dedicated OR platform.

## Known failure modes

- No feasible solution exists if time windows are too tight or capacity is insufficient for demand
- Invalid or incomplete duration matrix (wrong dimensions relative to number of points) returns a validation error
- Job or vehicle count exceeds allowed limits (max 20 jobs, max 4 vehicles)
- Null values in duration matrix for required routes may cause infeasibility
- Point indices out of range relative to the provided matrix size
- Payment failure via x402 protocol if insufficient USDC balance on Base Mainnet

## How this service works

HALOWERK laufwerk — bezahlte Endpunkte nach x402. Preise in USDC auf Base Mainnet.

## Output

An optimized vehicle routing plan detailing which vehicle handles which jobs, in what sequence, and at what times — respecting vehicle capacities, shift windows, job time windows, and service durations. Computed using the provided travel duration matrix.

## Request schema (JSON Schema)

```json
{
 "type": "object",
 "properties": {
  "jobs": {
   "type": "array",
   "items": {
    "type": "object",
    "required": [
     "id",
     "point",
     "demand",
     "service_s",
     "window"
    ],
    "properties": {
     "id": {
      "type": "string",
      "maxLength": 80,
      "minLength": 1
     },
     "point": {
      "type": "integer",
      "maximum": 20,
      "minimum": 1
     },
     "demand": {
      "type": "number",
      "maximum": 100000,
      "minimum": 0
     },
     "window": {
      "type": "array",
      "items": {
       "type": "number",
       "maximum": 604800,
       "minimum": 0
      },
      "maxItems": 2,
      "minItems": 2
     },
     "service_s": {
      "type": "number",
      "maximum": 604800,
      "minimum": 0
     }
    },
    "additionalProperties": false
   },
   "maxItems": 20,
   "minItems": 1
  },
  "vehicles": {
   "type": "array",
   "items": {
    "type": "object",
    "required": [
     "id",
     "capacity",
     "shift"
    ],
    "properties": {
     "id": {
      "type": "string",
      "maxLength": 80,
      "minLength": 1
     },
     "shift": {
      "type": "array",
      "items": {
       "type": "number",
       "maximum": 604800,
       "minimum": 0
      },
      "maxItems": 2,
      "minItems": 2
     },
     "capacity": {
      "type": "number",
      "maximum": 100000,
      "exclusiveMinimum": 0
     }
    },
    "additionalProperties": false
   },
   "maxItems": 4,
   "minItems": 1
  },
  "durations_s": {
   "type": "array",
   "items": {
    "type": "array",
    "items": {
     "anyOf": [
      {
       "type": "number",
       "maximum": 604800,
       "minimum": 0
      },
      {
       "type": "null"
      }
     ]
    },
    "maxItems": 21,
    "minItems": 2
   },
   "maxItems": 21,
   "minItems": 2
  },
  "matrix_source": {
   "type": "string",
   "maxLength": 200,
   "minLength": 1
  }
 }
}
```

## More

- Live health (JSON, refreshed every minute): https://www.zero.xyz/c/halowerk-vrp-plan-vehicle-routing-problem-solver-4b5ba786/health.json
- [Zero catalog index](https://www.zero.xyz/llms.txt)
- [Other services from lauf.halowerk.com](https://www.zero.xyz/host/lauf.halowerk.com/llms.txt)