Timeline for How to tackle this VRP variant?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2022 at 22:27 | comment | added | Open Door Logistics | It's travel time based including the time to move the car and park at a new location, and also subject to the number of stops limit in a loop. It can't be precomputed, because when you're parked it's a function of (1) current parked location, (2) current location and (3) next location, which is too big to precompute and fit in memory for realistic sized problems. | |
| Mar 5, 2022 at 10:56 | comment | added | Kuifje | Interesting ! What is the deterministic rule that you use ? Based on the distance ? And so you compute this rule for every possible edge of the complete graph before hand ? | |
| Mar 5, 2022 at 3:45 | history | edited | Open Door Logistics | CC BY-SA 4.0 |
added 216 characters in body
|
| Mar 5, 2022 at 3:40 | history | answered | Open Door Logistics | CC BY-SA 4.0 |