Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Best-first search methods for constrained two-dimensional cutting stock problems
Operations Research
On the run-time behaviour of stochastic local search algorithms for SAT
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
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
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
Parallel Metaheuristics: A New Class of Algorithms
Parallel Metaheuristics: A New Class of Algorithms
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
Parallel hyperheuristic: a self-adaptive island-based model for multi-objective optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Metaheuristics for solving a real-world frequency assignment problem in GSM networks
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Evolutionary based heuristic for bin packing problem
Computers and Industrial Engineering
Handbook of Parametric and Nonparametric Statistical Procedures
Handbook of Parametric and Nonparametric Statistical Procedures
No free lunch theorems for optimization
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
On-line bin packing with arbitrary release times
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Parallel island-based multiobjectivised memetic algorithms for a 2D packing problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Journal of Global Optimization
| Hi-index | 0.00 |
This work presents several approaches used to deal with the 2D packing problem proposed in the GECCO 2008 contest session. A memetic algorithm, together with the specifically designed local search and variation operators, are presented. A novel parallel model was used to parallelize the approach. The model is a hybrid algorithm which combines a parallel island-based scheme with a hyperheuristic approach. An adaptive behavior is added to the island-based model by applying the hyperheuristic procedure. The main operation of the island-based model is kept, but the configurations of the memetic algorithms executed on each island are dynamically mapped. The model grants more computational resources to those configurations that show a more promising behavior. For this purpose a specific criterion was designed in order to select the configurations with better success expectations. Computational results obtained for the contest problem demonstrate the validity of the proposed model. The best reported solutions for the problem contest instance have been achieved by using the here presented approaches.