Prioritizing vehicles / serving neighbourhoods
Posted: Thu Dec 19, 2024 10:19 am
I have a question about a recommended strategy for the following story:
Let's say
From a generic perspective I would prefer some kind of a n "adjacence" matrix approach...
Let's say
- My vehicles are responsible for more or less dedicated "primary" areas: green vehicles, yellow vehicles, orange vehicles, red vehicles.
- For an order there's a dedicated color, e.g. green.
- now a gree order should be served based on some constraints / preferences:
- red vehicles should not match at all
- though orange, yellow and green can serve the order in general, I want an assignment to consider costs to control preferences:
- if assignment is to "green vehicle": free of additional costs
- if assignment is to "yellow vehicle": extra costs xx
- if assignment is to "orange vehicle": extra costs yy ( alltogether 0 < xx < yy)
From a generic perspective I would prefer some kind of a n "adjacence" matrix approach...