基于离散蜂群的应急物流车辆调度算法  

A Discrete Artificial Bee Colony Algorithm For Solving The Emergency Logistics Vehicle Dispatching Problem

作　　者：王前锋[1] WANG Qian-feng(School of Engineering Economics, Henan Institute of Economics and Trade ,Zhengzhou 450000,Chin)

机构地区：[1]河南经贸职业学院工程经济学院,河南郑州450000

出　　处：《内蒙古师范大学学报（自然科学汉文版）》2018年第1期39-43,54,共6页Journal of Inner Mongolia Normal University(Natural Science Edition)

基　　金：河南省科技厅软科学项目(15240041047)

摘　　要：为在尽可能满足应急物流时间要求的前提下最大程度的节约运输成本,提出了一种基于离散蜂群的应急物流车辆调度算法.该算法首先综合考虑运输车装载容量和受灾点的单边硬时间窗约束,构建了以最小化配送成本为目标的数学规划模型,然后利用离散蜂群算法进行优化求解,通过引入离散差分搜索强化其领域搜索能力,同时借助侦查蜂进行个体淘汰操作,从而避免算法陷入局部最优.仿真实验表明,与基于蚁群算法的应急物流车辆调度算法相比,该算法具有较强的鲁棒性,能够快速获得应急物流车辆调度问题的优质解.In order to minimize the cost of transportation as long as possible to meet the requirements of the emergency logistics time,this paper proposes an emergency logistics vehicle scheduling algorithm based on discrete bee colony.This algorithm integrates vehicle loading capacity and the single hard time window of the affected point,establishes a mathematical model to minimize the distribution cost as the goal,and then use a discrete artificial bee colony algorithm for optimization solution and a discrete artificial bee colony algorithm by introducing discrete differential search field to strengthen its search ability and at the same time carries out eliminating by individual scouts thus,to avoid the algorithm into a local optimum.Simulation results show that,compared with the emergency logistics vehicle scheduling algorithm based on ant colony algorithm,the proposed algorithm has strong robustness,and can quickly obtain the high quality solution of the emergency logistics vehicle scheduling problem.

关 键 词：应急物流 调度 蜂群算法 差分进化 

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