Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

A parallel memetic algorithm for solving complex transportation problems.

2013/09/N/ST6/03461

Keywords:

PDPTW,parallel algorithm,memetic algorithm,complex transportation problems,NP-hard problems

Descriptors:

  • ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory

Panel:

ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution :

Politechnika Śląska, Wydział Automatyki, Elektroniki i Informatyki

woj. śląskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

Jakub Nalepa 

Number of co-investigators in the project: 3

Call: PRELUDIUM 5 - announced on 2013-03-15

Amount awarded: 148 512 PLN

Project start date (Y-m-d): 2014-04-24

Project end date (Y-m-d): 2017-04-23

Project duration:: 36 months (the same as in the proposal)

Project status: Project settled

Information in the final report

  • Publication in academic press/journals (4)
  • Articles in post-conference publications (12)
  • Book publications / chapters in book publications (1)
  1. Adaptive co-operation in parallel memetic algorithms for rich vehicle routing problems
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Academic press:
    International Journal of Grid and Utility Computing (rok: 2018, tom: 9(1), strony: 179-192), Wydawca: Inderscience Publishers
    Status:
    Published
    DOI:
    10.1504/IJGUC.2018.091724 - link to the publication
  2. Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Academic press:
    Soft Computing (rok: 2015, tom: -, strony: 45310), Wydawca: Springer Berlin Heidelberg
    Status:
    Published
    DOI:
    10.1007/s00500-015-1642-4 - link to the publication
  3. Co-operation in the Parallel Memetic Algorithm
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Academic press:
    International Journal of Parallel Programming (rok: 2014, tom: -, strony: 45319), Wydawca: Springer US
    Status:
    Published
    DOI:
    10.1007/s10766-014-0343-4 - link to the publication
  4. Adaptive guided ejection search for pickup and delivery with time windows
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Academic press:
    Journal of Intelligent and Fuzzy Systems (rok: 2017, tom: 32(2), strony: 1547-1559), Wydawca: IOS Press, STM Publishing House
    Status:
    Published
    DOI:
    10.3233/JIFS-169149 - link to the publication
  1. A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Conference:
    25th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP 2017) (rok: 2017, ), Wydawca: IEEE
    Data:
    konferencja 6-8 marca
    Status:
    Published
  2. Complexity Analysis of the Parallel Algorithm for Minimizing the Fleet Size in the Pickup and Delivery Problem with Time Windows
    Authors:
    Mirosław Błocho, Jakub Nalepa
    Conference:
    25th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP 2017), Companion Material (Work in Progress Session) (rok: 2017, ), Wydawca: Materiały dodatkowe wydane przez organizatorów
    Data:
    konferencja 6-8 marca
    Status:
    Published
  3. Impact of Parallel Memetic Algorithm Parameters on Its Efficacy
    Authors:
    Mirosław Błocho, Jakub Nalepa
    Conference:
    11th International Conference: Beyond Databases, Architectures and Structures (rok: 2015, ), Wydawca: Springer
    Data:
    konferencja 26-29 maja
    Status:
    Published
    DOI:
    link to the publication
  4. Parameter-less (meta)heuristics for vehicle routing problems
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Conference:
    Genetic and Evolutionary Computation Conference, GECCO 2018 (rok: 2018, ), Wydawca: ACM
    Data:
    konferencja 15-19 lipca 2018
    Status:
    Published
  5. Is your parallel algorithm correct?
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Conference:
    Federated Conference on Computer Science and Information Systems (FedCSIS) (rok: 2016, ), Wydawca: Annals of Computer Science and Information Systems (ACSIS)
    Data:
    konferencja 11-14 września
    Status:
    Published
  6. Temporally adaptive co-operation schemes
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Conference:
    The 11th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC 2016) (rok: 2016, ), Wydawca: Springer, Cham
    Data:
    konferencja 5-7 listopada
    Status:
    Published
  7. A Parallel Algorithm for Minimizing the Fleet Size in the Pickup and Delivery Problem with Time Windows
    Authors:
    Mirosław Błocho, Jakub Nalepa
    Conference:
    22nd European MPI Users' Group Meeting (rok: 2015, ), Wydawca: ACM
    Data:
    konferencja 21-23 września
    Status:
    Published
  8. Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows
    Authors:
    Mirosław Błocho, Jakub Nalepa
    Conference:
    International Conference on Man-Machine Interactions (ICMMI 2017) (rok: 2018, ), Wydawca: Springer
    Data:
    konferencja 3-6 października 2017
    Status:
    Published
  9. Dynamically Adaptive Genetic Algorithm to Select Training Data for SVMs
    Authors:
    Michał Kawulok, Jakub Nalepa
    Conference:
    14th Ibero-American Conference on Artificial Intelligence (rok: 2014, ), Wydawca: Springer International Publishing
    Data:
    konferencja 24-27 listopada
    Status:
    Published
    DOI:
    link to the publication
  10. Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Conference:
    8th Asian Conference on Intelligent Information and Database Systems (rok: 2016, ), Wydawca: Springer
    Data:
    konferencja 14-16 marca
    Status:
    Published
  11. A Parallel Algorithm with the Search Space Partition for the Pickup and Delivery with Time Windows
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Conference:
    2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) (rok: 2015, ), Wydawca: IEEE
    Data:
    konferencja 4-6 listopada
    Status:
    Published
  12. LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows
    Authors:
    Mirosław Błocho, Jakub Nalepa
    Conference:
    The 17th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2017, część EvoSTAR 2017) (rok: 2017, ), Wydawca: Springer, Cham
    Data:
    konferencja 19-21 kwietnia
    Status:
    Published
  1. Verification of Correctness of Parallel Algorithms in Practice
    Authors:
    Jakub Nalepa, Mirosław Błocho
    Book:
    Recent Advances in Computational Optimization, Results of the Workshop on Computational Optimization WCO 2016 (rok: 2018, tom: 717, strony: 135-151), Wydawca: Springer International Publishing
    Status:
    Published

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy