A Genetic Approach for Two Dimensional Packing with Constraints

Authors:
Wee Sng Khoo;P. Saratchandran;N. Sundararajan
Affiliations:
-;-;-
Venue:
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Year:
2001

Citing 6
Cited 0

Efficient floorplan area optimization

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
An optimal algorithm for floorplan area optimization

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Genetic algorithms: A Survey

Computer
Genetic-Algorithm Programming Environments

Computer
A new algorithm for floorplan design

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new genetic algorithm based method is proposed for packing rectangular cargos of different sizes into a given loading area in a two dimensional framework. A novel penalty function method is proposed for checking the solution strings that have violated the loading area's aspect constraints. This method penalizes the solution strings based on the extent by which they violate the length and breadth constraints. The results from the proposed genetic algorithm are compared with the popular heuristic method of Gehring et. al. to show the advantages of this method.