Problem variant
Properties
| Acronym | MDPVRPTW |
| Title | Multi-Depot Periodic Vehicle Routing Problem with Time Windows |
| Criterion | MIN |
| Description | The multi-depot periodic vehicle routing problem with time windows requires to service a set of customers from multiple depots over multiple periods. Each customer is characterized with a set of feasible period combinations for the visits (called "patterns") as well as an allowed time window for visits. Once a customer has been serviced on a period by a depot, it needs to be serviced by the same depot on every other period. |