Citation
Ho, Ziao Fung and Lee, Lai Soon and Abdul Majid, Zanariah and Seow, Hsin Vonn
(2013)
An improved GRMOD heuristic for container loading problem.
In: International Conference on Mathematical Sciences and Statistics 2013 (ICMSS2013), 5-7 Feb. 2013, Kuala Lumpur, Malaysia. (pp. 439-443).
Abstract
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.
Download File
|
Additional Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Faculty of Science Institute for Mathematical Research |
| DOI Number: | https://doi.org/10.1063/1.4823952 |
| Publisher: | AIP Publishing LLC |
| Keywords: | Container loading; Heuristic |
| Depositing User: | Nabilah Mustapa |
| Date Deposited: | 26 Sep 2017 03:43 |
| Last Modified: | 26 Sep 2017 03:43 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1063/1.4823952 |
| URI: | http://psasir.upm.edu.my/id/eprint/57206 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |