Study on Hybrid Heuristics Algorithm for Optimal Loading Problem of Multi-model and Multi-cargo
WANG Xiao-bo1, LI Yi-jun2
1. School of Information Management, Heilongjiang University, Harbin 150080, China; 2. School of Management, Harbin Institute of Technology, Harbin 150001, China
WANG Xiao-bo, LI Yi-jun. Study on Hybrid Heuristics Algorithm for Optimal Loading Problem of Multi-model and Multi-cargo[J]. Operations Research and Management Science, 2011, 20(6): 1-8.
[1] Scheithauer G. Algorithms for the container loading problem[J]. Operations Research Proceeding, 1991, 445-452. [2] Shachnai H, Tamir T. Polynomial time approximation schemes for class-constrained packing problems[J]. Journal of Scheduling, 2001, 4(6): 312-338. [3] Bhattacharya S, Roy R. An exact depth-first algorithm for the pallet loading problem[J]. European Journal of Operational Research, 1998, 110(3): 610-625. [4] Berghammer R, Reuter F. A linear approximation algorithm for bin packing with absolute approximation factor[J]. Science of Computer Programming, 2003, 48(1): 67-80. [5] Kenyon C, Remila E. A near-optimal solution to a two-dimensional cutting stock problem[J]. Mathematics of Operations Research, 2000, 25(4): 645-656. [6] 刘小群,马士华.基于标杆的多车多品种货物装载优化算法[J].交通运输工程学报,2007,7(1):99-105. [7] Bortfeldt A, Gehring H, Mack D. A parallel tabu search algorithm for solving the container loading problem[J]. Parallel Computing, 2003, (29): 641-662. [8] Loh K H, Bruce G, Edward W. Solving the one-dimensional bin packing problem with a weight annealing heuristic[J]. Computers & Operations Research, 2006, 10(11):1-9. [9] 曹宏美,高利,王素欣.基于改进粒子群算法的车辆配装问题求解[J].控制工程,2008,15(1):107-109. [10] 杨习清,牛惠民.一种多车型多货物配装问题的模型与算法[J].兰州交通大学学报,2009,28(6):123-125.