优化多品种货物配装的蚂蚁算法  

Ant Algorithm for Optimal Loading of Multi Category Goods

作　　者：曹宏美[1] 高利[1] 张天宫[1] 

机构地区：[1]北京理工大学,北京100081

出　　处：《交通与计算机》2008年第2期11-14,共4页Computer and Communications

基　　金：交通部科技项目资助(批准号:200439800060)

摘　　要：为充分利用装载工具的装载重量和容积,在考虑货物重量、容积、配装优先级以及混装限制等约束条件下,基于待装货物比容动态逼近装载工具剩余空间比容的思想,通过引入节点吸引度、构造合理的动态能见度函数以及采取多样化约束处理策略,设计了求解多品种货物配装问题的蚂蚁算法,并对42件不同品种的待装货物装入TBJ10型集装箱的配装问题进行了优化,求解结果实现了集装箱的装载重量和装载容积的同时优化。算例结果初步表明算法是有效和可行的。According to loading weight, volume, priority, and mix-loading condition, an ant algorithm was designed to make good use of containers loading weight and volume based on minimizing the difference of specific volume between surplus loading-space and selected good. In the algorithm, the dot-attraction was introduced, an enlightened function was constructed, and the different strategies were adopted to incarnate different restrictions. A case was optimized that 42 kinds of goods were loaded into a 10t container, and 81.19 percent of weight and 98.75 percent of volume were utilized. The application result shows that the algorithm is valid and feasible.

关 键 词：蚂蚁算法 节点吸引度 比容 装载能力 

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