Miroslaw Blocho

According to our database, Miroslaw Blocho authored at least 23 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Standardized validation of vehicle routing algorithms.

Tomasz Jastrzab, Michal Myller, Lukasz Tulczyjew, Miroslaw Blocho, Michal Kawulok, Adam Czornik, Jakub Nalepa

Appl. Intell., 2024

2023

Parallel Cooperative Memetic Co-evolution for VRPTW.

Miroslaw Blocho, Tomasz Jastrzab, Jakub Nalepa

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

2022

Particle Swarm Optimization Configures the Route Minimization Algorithm.

Tomasz Jastrzab, Michal Myller, Lukasz Tulczyjew, Miroslaw Blocho, Wojciech Ryczko, Michal Kawulok, Jakub Nalepa

Proceedings of the Computational Science - ICCS 2022, 2022

Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows.

Miroslaw Blocho, Tomasz Jastrzab, Jakub Nalepa

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

2018

Adaptive cooperation in parallel memetic algorithms for rich vehicle routing problems.

Jakub Nalepa, Miroslaw Blocho

Int. J. Grid Util. Comput., 2018

Parameter-less (meta)heuristics for vehicle routing problems.

Jakub Nalepa, Miroslaw Blocho

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

2017

Adaptive guided ejection search for pickup and delivery with time windows.

Jakub Nalepa, Miroslaw Blocho

J. Intell. Fuzzy Syst., 2017

Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows.

Miroslaw Blocho, Jakub Nalepa

CoRR, 2017

A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows.

Jakub Nalepa, Miroslaw Blocho

Proceedings of the 25th Euromicro International Conference on Parallel, 2017

Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows.

Miroslaw Blocho, Jakub Nalepa

Proceedings of the Man-Machine Interactions 5, 2017

LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows.

Miroslaw Blocho, Jakub Nalepa

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2017

2016

Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows.

Jakub Nalepa, Miroslaw Blocho

Soft Comput., 2016

Is Your Parallel Algorithm Correct?

Jakub Nalepa, Miroslaw Blocho

Proceedings of the Position Papers of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows.

Jakub Nalepa, Miroslaw Blocho

Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016

Temporally Adaptive Co-operation Schemes.

Jakub Nalepa, Miroslaw Blocho

Proceedings of the Advances on P2P, 2016

2015

Co-operation in the Parallel Memetic Algorithm.

Jakub Nalepa, Miroslaw Blocho

Int. J. Parallel Program., 2015

A Parallel Algorithm for Minimizing the Fleet Size in the Pickup and Delivery Problem with Time Windows.

Miroslaw Blocho, Jakub Nalepa

Proceedings of the 22nd European MPI Users' Group Meeting, 2015

Impact of Parallel Memetic Algorithm Parameters on Its Efficacy.

Miroslaw Blocho, Jakub Nalepa

Proceedings of the Beyond Databases, Architectures and Structures, 2015

A Parallel Algorithm with the Search Space Partition for the Pickup and Delivery with Time Windows.

Jakub Nalepa, Miroslaw Blocho

Proceedings of the 10th International Conference on P2P, 2015

2013

Co-operation Schemes for the Parallel Memetic Algorithm.

Jakub Nalepa, Miroslaw Blocho, Zbigniew J. Czech

Proceedings of the Parallel Processing and Applied Mathematics, 2013

A Parallel Memetic Algorithm for the Vehicle Routing Problem with Time Windows.

Miroslaw Blocho, Zbigniew J. Czech

Proceedings of the Eighth International Conference on P2P, 2013

2012

A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows.

Miroslaw Blocho, Zbigniew J. Czech

Proceedings of the 14th IEEE International Conference on High Performance Computing and Communication & 9th IEEE International Conference on Embedded Software and Systems, 2012

2011

A Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows.

Miroslaw Blocho, Zbigniew J. Czech

Proceedings of the Parallel Processing and Applied Mathematics, 2011