Problem variant

PVRPTW: Periodic Vehicle Routing Problem with Time Windows

Acronym	PVRPTW
Title	Periodic Vehicle Routing Problem with Time Windows
Criterion	MIN
Description	The periodic vehicle routing problem with time windows requires to service a set of customers over a planning horizon of several periods, and satisfy time-window constraints for visits at each period. Each customer is characterized with a set of feasible visit-period combinations (called "patterns") and a time window for the visits.

Datasets	Cordeau_al_2001_PVRPTW Vidal_al_2013_PVRPTW Pirkwieser and Raidl 2009
References	Cordeau et al. 2001 \| A unified tabu search for vehicle routing problems with time windows Pirkwieser and Raidl 2009 \| Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows Vidal et al. 2013 \| A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows