Abstract
The packing problem study how to pack multiple objects without overlap. Various exact and approximate algorithms have been developed for two-dimensional regular and irregular packing as well as three-dimensional bin packing. However, few results are reported for three-dimensional irregular packing problems. This paper will develop a method for solving threedimensional irregular packing problems. A three-grid approximation technique is first introduced to approximate irregular objects. Then, a hybrid heuristic method is developed to place and compact each individual objects where chaos search is embedded into fire y algorithm in order to enhance the algorithm's diversity for optimizing packing sequence and orientations. Results from several computational experiments demonstrate the effectiveness of the hybrid algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 409-429 |
| Number of pages | 21 |
| Journal | Journal of Industrial and Management Optimization |
| Volume | 16 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2020 |
| Externally published | Yes |
Keywords
- Chaos search
- Firefly algorithm
- Irregular packing
- Raster approximation
Fingerprint
Dive into the research topics of 'A hybrid chaos firefly algorithm for three-dimensional irregular packing problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver