| Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows J Nalepa, M Blocho Soft Computing 20, 2309-2327, 2016 | 112 | 2016 |
| Co-operation in the parallel memetic algorithm J Nalepa, M Blocho International Journal of Parallel Programming 43, 812-839, 2015 | 50 | 2015 |
| A parallel memetic algorithm for the vehicle routing problem with time windows M Blocho, ZJ Czech 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and …, 2013 | 34 | 2013 |
| Heuristics, metaheuristics, and hyperheuristics for rich vehicle routing problems M Blocho Smart Delivery Systems, 101-156, 2020 | 29 | 2020 |
| Adaptive guided ejection search for pickup and delivery with time windows J Nalepa, M Blocho Journal of Intelligent & Fuzzy Systems 32 (2), 1547-1559, 2017 | 16 | 2017 |
| Enhanced guided ejection search for the pickup and delivery problem with time windows J Nalepa, M Blocho Intelligent Information and Database Systems: 8th Asian Conference, ACIIDS …, 2016 | 16 | 2016 |
| LCS-based selective route exchange crossover for the pickup and delivery problem with time windows M Blocho, J Nalepa Evolutionary Computation in Combinatorial Optimization: 17th European …, 2017 | 13 | 2017 |
| A parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows M Blocho, J Nalepa Proceedings of the 22nd European MPI Users' Group Meeting, 1-2, 2015 | 13 | 2015 |
| A parallel EAX-based algorithm for minimizing the number of routes in the vehicle routing problem with time windows M Blocho, ZJ Czech 2012 IEEE 14th International Conference on High Performance Computing and …, 2012 | 13 | 2012 |
| A parallel memetic algorithm for the pickup and delivery problem with time windows J Nalepa, M Blocho 2017 25th Euromicro International Conference on Parallel, Distributed and …, 2017 | 12 | 2017 |
| Co-operation schemes for the parallel memetic algorithm J Nalepa, M Blocho, ZJ Czech Parallel Processing and Applied Mathematics: 10th International Conference …, 2014 | 12 | 2014 |
| A parallel algorithm for minimizing the number of routes in the vehicle routing problem with time windows M Błocho, ZJ Czech Parallel Processing and Applied Mathematics: 9th International Conference …, 2012 | 12 | 2012 |
| A parallel algorithm with the search space partition for the pickup and delivery with time windows J Nalepa, M Blocho 2015 10th International Conference on P2P, Parallel, Grid, Cloud and …, 2015 | 11 | 2015 |
| An improved route minimization algorithm for the vehicle routing problem with time windows M Błocho, ZJ Czech Studia Informatica 32 (3B), 5-19, 2011 | 10 | 2011 |
| Exact algorithms for solving rich vehicle routing problems M Blocho Smart Delivery Systems, 93-99, 2020 | 7 | 2020 |
| Parallel algorithms for solving rich vehicle routing problems M Blocho Smart Delivery Systems, 185-201, 2020 | 5 | 2020 |
| Adaptive cooperation in parallel memetic algorithms for rich vehicle routing problems J Nalepa, M Blocho International Journal of Grid and Utility Computing 9 (2), 179-192, 2018 | 5 | 2018 |
| Temporally adaptive co-operation schemes J Nalepa, M Blocho Advances on P2P, Parallel, Grid, Cloud and Internet Computing: Proceedings …, 2017 | 5 | 2017 |
| Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows M Blocho, T Jastrzab, J Nalepa Proceedings of the Genetic and Evolutionary Computation Conference Companion …, 2022 | 2 | 2022 |
| Complexity analysis of the parallel guided ejection search for the pickup and delivery problem with time windows M Blocho, J Nalepa arXiv preprint arXiv:1704.06724, 2017 | 2 | 2017 |
