Planner Inputs
Example Data Table
This example shows one depot and four stops using simple planning coordinates. You can replace these values with your own operational data.
| Stop | X | Y | Service Min | Priority | Window Start | Window End |
|---|---|---|---|---|---|---|
| Client A | 8 | 5 | 20 | 5 | 08:30 | 10:00 |
| Client B | 3 | 11 | 15 | 3 | 09:00 | 11:30 |
| Client C | 14 | 9 | 25 | 4 | 10:00 | 13:00 |
| Client D | 10 | 2 | 10 | 2 | 08:15 | 12:30 |
Formula Used
This planner uses a practical routing heuristic for stop selection. It estimates the next best stop using distance, waiting time, lateness pressure, and stop priority.
- Leg Distance = √[(x₂ − x₁)² + (y₂ − y₁)²]
- Effective Speed = Average Speed × (1 − Traffic Factor ÷ 100)
- Travel Time = Leg Distance ÷ Effective Speed × 60
- Waiting Time = max(0, Window Start − Arrival Time)
- Lateness = max(0, Arrival Time − Window End)
- Selection Score = Distance + 0.04 × Wait Minutes + 0.18 × Late Minutes − Priority × Priority Weight
- Total Cost = Distance Cost + Labor Cost + Late Penalty Cost
- Distance Cost = Total Distance × Travel Cost per Distance Unit
- Labor Cost = Total Active Time in Hours × Labor Cost per Hour
- Late Penalty Cost = Total Late Minutes × Late Penalty per Minute
- Estimated Emissions = Total Distance × Emission Rate
- Efficiency Score = 30% Distance Score + 25% On-Time Score + 20% Priority Score + 15% Cost Score + 10% Utilization Score
The method is designed for operational planning, scheduling practice, dispatch simulations, and rapid route comparisons when live road APIs are not required.
How to Use This Calculator
- Enter the depot coordinates and set your route start time.
- Provide average speed, traffic factor, labor rate, distance cost, and late penalty values.
- Add stops with coordinates, service minutes, priority, and arrival windows.
- Choose whether the route should return to the depot.
- Click Optimize Route to generate the result block above the form.
- Review the optimized order, comparison table, graph, and stop schedule.
- Use the export buttons to download CSV or PDF output.
FAQs
1. What does this planner optimize?
It arranges stops using distance, speed, priority, and time windows. The route uses a practical heuristic, not a live road mapping service.
2. Are the coordinates real GPS values?
No. This version uses local X and Y planning coordinates. You can treat them as kilometers, miles, campus blocks, or warehouse zones.
3. How are time windows handled?
Each stop has earliest and latest arrival times. Early arrivals create waiting time. Late arrivals add lateness minutes and penalty cost.
4. Does it always find the perfect route?
No. It gives a strong operational estimate for many daily scenarios. Complex fleet routing may still require specialized vehicle routing software.
5. Can I include a return trip?
Yes. Enable the depot return option to add a final leg back to the starting point with updated distance, time, cost, and emissions.
6. What improves the efficiency score?
Shorter distance, lower lateness, better priority order, reduced total cost, and stronger service utilization all improve the planning score.
7. Can I export the results?
Yes. After calculation, use the CSV button for spreadsheet analysis or the PDF button for printable route summaries and stop tables.
8. Which units should I use?
Use one consistent distance unit for every coordinate and cost field. Time entries use clock values and service minutes.