Consider a case where there's three pickup places A, B and C, and a delivery place D, such as:
- A has
[2] items available for pickup
- B has
[1] items available for pickup
- C has
[1] items available for pickup
- D has
demand of [3]
- We don't know if it's cheaper to pickup A+B or A+C, so it should be up to VRP
Such problem model does not seem to be possible because of at least two hard requirements:
-
sum of pickup demand should be equal to sum of delivery demand
-
all pickup/delivery tasks should be done or none of them
The first one is violated because pickups would need to have more demand than delivery in order to model that case.
The second one is violated because it is possible to specify demand only on the task and all tasks have to be completed, but this case requires modelling an extra pickup task because we don't know which is more optimal.
Consider a case where there's three pickup places A, B and C, and a delivery place D, such as:
[2]items available for pickup[1]items available for pickup[1]items available for pickupdemandof[3]Such problem model does not seem to be possible because of at least two hard requirements:
The first one is violated because pickups would need to have more demand than delivery in order to model that case.
The second one is violated because it is possible to specify demand only on the task and all tasks have to be completed, but this case requires modelling an extra pickup task because we don't know which is more optimal.