MPI: The Complete Reference
A New Parallel Approach for Multi-dimensional Packing Problem
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Genetic diversity as an objective in multi-objective evolutionary algorithms
Evolutionary Computation
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Parallel Metaheuristics: A New Class of Algorithms
Parallel Metaheuristics: A New Class of Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Non-genetic transmission of memes by diffusion
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A memetic algorithm and a parallel hyperheuristic island-based model for a 2D packing problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Searching under multi-evolutionary pressures
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
Parallel island-based multiobjectivised memetic algorithms for a 2D packing problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Considerations in engineering parallel multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Classification of adaptive memetic algorithms: a comparative study
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
2D cutting stock problem: a new parallel algorithm and bounds
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Packing problems are np-hard problems with several practical applications. A variant 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 multiobjectivised 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 generation 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 environments, 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.