{"uid":"cap_SgFGMPNGZxVJ1dECHfCka","slug":"halowerk-laufwerk-tour-route-duration-readiness-0b3a6dab","name":"HALOWERK laufwerk — Tour Route Duration Readiness","description":"HALOWERK laufwerk — bezahlte Endpunkte nach x402. Preise in USDC auf Base Mainnet.","url":"https://lauf.halowerk.com/v1/tours/route-duration-readiness?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},"max_route_duration_s":{"type":"number","maximum":604800,"minimum":0}}},"responseSchema":{"type":"json"},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.007","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.007/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.007","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.007","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_WmTx2G7Boc5DRaMSX4vd5","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.007","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Solves a vehicle routing problem (VRP) with time windows and returns whether tours are feasible given a maximum route duration constraint, plus scheduling details.","exampleAgentPrompt":"I have 3 delivery vehicles each with a capacity of 500 kg and an 8-hour shift (0 to 28800 seconds), 10 stops with individual demand, time windows, and 5-minute service times each — can you check if all tours are feasible within a max route duration of 28800 seconds using this travel time matrix?","exampleUseCases":[{"title":"Last-mile delivery feasibility check","prompt":"I have 2 delivery vans, each with a 400 kg capacity and a shift from 6am to 2pm (0–28800 seconds). I've got 8 drop-off jobs with various time windows, 3-minute service times, and demand between 20 and 80 kg each. Run the route duration readiness check using this travel time matrix and tell me if all deliveries can be completed."},{"title":"Field service scheduling validation","prompt":"We have 4 technicians (vehicles, each with a capacity of 1 and an 8-hour shift) and 15 service jobs at different customer sites with strict time windows and 30-minute service durations. Use the travel time matrix I'll provide to check if all jobs can be scheduled and routes stay within a 7-hour max duration per technician."},{"title":"Courier tour optimization with shift constraints","prompt":"Plan routes for my 2 couriers across 12 parcel stops — each courier works a 6-hour shift (0 to 21600 seconds) and can carry up to 200 kg. Each stop has a 2-minute service time, a demand, and a time window. Can you check route readiness using this duration matrix and flag any jobs that can't be assigned?"}],"resultDescription":"Returns a JSON object indicating whether all jobs can be feasibly assigned to vehicles given time windows, capacity, and max route duration. Includes per-vehicle tour schedules with arrival times, departure times, stop sequences, and a list of any unassigned jobs that could not be accommodated.","failureModes":["Invalid or missing required fields (id, point, demand, service_s, window) in jobs — validation error","Vehicle capacity or shift window out of allowed range — schema rejection","Duration matrix dimensions don't match number of points — computation error","No feasible solution exists — returns unassigned jobs or infeasibility flag","max_route_duration_s too restrictive — all or most jobs unassigned","Travel time matrix contains nulls for required point pairs — routing failure","Exceeding maxItems limits (20 jobs, 4 vehicles) — schema rejection"],"whenToPreferThis":"Choose this endpoint when you need to validate whether a set of delivery or service jobs can be feasibly scheduled across a fleet of vehicles given time windows, capacity constraints, and a maximum route duration limit. It is specifically suited for last-mile logistics, field service routing, and courier planning where shift compliance is critical. Prefer this over general routing APIs when you already have a precomputed travel time matrix and need both route optimization and feasibility assessment in one call.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-10T12:40:08.117Z","isFirstParty":false,"canonicalSlug":"halowerk-laufwerk-tour-route-duration-readiness-0b3a6dab"}