Four problems that decide what an operation costs.
Gradient Path is deliberately general: it understands activities, connections and limits, not trucks or nurses. Each application describes its own world, and the platform does the rest.
Four problem types, solved on the same platform.
Routing
Getting vehicles, goods and people where they need to be, for the least cost and distance.
Scheduling
Sequencing work across time and resources without breaking the rules that govern it.
Rostering
Rosters and shift patterns that meet demand, contracts and staff preferences at once.
Assignment
Matching limited resources — aircraft, machines, crews — to the work that needs them.
- SSource
- TSink
- 1Task (node)
- Route / path
-
Route 1 (Sink 1)
S 1 2 4 7 T
Tasks covered: 1, 2, 4, 7
-
Route 2 (Sink 1)
S 3 5 8 T
Tasks covered: 3, 5, 8
-
Route 3 (Sink 1)
S 6 9 10 12 T
Tasks covered: 6, 9, 10, 12
-
Route 4 (Sink 1)
S 13 14 15 16 T
Tasks covered: 13, 14, 15, 16
-
Route 5 (Sink 1)
S 17 18 19 20 T
Tasks covered: 17, 18, 19, 20
Where it is put to work.
- Vehicle routing Delivery and collection rounds under capacity, time-window and driver-hours limits.
- Pickup & delivery Loads that must be collected and dropped in order, on the same vehicle.
- Aircraft tail assignment Matching individual aircraft to flight schedules around maintenance and turnaround rules.
- Nurse rostering Ward coverage that respects contracts, rest requirements and staff preferences.
- Bus duty scheduling Building legal, efficient driver duties from a timetable of trips.
- Workforce shift scheduling Staffing to demand across sites, skills and availability.
Applied in operations including:
Not listed here? The platform is domain-agnostic — if your problem is about sequencing activities under limits, tell us what it looks like.
How the platform reaches those answers.
The method behind all of it: a global search, made fast enough to use.