Analysing a hybrid model-based evolutionary algorithm for a hard grouping problem

Publikation: Beitrag in Buch/Bericht/TagungsbandKonferenzbeitragBegutachtung

2 Zitate (Scopus)

Abstract

We present a new hybrid model-based algorithm called Memetic Path Relinking (MemPR). MemPR incorporates ideas of memetic, evolutionary, model-based algorithms and path relinking. It uses different operators that compete to fill a small population of high quality solutions. We present a new hard grouping problem derived from a real world transport lot building problem. In order to better understand the algorithm as well as the problem we analyse the impact of the different operators on solution quality and which operators perform best at which stage of optimisation. Finally we compare MemPR to other state-of-the-art algorithms and find that MemPR outperforms them on real-world problem instances.

OriginalspracheEnglisch
TitelComputer Aided Systems Theory – EUROCAST 2017 - 16th International Conference, Revised Selected Papers
Redakteure/-innenRoberto Moreno-Diaz, Alexis Quesada-Arencibia, Franz Pichler
Herausgeber (Verlag)Springer
Seiten347-354
Seitenumfang8
ISBN (Print)9783319747170
DOIs
PublikationsstatusVeröffentlicht - 2018
Veranstaltung16th International Conference on Computer Aided Systems Theory, EUROCAST 2017 - Las Palmas de Gran Canaria, Spanien
Dauer: 19 Feb 201724 Feb 2017

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band10671 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz16th International Conference on Computer Aided Systems Theory, EUROCAST 2017
Land/GebietSpanien
OrtLas Palmas de Gran Canaria
Zeitraum19.02.201724.02.2017

Fingerprint

Untersuchen Sie die Forschungsthemen von „Analysing a hybrid model-based evolutionary algorithm for a hard grouping problem“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren