A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem

Authors:
José Fernando Gonçalves;Mauricio G. Resende
Affiliations:
LIAAD, Faculdade de Economia do Porto, Porto, Portugal 4200-464;Algorithms and Optimization Research Department, AT&T Labs Research, Florham Park, USA 07932
Venue:
Journal of Combinatorial Optimization
Year:
2011

Citing 12
Cited 5

Developing a simulated annealing algorithm for the cutting stock problem

Computers and Industrial Engineering
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem

Computers and Industrial Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Hybrid Genetic Algorithm for Assembly Line Balancing

Journal of Heuristics
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

Mathematics of Operations Research
An evolutionary algorithm for manufacturing cell formation

Computers and Industrial Engineering
A hybrid genetic algorithm for the weight setting problem in OSPF-IS-IS routing

Networks
Survivable IP network design with OSPF routing

Networks - Special Issue on Multicommodity Flows and Network Design
An optimal algorithm for rectangle placement

Operations Research Letters
On the two-dimensional Knapsack Problem

Operations Research Letters

Biased random-key genetic algorithms for combinatorial optimization

Journal of Heuristics
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem

Proceedings of the 15th annual conference on Genetic and evolutionary computation
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

Computers and Operations Research
Randomized heuristics for handover minimization in mobility networks

Journal of Heuristics
A beam search approach to the container loading problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a constrained two-dimensional (2D), non-guillotine restricted, packing problem, where a fixed set of small rectangles has to be placed into a larger stock rectangle so as to maximize the value of the rectangles packed. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We propose also a new fitness function to drive the optimization. The approach is tested on a set of instances taken from the literature and compared with other approaches. The experimental results validate the quality of the solutions and the effectiveness of the proposed algorithm.