1. M. Blocho , T. Jastrzab , and J. Nalepa . 2022. Cooperative Co-Evolutionary Memetic Algorithm for Pickup and Delivery Problem with Time Windows . In Proc. GECCO. ACM, USA, 176--179 . M. Blocho, T. Jastrzab, and J. Nalepa. 2022. Cooperative Co-Evolutionary Memetic Algorithm for Pickup and Delivery Problem with Time Windows. In Proc. GECCO. ACM, USA, 176--179.
2. M. Blocho and J. Nalepa . 2015. A Parallel Algorithm for Minimizing the Fleet Size in the Pickup and Delivery Problem with Time Windows . In Proc. EuroMPI. ACM. M. Blocho and J. Nalepa. 2015. A Parallel Algorithm for Minimizing the Fleet Size in the Pickup and Delivery Problem with Time Windows. In Proc. EuroMPI. ACM.
3. Vehicle routing: Review of benchmark datasets
4. Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification
5. J. Nalepa and M. Blocho . 2017. A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows . In Proc. PDP. 1--8. J. Nalepa and M. Blocho. 2017. A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows. In Proc. PDP. 1--8.