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

蚁群算法求解复杂集装箱装载问题
引用本文:杜立宁,张德珍,陈世峰.蚁群算法求解复杂集装箱装载问题[J].计算机应用,2011,31(8):2275-2278.
作者姓名:杜立宁  张德珍  陈世峰
作者单位:1. 大连大学 信息工程学院,辽宁 大连116622 2. 大连海事大学 信息科学技术学院,辽宁 大连116026
基金项目:中国博士后科学基金资助项目,大连市青年基金资助项目
摘    要:针对复杂集装箱装载问题(CLP),应用启发式信息与蚁群算法求解了最优装载方案。首先,建立了复杂集装箱装载问题的数学模型,利用蚁群算法对解空间的强搜索能力、潜在并行性及可扩充性,结合三空间分解策略将布局空间依次分割;然后,装入满足约束条件的最优货物块,完成不同大小三维矩形货物的装载布局。在此基础上,设计了基于空间划分策略的蚁群算法。最后以700件货物装入40尺(12.025m)高柜箱进行计算,结果表明该方法能提高集装箱的空间利用率,同时兼顾了多个装载约束条件,可应用性好。

关 键 词:蚁群算法    集装箱装载问题    启发式信息    一次性装载
收稿时间:2011-02-28
修稿时间:2011-04-22

Solution to complex container loading problem based on ant colony algorithm
DU Li-ning,ZHANG De-zhen,CHEN Shi-feng.Solution to complex container loading problem based on ant colony algorithm[J].journal of Computer Applications,2011,31(8):2275-2278.
Authors:DU Li-ning  ZHANG De-zhen  CHEN Shi-feng
Affiliation:1. School of Information Engineering, Dalian University, Dalian Liaoning 116622, China
2. College of Information Science and Technology, Dalian Maritime University, Dalian Liaoning 116026, China
Abstract:In view of the complex Container Loading Problem (CLP), the optimal loading plan with heuristic information and the ant colony algorithm was proposed. Firstly, a mathematical model was generated. Considering the strong search ability, potential parallelism and scalability of ant colony algorithm, the proposed algorithm was combined with the triple-tree structure to split the layout of space in turn. Then, the three-dimensional rectangular objects of different sizes were placed to the layout space under the constraints. An ant colony algorithm based on spatial partition was designed to solve the optimal procedure. Finally, a design example that 700 pieces of goods were loaded into a 40-foot (12.025m) high cubic was calculated. The experimental results show that the proposed method can enhance the utilization of the container and it has a strong practicality.
Keywords:ant colony algorithm                                                                                                                        Container Loading Problem (CLP)                                                                                                                        heuristic information                                                                                                                        one-time loading
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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