You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Heterogeneous Fleet Multi Pickup and Delivery Problem with Time Windows and Crew Scheduling
Hi everyone,
First, thanks a lot for this beautiful open-source solver!
I'm working on a Vehicle Routing Problem (VRP) for ambulance planning and would appreciate feedback on modeling approaches, especially regarding driver–vehicle decoupling and vehicle switching.
🧩 Problem overview
This is a day-ahead planning problem (all demand is known the day before), with the following key characteristics:
Core constraints
Single depot
Around 1000 visits for 50 vehicles
Multi Pickup & Delivery with Time Windows
Each request consists of a pickup at location X and a delivery at location Y
Both pickup and delivery have strict time windows
Routes can mix pickups and deliveries arbitrarily (so this is not reducible to a classical CVRP)
Fleet & resources
Heterogeneous fleet
Different vehicle capacities
Different required skills/competencies
Multi-driver requirements
Some visits require 2 drivers in the same vehicle
Drivers are not permanently assigned to a vehicle
Drivers can change vehicles up to 3 times per day
This could be performant for example when:
Only part of the day requires 2 drivers
A driver only works a partial shift
Break constraints
Breaks are flexible but penalized:
Penalty if:
Not taken at the depot
Duration < 1 hour
However, shorter or off-depot breaks may still be optimal
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
Uh oh!
There was an error while loading. Please reload this page.
-
Heterogeneous Fleet Multi Pickup and Delivery Problem with Time Windows and Crew Scheduling
Hi everyone,
First, thanks a lot for this beautiful open-source solver!
I'm working on a Vehicle Routing Problem (VRP) for ambulance planning and would appreciate feedback on modeling approaches, especially regarding driver–vehicle decoupling and vehicle switching.
🧩 Problem overview
This is a day-ahead planning problem (all demand is known the day before), with the following key characteristics:
Core constraints
Fleet & resources
Break constraints
Breaks are flexible but penalized:
✅ What I’m comfortable with
https://github.com/ge0ffrey/optaplanner-mixedvrp-experiment/tree/master/src/main/java/org/optaplanner/examples/vehiclerouting/domain
Using a propagation approach:
❗ Main challenge: driver ↔ vehicle decoupling
The main difficulty is modeling the fact that drivers can switch vehicles during the day.
I am currently considering two approaches:
🔁 Option 1: Two-stage optimization
Pros:
Cons:
🔗 Option 2: Integrated model with trips
Pros:
Cons:
🤔 Open questions
I’d really appreciate feedback on the following:
Especially when drivers can switch vehicles multiple times
Thanks a lot for your help!
Any feedback, examples, or pointers would be greatly appreciated 🙏
Beta Was this translation helpful? Give feedback.
All reactions