Skip to main content
Journal Article

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3261 441-450
DOI: 10.1007/978-3-540-30198-1_45
48Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Karabulut, K., & Inceoĝlu, M. M. (2004). A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3261, 441–450. https://doi.org/10.1007/978-3-540-30198-1_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free