多配送中心粮食物流车辆调度混合蚁群算法  

Hybrid ant colony algorithm for multi-depot grain logistics vehicle scheduling problem

作　　者：张强[1,2] 熊盛武[1] 

机构地区：[1]武汉理工大学计算机科学与技术学院,武汉430070 [2]河南工业大学信息科学与工程学院,郑州450052

出　　处：《计算机工程与应用》2011年第7期4-7,39,共5页Computer Engineering and Applications

基　　金：国家"十一五"科技支撑计划重点项目(No.2008BADA8B03);国家"十一五"科技支撑计划(No.2006BAD08B01)

摘　　要：在对多配送中心粮食车辆调度问题进行直观描述的基础上,建立了该问题的数学模型。并在国内外研究现状的基础上,提出了一个混合蚁群算法来求解多配送中心车辆调度问题,设计了蚂蚁转移策略、可行解构造策略和信息素更新策略,采用K邻域来限制蚂蚁的转移目标,并采用LK算法优化策略来优化蚂蚁遍历路径和可行解。给出了一个具有代表性的算例实验结果和结果分析,通过实验表明了此方法对优化多配送中心粮食车辆调度问题的有效性。On the basis of describing the multi-depot grain logistics vehicle scheduling problem naturally,the model of the problem is built in this paper.A hybrid ant colony algorithm is proposed to solve this successfully by ants transfer policy and algorithm to construct solution designed in this dissertation.To improve hybrid ant colony algorithm performance,K-neighbor is used to restrict the ants transfer objects,and LK algorithm is used to optimize ants’ routes and solution,and regulation of pheromone update is designed.A representative result and the analysis are given.The experiment indicates the validity of the technique to the multi-depot grain logistics vehicle scheduling problem with the above-mentioned conditions.

关 键 词：粮食物流配送中心 车辆调度 蚁群算法 优化 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]