装箱问题的算法及最新进展  

RECENT DEVELOPMENTS IN ALGORITHMS FOR PACKING PROBLEMS

作　　者：刘明明[1] 童小娇[2] 戴彧虹[3] 

机构地区：[1]湘潭大学数学与计算科学学院,湖南湘潭411105 [2]湖南第一师范学院数学与计算科学学院,长沙410000 [3]中国科学院数学与系统科学研究院,北京100190

出　　处：《计算数学》2016年第3期257-280,共24页Mathematica Numerica Sinica

基　　金：国家自然科学基金(批准号11171095和71371065)资助;国家自然科学基金(批准号11331012和71331001);973项目基金(No.2015CB856000)资助

摘　　要：装箱问题在经济社会发展中扮演着重要的角色,该问题研究的是寻找较好的布局方式,尽可能实现利益的最大化.装箱问题具有NP-难性质,其理论和应用研究存在一定的挑战,但因其有广泛的应用背景而受到研究者高度的关注.本文主要总结近几十年来装箱问题的研究成果,特别针对一维、二维和三维单目标装箱问题和算法,以及多目标装箱问题的算法进行概括和总结,并提出装箱问题算法上有待进一步的研究工作.Packing problem plays an important role in economics and social development, the study of it is to find a better layout and realize the maximization of interests as much as possible. The packing problem is NP-hard in general and there are still some challenging problems in this area, but the wide range of application background makes it attract much attention from researchers and practitioners. In this paper, we shall give a review on packing problem in recent decades. More exactly, we summarize the relevant research progress of one-dimensional, two-dimensional and three-dimensional single objective packing problems. Meanwhile, we shall discuss multi-objective problem and the algorithm of packing problem is put forward on further research work.

关 键 词：装箱问题 确定型算法 一般启发式算法 现代启发式算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]