Dynamic PDPCDPG with Rolling-Horizon
Description
The datasets provided in this repository were developed for the implementation and evaluation of the Dynamic Pickup and Delivery Problem with Crossdock and Time Windows for Perishable Goods (Dynamic PDPCDPG), solved using an event-based Rolling Horizon (RH) optimization framework. They were created to support the numerical experiments presented in the paper "Solving the Dynamic Pickup and Delivery Problem with Crossdock and Time Windows for Perishable Goods Using an Event-Based Rolling-Horizon Approach", by E. Nisyrios and K. Gkiotsalitis. Each benchmark instance consists of two input files: 1. a location file (e.g., Data4_a.txt), containing the network, customer, and operational data; and 2. a time-window file (e.g., Data4_a_tw.txt), containing the service time windows associated with each node. The benchmark instances are based on the Vehicle Routing Problem with Cross-Docking (VRPCD) datasets originally introduced by Wen et al. (2009). The original datasets are publicly available through the Technical University of Denmark (DTU) Data repository at https://doi.org/10.11583/DTU.11786763.v1. The datasets included in this repository extend and adapt the original benchmark instances to accommodate the additional requirements of the Dynamic PDPCDPG, including time windows, perishable goods constraints, and event-based rolling-horizon optimization. Wen, M., Larsen, J., Clausen, J., Cordeau, J.-F., & Laporte, G. (2009). Vehicle routing with cross-docking. Journal of the Operational Research Society. https://doi.org/10.1057/jors.2008.108.
Files
Institutions
- National Technical University of AthensAttica, Athens