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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
AIP Publishing LLC
2013
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/57206/ http://psasir.upm.edu.my/id/eprint/57206/1/An%20improved%20GRMOD%20heuristic%20for%20container%20loading%20problem.pdf |
| _version_ | 1848853300475068416 |
|---|---|
| author | Ho, Ziao Fung Lee, Lai Soon Abdul Majid, Zanariah Seow, Hsin Vonn |
| author_facet | Ho, Ziao Fung Lee, Lai Soon Abdul Majid, Zanariah Seow, Hsin Vonn |
| author_sort | Ho, Ziao Fung |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T10:51:47Z |
| format | Conference or Workshop Item |
| id | upm-57206 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:51:47Z |
| publishDate | 2013 |
| publisher | AIP Publishing LLC |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-572062017-09-26T03:43:16Z http://psasir.upm.edu.my/id/eprint/57206/ An improved GRMOD heuristic for container loading problem Ho, Ziao Fung Lee, Lai Soon Abdul Majid, Zanariah Seow, Hsin Vonn 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. AIP Publishing LLC 2013 Conference or Workshop Item PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/57206/1/An%20improved%20GRMOD%20heuristic%20for%20container%20loading%20problem.pdf 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). 10.1063/1.4823952 |
| spellingShingle | Ho, Ziao Fung Lee, Lai Soon Abdul Majid, Zanariah Seow, Hsin Vonn An improved GRMOD heuristic for container loading problem |
| title | An improved GRMOD heuristic for container loading problem |
| title_full | An improved GRMOD heuristic for container loading problem |
| title_fullStr | An improved GRMOD heuristic for container loading problem |
| title_full_unstemmed | An improved GRMOD heuristic for container loading problem |
| title_short | An improved GRMOD heuristic for container loading problem |
| title_sort | improved grmod heuristic for container loading problem |
| url | http://psasir.upm.edu.my/id/eprint/57206/ http://psasir.upm.edu.my/id/eprint/57206/ http://psasir.upm.edu.my/id/eprint/57206/1/An%20improved%20GRMOD%20heuristic%20for%20container%20loading%20problem.pdf |