Problem variant
Properties
| Acronym | MDPVRP |
| Title | Multi-Depot Periodic Vehicle Routing Problem |
| Criterion | MIN |
| Description | The multi-depot periodic vehicle routing problem 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"). 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. |