Examples
Examples
Try the starting example
- Activity transport trips JSON [ID,pickup location,dropoff location,start minute,end minute]
- [["T1","home","club",900,920],["T2","home","school",910,930]]
- Drivers JSON [ID,available start minute,end minute,initial location]
- [["A",880,1000,"home"],["B",880,1000,"home"]]
- Entered directed travel minutes JSON {from>to:minutes}; include same-location zero
- {"home>home":0,"home>club":20,"home>school":20,"club>home":20,"school>home":20}
- Feasible assigned trips [trip,driver,start,end]
- [["T1","A",900,920],["T2","B",910,930]]
- Conflicting/unassigned trip IDs
- []
- Unassigned trip count
- 0
Try another scenario
- Activity transport trips JSON [ID,pickup location,dropoff location,start minute,end minute]
- [["T1","home","club",900,920],["T2","home","school",910,930]]
- Drivers JSON [ID,available start minute,end minute,initial location]
- [["A",880,1000,"home"]]
- Entered directed travel minutes JSON {from>to:minutes}; include same-location zero
- {"home>home":0,"home>club":20,"home>school":20,"club>home":20,"school>home":20}
- Feasible assigned trips [trip,driver,start,end]
- [["T1","A",900,920]]
- Conflicting/unassigned trip IDs
- ["T2"]
- Unassigned trip count
- 1
Calculation method
Calculation method
Feasible assigned trips [trip,driver,start,end]
Process chronological pickup starts, then ID. Choose lexicographic available driver able to travel from previous location by pickup and finish trip by fixed end.
Conflicting/unassigned trip IDs
Trips with no feasible driver under this greedy schedule.
Unassigned trip count
Count leftovers.
Symbols and units
- a
- Activity transport trips JSON [ID,pickup location,dropoff location,start minute,end minute]
- b
- Drivers JSON [ID,available start minute,end minute,initial location]
- c
- Entered directed travel minutes JSON {from>to:minutes}; include same-location zero
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Fixed trip times, one trip per driver at a time and explicit directed travel times. Each trip carries its supplied group; no inferred driver permissions, child supervision, vehicle capacity or traffic model. Greedy proposal, not optimal. Supported limits: 1..100 trips/drivers; unique IDs; 0<=start<end<=10080; nonnegative explicit travel; missing route means unavailable.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.