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: | Ho, Ziao Fung, Lee, Lai Soon, Abdul Majid, Zanariah, Seow, Hsin Vonn |
---|---|
格式: | 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/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Ant colony optimization for container loading problem.
由: Yap, Ching Nei, et al.
出版: (2012) -
Ant colony optimization for capacitated vehicle routing problem.
由: Tan, Wen Fang, et al.
出版: (2012) -
Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
由: Chong, Zheng Ziao
出版: (2015) -
Genetic algorithm for biobjective urban transit routing problem
由: Chew, J. S. C., et al.
出版: (2013) -
Hybrid harmony search-simulated annealing algorithm for location-inventory-routing problem in supply chain network design with defect and non-defect items
由: Farahanim, Misni, et al.
出版: (2020)