A recursive computational procedure for container loading

被引:21
作者
Chien, CF [1 ]
Wu, WT [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Ind Engn, Hsinchu 30043, Taiwan
关键词
container loading; cutting problems; three-dimensional knapsack; optimization; transportation;
D O I
10.1016/S0360-8352(98)00084-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents a new procedure for loading different sized boxes in a freight container of known dimensions so as to minimize the waste of container space. We incorporate the mechanisms of comparing the solution values with upper bonds to reduce unnecessary calculations. (C) 1998 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:319 / 322
页数:4
相关论文
共 9 条
[1]  
BEASLEY JE, 1985, J OPER RES SOC, V36, P297
[2]   A COMPARATIVE-EVALUATION OF HEURISTICS FOR CONTAINER LOADING [J].
BISCHOFF, EE ;
MARRIOTT, MD .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (02) :267-276
[3]   AN APPROXIMATION ALGORITHM FOR SOLVING UNCONSTRAINED 2-DIMENSIONAL KNAPSACK-PROBLEMS [J].
FAYARD, D ;
ZISSIMOPOULOS, V .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 84 (03) :618-632
[4]   A COMPUTER-BASED HEURISTIC FOR PACKING POOLED SHIPMENT CONTAINERS [J].
GEHRING, H ;
MENSCHNER, K ;
MEYER, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (02) :277-288
[5]   A HEURISTIC FOR PACKING BOXES INTO A CONTAINER [J].
GEORGE, JA ;
ROBINSON, DF .
COMPUTERS & OPERATIONS RESEARCH, 1980, 7 (03) :147-156
[6]   THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1966, 14 (06) :1045-&
[7]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1961, 9 (06) :849-859
[8]   A recursive exact algorithm for weighted two-dimensional cutting [J].
Hifi, M ;
Zissimopoulos, V .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 91 (03) :553-564
[9]   Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates [J].
Hifi, M ;
Ouafi, R .
COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 32 (01) :187-205