解决有配放限制的多集装箱配载系统优化的多蚁群协同算法  

Multi-Ant Colony Algorithm for Optimal Stowage of Multi-Category Goods and Multi-Container

作　　者：王海星[1] 张国伍[1] 李振江[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《交通运输系统工程与信息》2010年第2期153-159,共7页Journal of Transportation Systems Engineering and Information Technology

摘　　要：在分析具有装载重量、体积等约束条件及配放限制的集装箱配载模型的基础上,分析了求解其的蚁群算法与求解TSP的蚁群算法在结点性质、原点(中心结点)的作用、蚂蚁路径构造规则、可移动结点集合、可行解的形成过程等方面的区别.针对问题特点,充分考虑货物配放限制,装载工具的载重、容积两个方面同时优化的问题,基于待装货物比容动态逼近装载工具剩余空间比容的思想,综合运用ACA-INI、ACA-CONTAIN-ER和ACA-VOTUME三个不同蚁群协同考虑问题的两个目标——需用集装箱数目优化和装载工具重量、容积利用率优化,对问题的求解策略进行了研究.进一步地,结合8类40件不同品种货物的集装箱配载问题对模型算法的实用性和有效性进行了验证.Considering the optimal loading and volume, and the stowage with limitation, this paper analyzes sev- eral differences of the multi-ant colony algorithm for the current problem and TSP, namely, joint property, original note function, route construction rule, and formulation of feasible solution. Multi-Ant colony algorithm include three parts： ACA-INI, ACA-CONTAINER and ACA-VOTUME. Improvement on route construction rule and pheromone updating rule was adopted on the basis of former algorithm. An example was analyzed to demonstrate the correctness of the application of this model and algorithm. It is proved that multi-ant colony algorithm is efficient and feasible in solving optimal loading of multi-category goods and multi-container.

关 键 词：物流工程 多蚁群协同算法 多集装箱配载 有配放限制的最优配载 

分 类 号：U169[交通运输工程]