摘要
对有卸货顺序约束的三维集装箱问题进行了描述。基于禁忌规则,采用了求解该问题的模拟退火算法,设计了货物的摆放规则和序列生成方式。采用3种邻域,根据邻域的不同,构造了2种禁忌表。根据问题的特点,在模拟退火算法抽样过程中加入了禁忌规则。介绍了算法的原理,给出了具有代表性算例试验结果并且进行了分析。试验结果表明,提出的混合算法对有卸货顺序约束的集装箱三维装载问题的有效性。
A three dimensional bin packing problem （3BP） with delivery sequence limit is presented. Based on tabu rules, a simulated annealing algorithm （SA） is designed to solve this problem. To extend the search space, three kinds of neighborhood and two kinds of tabu list are proposed, and tabu rules are added in the algorithm. The principium of the algorithm is introduced, a representative result and the analysis are given. The experiment and the analysis indicate the validity of the hybrid algorithm to the 3BP with delivery sequence limit.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第7期1789-1791,共3页
Computer Engineering and Design
关键词
三维装箱问题
卸货顺序约束
模拟退火算法
禁忌算法
邻域
three dimensional bin packing problem
delivery sequence limit
simulated annealing algorithm
tabu search algorithm
neighborhood
