带时间窗的海军航空兵场站特种保障车辆调度问题  

Scheduling of Special Support Vehicles at Naval Aviation Station with Time Windows

作　　者：阎哲 汪民乐 汪江鹏 吴丰轩 闫少强 YAN Zhe;WANG Min-le;WANG Jiang-peng;WU Feng-xuan;YAN Shao-qiang(Rocket Force University of Engineering,Shaanxi Xi'an 710025,China)

机构地区：[1]火箭军工程大学,陕西西安710025

出　　处：《现代防御技术》2022年第6期117-123,共7页Modern Defence Technology

摘　　要：随着海军航空兵任务样式和数量的剧增,基于经验的人工编排式特种保障车辆调度方法不仅会造成保障资源的浪费,还容易因车辆派遣不及时导致战机延误。针对海军航空兵场站特种保障车辆调度问题,在时间窗和车辆载重的约束下,以出动保障车辆最少、车辆总行驶距离最短为目标建立数学模型。改进遗传算法初始种群和编码方式对模型求解,以一次多机种、大批量飞行保障任务进行仿真试验,得到特种保障车辆调度方案,验证了该模型的合理性。With the dramatic increase in the style and number of naval aviation missions,the experience-based manual scheduling type of special support vehicle dispatching method will not only cause a waste of support resources,but also easily lead to delays in warplanes due to untimely dis⁃patch of vehicles.To address the problem of dispatching special support vehicles at naval aviation sta⁃tion,a mathematical model is established with the objective of dispatching the least number of sup⁃port vehicles and the shortest total vehicle travel distance under the constraints of time window and ve⁃hicle load.The model is solved by improving the initial population and coding method of genetic algo⁃rithm,and a simulation test is carried out with a multi-aircraft and high-volume flight protection task to obtain a special support vehicle dispatching scheme,which verifies the rationality of the model.

关 键 词：海军航空兵场站 保障车辆调度 路径规划 时间窗 载重约束 遗传算法 

分 类 号：E917[军事]