{"uid":"cap_7MNUesXz1pFmvDKocvX5k","slug":"halowerk-vrp-plan-vehicle-routing-problem-solver-4b5ba786","name":"HALOWERK VRP Plan — Vehicle Routing Problem Solver","description":"HALOWERK laufwerk — bezahlte Endpunkte nach x402. Preise in USDC auf Base Mainnet.","url":"https://lauf.halowerk.com/v1/vrp-plan?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"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}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.006","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.006/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.006","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.006","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_NJUq-97jefu1t71ZCbYU7","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.006","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"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.","exampleAgentPrompt":"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?","exampleUseCases":[{"title":"Last-mile courier route planning","prompt":"I need to plan routes for 4 delivery vans making 18 stops today. Each stop has a demand and a time window when the customer is home, and each van has a 300 kg capacity with a shift from 7am to 7pm. I have all the travel durations between locations — can you find the optimal assignment and sequence of deliveries for each van?"},{"title":"Field technician scheduling","prompt":"I have 2 field service technicians (capacity 1 job unit each, shift 9am–5pm) and 10 customer sites to visit, each needing exactly 1 unit of service and a 30-minute visit. Each site has a time window. Can you compute the best schedule and route for each technician given the travel times between all sites?"},{"title":"Food delivery fleet optimization","prompt":"Our restaurant has 3 delivery drivers working 11am–3pm, and we have 12 pending orders each with a weight, a requested delivery window, and a 5-minute handoff time. Using the travel duration matrix I'll provide, find the optimal way to assign and sequence the orders across our 3 drivers to minimize total time."}],"resultDescription":"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.","failureModes":["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"],"whenToPreferThis":"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.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-12T18:31:19.801Z","isFirstParty":false,"canonicalSlug":"halowerk-vrp-plan-vehicle-routing-problem-solver-4b5ba786"}