Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem

摘要

Packing problems are NP-hard problems with several practical applications. A vari-ant of a 2d Packing Problem (2dpp) was proposed in the GECCO 2008 competition session. In this paper, Memetic Algorithms (mas) and Hyperheuristics are applied to a multiobjec-tivised version of the 2DPP. Multiobjectivisation is the reformulation of a mono-objective problem into a multi-objective one. The main aim of multiobjectivising the 2DPP is to avoid stagnation in local optima. First generation MAS refers to hybrid algorithms that combine a population-based global search with an individual learning process. A novel first gener-ation MA is proposed, and an original multiobjectivisation method is applied to the 2DPP. In addition, with the aim of facilitating the application of such first generation mas from the point of view of the parameter setting, and of enabling their usage in parallel environ-ments, a parallel hyperheuristic is also applied. Particularly, the method applied here is a hybrid approach which combines a parallel island-based model and a hyperheuristic. The main objective of this work is twofold. Firstly, to analyse the advantages and drawbacks of a set of first generation MAS. Secondly, to attempt to avoid those drawbacks by applying a parallel hyperheuristic. Moreover, robustness and scalability analyses of the parallel scheme are included. Finally, we should note that our methods improve on the current best-known solutions for the tested instances of the 2DPP.