Miroslaw Blocho

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 15

Top Topics

Memetic Algorithm

Benchmark Instances

Vehicle Routing

Top Venues

GECCO Companion

GECCO (Companion)

Publications

Tomasz Jastrzab, Michal Myller, Lukasz Tulczyjew, Miroslaw Blocho, Michal Kawulok, Adam Czornik, Jakub Nalepa
Standardized validation of vehicle routing algorithms. Appl. Intell. 54 (2) (2024)
Miroslaw Blocho, Tomasz Jastrzab, Jakub Nalepa
Parallel Cooperative Memetic Co-evolution for VRPTW. GECCO Companion (2023)
Miroslaw Blocho, Tomasz Jastrzab, Jakub Nalepa
Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows. GECCO Companion (2022)
Tomasz Jastrzab, Michal Myller, Lukasz Tulczyjew, Miroslaw Blocho, Wojciech Ryczko, Michal Kawulok, Jakub Nalepa
Particle Swarm Optimization Configures the Route Minimization Algorithm. ICCS (1) (2022)
Jakub Nalepa, Miroslaw Blocho
Adaptive cooperation in parallel memetic algorithms for rich vehicle routing problems. Int. J. Grid Util. Comput. 9 (2) (2018)
Jakub Nalepa, Miroslaw Blocho
Parameter-less (meta)heuristics for vehicle routing problems. GECCO (Companion) (2018)
Miroslaw Blocho, Jakub Nalepa
LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows. EvoCOP (2017)
Jakub Nalepa, Miroslaw Blocho
Adaptive guided ejection search for pickup and delivery with time windows. J. Intell. Fuzzy Syst. 32 (2) (2017)
Miroslaw Blocho, Jakub Nalepa
Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows. CoRR (2017)
Jakub Nalepa, Miroslaw Blocho
A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows. PDP (2017)
Miroslaw Blocho, Jakub Nalepa
Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows. ICMMI (2017)
Jakub Nalepa, Miroslaw Blocho
Is Your Parallel Algorithm Correct? FedCSIS (Position Papers) (2016)
Jakub Nalepa, Miroslaw Blocho
Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows. ACIIDS (1) (2016)
Jakub Nalepa, Miroslaw Blocho
Temporally Adaptive Co-operation Schemes. 3PGCIC (2016)
Jakub Nalepa, Miroslaw Blocho
Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput. 20 (6) (2016)
Jakub Nalepa, Miroslaw Blocho
Co-operation in the Parallel Memetic Algorithm. Int. J. Parallel Program. 43 (5) (2015)
Jakub Nalepa, Miroslaw Blocho
A Parallel Algorithm with the Search Space Partition for the Pickup and Delivery with Time Windows. 3PGCIC (2015)
Miroslaw Blocho, Jakub Nalepa
A Parallel Algorithm for Minimizing the Fleet Size in the Pickup and Delivery Problem with Time Windows. EuroMPI (2015)
Miroslaw Blocho, Jakub Nalepa
Impact of Parallel Memetic Algorithm Parameters on Its Efficacy. BDAS (2015)
Miroslaw Blocho, Zbigniew J. Czech
A Parallel Memetic Algorithm for the Vehicle Routing Problem with Time Windows. 3PGCIC (2013)
Jakub Nalepa, Miroslaw Blocho, Zbigniew J. Czech
Co-operation Schemes for the Parallel Memetic Algorithm. PPAM (1) (2013)
Miroslaw Blocho, Zbigniew J. Czech
A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows. HPCC-ICESS (2012)
Miroslaw Blocho, Zbigniew J. Czech
A Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows. PPAM (1) (2011)