{"uid":"cap_qOXmF3iLnXpVfbeZY96ST","slug":"halowerk-laufwerk-tours-waiting-readiness-optimizer-bafe4af9","name":"HALOWERK laufwerk — Tours Waiting Readiness Optimizer","description":"HALOWERK laufwerk — bezahlte Endpunkte nach x402. Preise in USDC auf Base Mainnet.","url":"https://lauf.halowerk.com/v1/tours/waiting-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_waiting_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_zasnYMWD7AtlFeCrVe0yR","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":"Checks vehicle routing feasibility by computing whether jobs can be served within time windows given maximum waiting time constraints, returning readiness scores for tour planning.","exampleAgentPrompt":"Check if my 2 delivery vehicles with capacity 500 each, working shifts from hour 0 to 28800, can handle these 3 jobs — stop 1 at point 2 needing 50 units with a 2-hour service window from 3600 to 7200, stop 2 at point 5 needing 30 units from 5400 to 10800, stop 3 at point 8 needing 80 units from 7200 to 14400 — using the provided 3x3 travel-time matrix, with a max waiting time of 1800 seconds.","exampleUseCases":[{"title":"Last-mile delivery feasibility check","prompt":"I have 4 delivery vans with 200-unit capacity each, running shifts from second 0 to 36000. I've got 10 parcels to deliver at various city points, each with a time window and service time. Given my travel time matrix, can you check whether all jobs can be served without any vehicle waiting more than 900 seconds between stops?"},{"title":"Courier fleet scheduling validation","prompt":"Before I dispatch my 3 courier bikes for the morning run — capacity 50 each, shifts from 25200 to 50400 — check if these 8 pickup jobs across 10 map points are actually feasible given their time windows and a max allowed waiting time of 600 seconds. Here's the travel duration matrix between all points."},{"title":"Logistics route readiness for narrow time windows","prompt":"I'm planning a medical supply run with 1 vehicle, capacity 10000, shift from 0 to 14400. There are 5 stops with very tight windows — can you assess if the route is ready given this travel time matrix and a maximum waiting time of 300 seconds between stops?"}],"resultDescription":"Returns a JSON object indicating whether the given set of jobs and vehicles passes waiting-readiness validation — including feasibility status, computed waiting times, and any constraint violations per job or vehicle across the tour.","failureModes":["Invalid or missing required fields (id, point, demand, window, service_s) cause 400 validation error","Duration matrix dimensions do not match number of jobs plus vehicles, causing computation failure","Job demand exceeds vehicle capacity, resulting in infeasibility flag","Time windows violate shift boundaries, causing constraint rejection","Max waiting time set to 0 may make most tours infeasible","Payment not received or insufficient USDC balance triggers 402 Payment Required"],"whenToPreferThis":"Use this endpoint when you need to pre-validate vehicle routing feasibility before committing to a dispatch plan, specifically to check whether waiting times between jobs remain within acceptable bounds given real travel durations. Prefer this over general VRP solvers when the primary concern is waiting-time readiness rather than optimal route generation.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-10T12:37:52.093Z","isFirstParty":false,"canonicalSlug":"halowerk-laufwerk-tours-waiting-readiness-optimizer-bafe4af9"}