首页 | 本学科首页   官方微博 | 高级检索  
     

有卸货顺序约束的集装箱装载问题及算法研究
引用本文:屈援,王雪莲.有卸货顺序约束的集装箱装载问题及算法研究[J].计算机工程与设计,2008,29(7):1789-1791.
作者姓名:屈援  王雪莲
作者单位:1. 暨南大学管理学院,广东广州,510632;天津大学管理学院,天津,300072
2. 天津大学管理学院,天津,300072
摘    要:对有卸货顺序约束的三维集装箱问题进行了描述.基于禁忌规则,采用了求解该问题的模拟退火算法,设计了货物的摆放规则和序列生成方式.采用3种邻域,根据邻域的不同,构造了2种禁忌表.根据问题的特点,在模拟退火算法抽样过程中加入了禁忌规则.介绍了算法的原理,给出了具有代表性算例试验结果并且进行了分析.试验结果表明,提出的混合算法对有卸货顺序约束的集装箱三维装载问题的有效性.

关 键 词:三维装箱问题  卸货顺序约束  模拟退火算法  禁忌算法  邻域
文章编号:1000-7024(2008)07-1789-03
修稿时间:2007年5月16日

Study on bin packing problem with delivery sequence limit and its algorithm
Qu Yuan,WANG Xue-lian.Study on bin packing problem with delivery sequence limit and its algorithm[J].Computer Engineering and Design,2008,29(7):1789-1791.
Authors:Qu Yuan  WANG Xue-lian
Affiliation:QU Yuan1,2,WANG Xue-lian2(1.School of Management,Jinan University,Guangzhou 510632,China,2.School of Management,Tianjin University,Tianjin 300072,China)
Abstract: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 deliver...
Keywords:three dimensional bin packing problem  delivery sequence limit  simulated annealing algorithm  tabu search algorithm  neighborhood  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号