Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Ho, Ziao Fung, Lee, Lai Soon, Abdul Majid, Zanariah, Seow, Hsin Vonn
Format: Conference or Workshop Item
Language:English
Published: AIP Publishing LLC 2013
Online Access: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/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.57206
record_format eprints
spelling my.upm.eprints.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
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
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.
format Conference or Workshop Item
author Ho, Ziao Fung
Lee, Lai Soon
Abdul Majid, Zanariah
Seow, Hsin Vonn
spellingShingle Ho, Ziao Fung
Lee, Lai Soon
Abdul Majid, Zanariah
Seow, Hsin Vonn
An improved GRMOD heuristic for container loading problem
author_facet Ho, Ziao Fung
Lee, Lai Soon
Abdul Majid, Zanariah
Seow, Hsin Vonn
author_sort Ho, Ziao Fung
title An improved GRMOD heuristic for container loading problem
title_short 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_sort improved grmod heuristic for container loading problem
publisher AIP Publishing LLC
publishDate 2013
url 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/
_version_ 1643836418116550656
score 13.211869

Similar Items