基金项目：国家自然科学基金项目(70332001);华中科技大学优秀博士学位论文基金项目(D0540)
作者简介：刘小群(1980-),男,安徽潜山人,地壳运动监测工程研究中心助理研究员,工学博士,从事物流、供应链及项目管理研究.Liu Xiao-qun (1980-), male, PhD, assistant researcher, +86-10-88015756,hustlxq@126.com.
作者单位：刘小群（地壳运动监测工程研究中心,北京,100036;华中科技大学,物流与供应链研究所,湖北,武汉,430074）
马士华（华中科技大学,物流与供应链研究所,湖北,武汉,430074）
参考文献：
[1]Dowsland K A,Dowsland W B.Packing problems[J].European Journal of Operational Research,1992,56(1):2-14.
[2]Martello S,Vigo D.Exact solution of the two-dimensional finite bon packing problem[J].Management Science,1998,44(3):388-399.
[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]Scheithauer G,Sommerweib U.4-block heuristic for the rectangle packing problem[J].European Journal of Operational Research,1998,108(3):509-526.
[5]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.
[6]Armstrong R D,Jin Zhi-ying.Strongly polynomial simplex algorithm for bipartite vertex packing[J].Discrete Applied Mathematics,1996,64(2):97-103.
[7]孙焰,李致中.求双目标配装的多项式近似算法[J].长沙铁道学院学报,1997,15(2):33-39.Sun Yan,Li Zhi-zhong.The polynomial algorithms for the allocation problem with two aims[J].Journal of Changsha Railway University,1997,15(2):33-39.(in Chinese)
[8]Kenyon C,Remila E.A near-optimal solution to a twodimensional cutting stock problem[J].Mathematics of Operations Research,2000,25(4):645-656.
[9]Shachnai H,Tamir T.Polynomial time approximation schemes for class-constrained packing problems[J].Journal of Scheduling,2001,4(6):312-338.
[10]Lodi A,Martello S,Vigo D.Recent advances on two-dimensional bin packing problems[J].Discrete Applied Mathematics,2002,123(1/3):379-396.
[11]卜雷,尹传忠,蒲云.优化普零货物拼箱配装的遗传算法[J].交通运输工程学报,2004,4(4):84-87.Bu Lei,Yin Chuan-zhong,Pu Yun.Genetic algorithm for optimal arrangement of general piece goods[J].Journal of Traffic and Transportation Engineering,2004,4(4):84-87.(in Chinese)
[12]Chen Ping,Fu Zhao-hui,Lim A,et al.The two-dimensional packing problem for irregular objects[J].International Journal on Artificial Intelligence Tools,2004,13(3):429-448.
[13]Coffman E G,Garey M R,Johnson D S.Approximation Algorithms for NP-Hard Problems[M].Boston:PWS Publishing Company,1997.
[14]Kang J,Park S.Algorithms for the variable sized bin packing problem[J].European Journal of Operational Research,2003,147(2):365-372.
[15]徐天亮,刘小群.多品种货物配装的优化方法[J].华中科技大学学报:自然科学版,2003,31(9):15-17.Xu Tian-liang,Liu Xiao-qun.Optimization for the loading of multi-category goods[J].Journal of Huazhong University of Science and Technology:Nature Science Edition,2003,31(9):15-17.(in Chinese)
[16]刘小群,马士华,徐天亮.装载能力有限下多品种货物配装的容重比平衡法[J].工业工程与管理,2004,9(3):62-66.Liu Xiao-qun,Ma Shi-hua,Xu Tian-liang.The cubadgeweight balance algorithm for the loading of multi-category goods under the limited loading capacity[J].Industrial Engineering and Management,2004,9(3):62-66.(in Chinese)
[17]徐同连,栾琨,贾洪飞.共同配送合并策略及其配送成本[J].长安大学学报:自然科学版,2006,26(3):68-71.Xu Tong-lian,Luan Kun,Jia Hong-fei.Consolidation strategy and distribution cost of joint distribution[J].Journal of Chang'an University:Natural Science Edition,2006,26 (3):68-71.(in Chinese)
|
