An improved GRMOD heuristic for container loading problem
The Container Loading Problem (CLP) is a study of loading a subset of goods or parcels of different sizes into a three-dimensional rectangular container of fixed dimensions such that the volume of packed boxes is maximized. In this paper, an improved version of the modified George and Robinson heuri...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
AIP Publishing LLC
2013
|
| 在線閱讀: | http://psasir.upm.edu.my/id/eprint/57206/1/An%20improved%20GRMOD%20heuristic%20for%20container%20loading%20problem.pdf http://psasir.upm.edu.my/id/eprint/57206/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | The Container Loading Problem (CLP) is a study of loading a subset of goods or parcels of different sizes into a three-dimensional rectangular container of fixed dimensions such that the volume of packed boxes is maximized. In this paper, an improved version of the modified George and Robinson heuristic (iGRMOD) is developed to solve the CLP. Comparison computational results on benchmark data set from the literature will be presented. The performances of the iGRMOD are superior than the GRMOD and other heuristics reported in the literature. |
|---|