default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiroslaw Blocho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Tomasz Jastrzab
, Michal Myller, Lukasz Tulczyjew, Miroslaw Blocho, Michal Kawulok, Adam Czornik, Jakub Nalepa:
Standardized validation of vehicle routing algorithms. Appl. Intell. 54(2): 1335-1364 (2024)- 2018
- [j4]Jakub Nalepa, Miroslaw Blocho:
Adaptive cooperation in parallel memetic algorithms for rich vehicle routing problems. Int. J. Grid Util. Comput. 9(2): 179-192 (2018) - 2017
- [j3]Jakub Nalepa, Miroslaw Blocho:
Adaptive guided ejection search for pickup and delivery with time windows. J. Intell. Fuzzy Syst. 32(2): 1547-1559 (2017) - 2016
- [j2]Jakub Nalepa, Miroslaw Blocho:
Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput. 20(6): 2309-2327 (2016) - 2015
- [j1]Jakub Nalepa, Miroslaw Blocho:
Co-operation in the Parallel Memetic Algorithm. Int. J. Parallel Program. 43(5): 812-839 (2015)
Conference and Workshop Papers
- 2023
- [c17]Miroslaw Blocho, Tomasz Jastrzab, Jakub Nalepa:
Parallel Cooperative Memetic Co-evolution for VRPTW. GECCO Companion 2023: 53-54 - 2022
- [c16]Miroslaw Blocho, Tomasz Jastrzab, Jakub Nalepa:
Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows. GECCO Companion 2022: 176-179 - [c15]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: 80-87 - 2018
- [c14]Jakub Nalepa, Miroslaw Blocho:
Parameter-less (meta)heuristics for vehicle routing problems. GECCO (Companion) 2018: 27-28 - 2017
- [c13]Miroslaw Blocho, Jakub Nalepa:
LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows. EvoCOP 2017: 124-140 - [c12]Miroslaw Blocho, Jakub Nalepa:
Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows. ICMMI 2017: 471-480 - [c11]Jakub Nalepa, Miroslaw Blocho:
A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows. PDP 2017: 1-8 - 2016
- [c10]Jakub Nalepa, Miroslaw Blocho:
Temporally Adaptive Co-operation Schemes. 3PGCIC 2016: 145-156 - [c9]Jakub Nalepa, Miroslaw Blocho:
Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows. ACIIDS (1) 2016: 388-398 - [c8]Jakub Nalepa, Miroslaw Blocho:
Is Your Parallel Algorithm Correct? FedCSIS (Position Papers) 2016: 87-93 - 2015
- [c7]Jakub Nalepa, Miroslaw Blocho:
A Parallel Algorithm with the Search Space Partition for the Pickup and Delivery with Time Windows. 3PGCIC 2015: 92-99 - [c6]Miroslaw Blocho, Jakub Nalepa:
Impact of Parallel Memetic Algorithm Parameters on Its Efficacy. BDAS 2015: 299-308 - [c5]Miroslaw Blocho, Jakub Nalepa:
A Parallel Algorithm for Minimizing the Fleet Size in the Pickup and Delivery Problem with Time Windows. EuroMPI 2015: 15:1-15:2 - 2013
- [c4]Miroslaw Blocho, Zbigniew J. Czech:
A Parallel Memetic Algorithm for the Vehicle Routing Problem with Time Windows. 3PGCIC 2013: 144-151 - [c3]Jakub Nalepa, Miroslaw Blocho, Zbigniew J. Czech:
Co-operation Schemes for the Parallel Memetic Algorithm. PPAM (1) 2013: 191-201 - 2012
- [c2]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: 1239-1246 - 2011
- [c1]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: 255-265
Informal and Other Publications
- 2017
- [i1]Miroslaw Blocho, Jakub Nalepa:
Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows. CoRR abs/1704.06724 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
