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...
保存先:
主要な著者: | 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, 等
出版事項: (2012) -
Ant colony optimization for capacitated vehicle routing problem.
著者:: Tan, Wen Fang, 等
出版事項: (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., 等
出版事項: (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, 等
出版事項: (2020)