Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (28): 240-244.

Previous Articles     Next Articles

Delivery sequence limit single container packing problem

YU Lei, CHEN Guohong   

  1. 1.Sunshine College, Fuzhou University, Fuzhou 350015, China
    2.Management College, Fuzhou University, Fuzhou 350002, China
  • Online:2012-10-01 Published:2012-09-29

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

余  蕾,陈国宏   

  1. 1.福州大学 阳光学院,福州 350015
    2.福州大学 管理学院,福州 350002

Abstract: 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. Experimental results show the algorithms are effective.

Key words: packing problem, simulated annealing, sequence pair, delivery sequence limitation

摘要: 解决了基于模拟退火算法求解带卸货顺序约束的单容器装箱问题。提出的方法采用了改进的序列对表示对解空间进行压缩。研究了满足卸货顺序约束的序列对的新性质,以及基于模块删除与插入的新解产生算法,并将该算法集成于模拟退火中。实验结果证明了该模拟退火算法对卸货顺序约束的单容器矩形装箱问题的有效性。

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