On the use of human-guided evolutionary algorithms for tackling 2D packing problems

Authors:
Javier Espinar;Carlos Cotta;Antonio J. Fernández Leiva
Affiliations:
Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Málaga - Spain;Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Málaga - Spain;Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Málaga - Spain
Venue:
IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
Year:
2011

Citing 10
Cited 0

An efficient processor allocation algorithm using two-dimensional packing

Journal of Parallel and Distributed Computing
Comparison of meta-heuristic algorithms for clustering rectangles

Computers and Industrial Engineering
Genetic Algorithms and Grouping Problems

Genetic Algorithms and Grouping Problems
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems

Artificial Intelligence Review
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

INFORMS Journal on Computing
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
Reactive GRASP for the strip-packing problem

Computers and Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation

IEEE Transactions on Computers
Sequential vector packing

Theoretical Computer Science
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a 2D packing problem in which a collection of rectangular objects have to be arranged within a larger rectangular area of fixed width, such that its height is minimized. This problem is tackled using evolutionary algorithms that combine permutational decoders and GRASP-based principles. It is shown that this approach can be improved by allowing the user interact with the algorithm, tuning the greediness of the genotype-to-phenotype decoding. Experiments are presented on three different problem instances with sizes ranging from 19 up to 49 objects.