Analysing a Hybrid Model-Based Evolutionary Algorithm for a Hard Grouping Problem

Outline

S. Raggl, A. Beham, S. Wagner, M. Affenzeller - Analysing a Hybrid Model-Based Evolutionary Algorithm for a Hard Grouping Problem - Lecture Notes in Computer Science 10671, Las Palmas de Gran Canaria, Spanien, 2017, pp. 347-354

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 dierent operators that compete to ll 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 dierent operators on solution quality and which operators perform best at which stage of optimisation. Finally we compare MemPR to other state-of-theart algorithms and nd that MemPR outperforms them on real-world problem instances.