卸货顺序约束的单容器矩形装箱问题  

Delivery sequence limit single container packing problem

作　　者：余蕾[1] 陈国宏[2] 

机构地区：[1]福州大学阳光学院,福州350015 [2]福州大学管理学院,福州350002

出　　处：《计算机工程与应用》2012年第28期240-244,共5页Computer Engineering and Applications

摘　　要：解决了基于模拟退火算法求解带卸货顺序约束的单容器装箱问题。提出的方法采用了改进的序列对表示对解空间进行压缩。研究了满足卸货顺序约束的序列对的新性质,以及基于模块删除与插入的新解产生算法,并将该算法集成于模拟退火中。实验结果证明了该模拟退火算法对卸货顺序约束的单容器矩形装箱问题的有效性。A simulated annealing based algorithm to solve delivery sequence limit single container packing problem is presented. This method adopts a modified sequence pairs to reduce solution space. New constraints to guarantee delivery sequence and an elaborated method for perturbing solutions are devised for the simulated annealing. Experi- mental results show the algorithms are effective.

关 键 词：装箱问题 模拟退火算法 序列对 卸货顺序约束 

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