I used the Vehicle Routing Problem example that has the objective of minimizing total distance traveled for each vehicle.
Suppose that each order to pick up for each vehicle at each node has a priority list, i.e. expedited vs standard. How can I minimize the distance (main objective) but also "soft" respect the priority list if possible?
Note that the priority at each node can change depending on the type of the order that exists at each node.
An example would be let's say we have 3 vehicles to deliver 10 packages each where we have 10 expedited packages and 20 standard packages. The optimal solution given the objective value would perhaps be the following:
- Vehicle 1: 5 expedited packages, 5 standard packages
- Vehicle 2: 2 expedited packages, 8 standard packages
- Vehicle 3: 3 expedited packages, 7 standard packages
Yes, we are prioritizing the expedited packages but if having 1 vehicle delivering all of the 10 expedited packages yield higher distance traveled then truly it is not optimal.