Miroslaw Blocho

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