A hybrid genetic algorithm for packing in 3d with deepest bottom left with fill method

Authors:
Korhan Karabulut;Mustafa Murat İnceoğlu
Affiliations:
Department of Computer Engineering, Ege University, Bornova, Izmir, Turkey;Department of Computer Engineering, Ege University, Bornova, Izmir, Turkey
Venue:
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Year:
2004

Citing 7
Cited 3

A genetic algorithm for packing in three dimensions

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
A weight-coded genetic algorithm for the multiple container packing problem

Proceedings of the 1999 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for the Multiple Container Packing Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
The Three-Dimensional Bin Packing Problem

Operations Research
Guided Local Search for the Three-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
Applying adaptive algorithms to epistatic domains

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Multi-container loading with non-convex 3D shapes using a GA/TS hybrid

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Data Structures for Higher-Dimensional Rectilinear Packing

INFORMS Journal on Computing
An effective shaking procedure for 2D and 3D strip packing problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Three dimensional bin packing problems arise in industrial applications like container ship loading, pallet loading, plane cargo management and warehouse management, etc. In this paper, a hybrid genetic algorithm (GA) is used for regular 3D strip packing. The Genetic Algorithm is hybridized with the presented Deepest Bottom Left with Fill (DBLF) method. Several heuristic methods have also been used for comparison with the hybrid GA.