摘要
针对自然灾害时军队参与应急运输保障任务的车辆调度优化问题,根据应急运输时效性的特点建立了基于单边时间窗的车辆调度模型。以带时间惩罚函数的总距离最短为目标函数,提出了改进遗传算法进行求解,通过算例分析证明了算法能够保持优良基因,较好地克服早熟收敛的问题,得到了较为满意的车辆调度方案,为军队应急运输保障车辆调度决策提供了参考。
In this paper,to solve the problem of vehicle dispatching optimization in natural disaster relief missions where the army participated in emergency transportation support,we established a vehicle dispatching model with unilateral time window in light of the timeliness characteristics of the emergency transportation tasks.Then,taking the shortest total distance with time penalty function as the objective function,we proposed an improved genetic algorithm to solve the problem.Through a numerical example,we proved that the algorithm could retain good genes,overcome the problem of premature convergence,and obtain more satisfactory vehicle dispatching plans.
作者
杜小敏
胡远新
DU Xiaomin;HU Yuanxin(Department of Military Facility,Army Logistics University,Chongqing 401331,China)
出处
《物流技术》
2021年第4期129-134,共6页
Logistics Technology
关键词
军队
应急运输
车辆调度
遗传算法
army
emergency transportation
vehicle dispatching
genetic algorithm
