VelesRelay · Local relief route planner 1.0.0 · Chrome on Linux
Every handover. Every walk. One shared plan.
Plan relief cover for fixed volunteer posts, including walking and both handovers. Review gaps, repair a late return and issue matching instructions for each post and rover.
You already have a fixed rota for ordinary information, welcome or exhibition posts and need to plan how a small relief team will cover requested absences.
$19 USD · one-time purchase
Continue to checkoutStep-by-step guide
No subscription. Final total and tax appear at checkout.
Try the planning example before buying
Follow the fictional route and late-return exercise on paper. The free pack includes the manual, examples and answers; the paid bundle adds the local app.
- Account for the whole visit: Include the outbound walk, cover, handback and final return.
- Keep gaps visible: Inspect unresolved breaks, adjust placements and pin the ones you need to keep.
- Replace the right sheets: Issue a new revision while retaining earlier post and rover instructions.
What it helps you do
For small-fair coordinators who already have a fixed rota for welcome, information or exhibition posts. Enter requested absences, eligible rovers, directed walking times and availability. Review the proposed cover, keep unresolved requests visible and preserve earlier issued revisions.
What is in your download
- Local browser app with all runtime source under the MIT license
- Illustrated English guide with five actual screenshots
- Original Orchard Fair JSON and six CSV input templates
- Delayed and repaired examples, expected outcomes and a printable worksheet
A practical example
Orchard Fair — original fictional relief exercise
Start with
Three fixed posts, one eligible rover, three 20-minute absences and five-minute handovers. Directed walks are HQ→A 5, A→B 10, B→C 5 and C→HQ 10 minutes.
Get this result
Original route: Remy returns HQ at 11:50; 60 cover + 30 handover + 30 walking = 120 minutes. Repaired plan: Jo covers C, Remy returns HQ at 11:30; totals become 70/30/30. Replace B/C and Remy/Jo sheets; the first revision remains unchanged.
Free illustrated guide, Orchard Fair data, delayed/repaired examples and worksheet (no application)
Examples use fictional or synthetic data. Follow this example step by step.
Review the original route, the gap and the repair
Actual VelesRelay screens in Chrome on Linux. Orchard Fair and all names are fictional.
Follow the whole relief route
Three requested absences become one route for Remy, including both handovers and the return to HQ. View full size Keep the uncovered request visible
A late return at B leaves C unresolved. The app keeps the gap visible instead of calling the plan complete. View full size Issue the repaired plan
Backup Jo covers C while Remy returns from B. Save a new revision and replace the changed sheets. View full size
How it works
Enter the fixed rota
Add posts, rovers, eligibility, walking times and requested absences.
Review the whole route
Inspect walks and both handovers, resolve gaps and pin placements.
Issue matching papers
Save a revision, print the post and rover sheets and communicate changes.
Before you buy
- Desktop Google Chrome. Independently checked in Chrome 152.0.7977.82 on Linux x86_64; other platforms are unverified.
- Extract the whole buyer ZIP and open app/index.html in desktop Google Chrome. Choose Load Orchard Fair, then Propose route in Review. No installation, command line, server, account or internet connection is required. Keep the extracted folders together.
- A known base rota, absence windows, qualified relief people, availability and explicit directed walking times. Check these inputs with your team.
- For bulk entry, use all six supplied UTF-8 CSV filenames and exact headers together. A failed import leaves the current plan intact.
Compatibility & limits
One same-day event up to 16 hours on a five-minute grid; no midnight crossing or time zones. 12 fixed posts, 6 distinct rovers, 40 requests, 12 roles, 72 eligibility rows, 100 directed travel rows and 24 unavailable intervals. Absences 5–120 minutes, walking 0–120 minutes and handovers of 0, 5, 10 or 15 minutes. CSV files up to 1 MiB each, project JSON up to 5 MiB and 20 issued revisions. Each rover has one continuous tour. Walking and waiting must avoid unavailable intervals. A directed route must be entered explicitly, including the return; a missing leg is unavailable. Search stops at 100,000 states or five seconds and reports incomplete exploration when capped. It does not prove an optimal plan or global impossibility. Intermediate visits around pinned placements may require manual planning. No autosave, signup, messaging, shift allocation, calendar integration or attendance verification. Save the downloaded project before closing. Verified in Google Chrome 152 on Linux with networking disabled, including desktop and 390px layouts and A4/Letter PDF output. Other platforms and physical printing are unverified. Desktop is recommended for editing. This planning aid does not establish suitability for security, medical, traffic or safeguarding coverage, calculate legal break entitlements or guarantee real attendance.
Get VelesRelay
Perpetual use of the purchased version on your devices for personal or internal commercial work. Keep reasonable backups and modify your own copy; do not redistribute or resell original proprietary code. Third-party licenses and any existing preview permissions retain their rights.
Before payment, save the private recovery code shown by checkout. After Paddle confirms payment, use it to download your ZIP or return for it later. No subscription, future update or email delivery is promised. See the illustrated steps.
$19 USD · once
Buy download