Parallel island-based multiobjectivised memetic algorithms for a 2D packing problem


Bin Packing problems are NP-hard problems with many practical applications. A variant of a Bin Packing Problem was proposed in the GECCO 2008 competition session. The best results were achieved by a mono-objective Memetic Algorithm (MA). In order to reduce the execution time, it was parallelised using an island-based model. High quality results were… (More)
DOI: 10.1145/2001576.2001793


10 Figures and Tables