Analysis of Distributed Genetic Algorithms for Solving a Strip Packing Problem

Authors:
Carolina Salto;Enrique Alba;Juan M. Molina
Affiliations:
Universidad Nacional de La Pampa, La Pampa, Argentina;E.T.S.I. Informátic, Grupo GISUM (NEO), Universidad de Málaga, Málaga,;E.T.S.I. Informátic, Grupo GISUM (NEO), Universidad de Málaga, Málaga,
Venue:
Large-Scale Scientific Computing
Year:
2009

Citing 7
Cited 0

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Handbook of Evolutionary Computation

Handbook of Evolutionary Computation
Distributed Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics
Heuristics for large strip packing problems with guillotine patterns: an empirical study

Metaheuristics
Parallel Metaheuristics: A New Class of Algorithms

Parallel Metaheuristics: A New Class of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a solution of a constrained two dimensional strip packing problem using genetic algorithms. The constraint consists of considering three-stage guillotine patterns. This is quite a real constraint motivated by technological considerations in some industries. An analysis of including distributed population ideas and parallelism into the basic genetic algorithm is carried out to solve the problem accurately and efficiently. Experimental evidence in this work shows that the proposed parallel versions of the distributed algorithms outperform their sequential counterparts in time, although there are no significant differences either in the mean best values obtained or in the effort.