e-commerce vehicle routing problem with time windows [Dataset]
收藏资源简介:
This dataset provides instances for evaluating Vehicle Routing Problem (VRP) scenarios in the context of e-commerce, where multiple delivery options per order are considered. The XY file defines the spatial location of delivery points using planar coordinates. The TW file specifies the time windows associated with each delivery, structured in 2- or 4-hour slots. The working day starts at 08:00, and time windows are interpreted consecutively from this time. This material is associated with the paper: Alejandro Escudero-Santana, Luis Onieva, Juan-Carlos Cortés-Muñoz, María-Luisa Muñoz-Díaz (2025) "A cuckoo search algorithm to improve a routing problem adapted to last mile e-commerce logistics", Central European Journal of Operations Research, Volume 33 (4), 1391-1405doi:10.1007/s10100-024-00945-w



