Constrained two dimensional bin packing using a genetic algorithm

Authors:
Wee Sng Khoo;P. Saratchandran;N. Sundararajan
Affiliations:
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
Venue:
Recent advances in intelligent paradigms and applications
Year:
2003

Citing 8
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
An introduction to genetic algorithms

An introduction to genetic algorithms
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
Hybrid genetic algorithms for constrained placement problems

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this chapter, a new genetic algorithm is proposed for packing rectangular cargos of different sizes into a given 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 proposed genetic algorithm is compared with the heuristic method of Gehring et.al. and the genetic algorithm of Hwang et. al. Results indicate that the proposed method is superior in terms of packing efficiency and solution time.