CVRP | MDVRP | PVRP | SDVRP | SVRP | VRPB | VRPPD | VRPSF | VRPTW

Periodic VRP (PVRP)

In classical VRPs, typically the planning period is a single day. In the case of the Period Vehicle Routing Problem (PVRP), the classical VRP is generalized by extending the planning period to M days.

We define the problem as follows:

Customer
Diary Demand
Number of
Visits
Number of Combinations
Possible
Combinations
1
30
1
3
1, 2, 4
2
20
2
3
3, 5, 6
3
20
2
3
3, 5, 6
4
30
2
3
1, 2, 4
5
10
3
1
7

CVRP | MDVRP | PVRP | SDVRP | SVRP | VRPB | VRPPD | VRPSF | VRPTW