检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵桂红[1] 张腾飞 ZHAO Guihong;ZHANG Tengfei(Economics&Management College,Civil Aviation University of China,Tianjin 300300;Transportation Science&Engineering College,Civil Aviation University of China,Tianjin 300300,China)
机构地区:[1]中国民航大学经济与管理学院,天津300300 [2]中国民航大学交通科学与工程学院,天津300300
出 处:《物流技术》2023年第4期47-52,共6页Logistics Technology
摘 要:为探究无人机在进行应急物资末端配送时最优的任务分配方法,以总送达时间最短为目标函数建立模型,根据两种常用的任务分配思想,基于蚁群算法设计了两种求解算法,以解决无人机配送应急救援物资的任务分配问题。结果表明,两种方法均可解决无人机的任务分配问题,且二者的适用性在所建立的场景中并无太大不同,即两种方法给出的分配方案不完全一致,但方案所花费时间却大概率相同,主要是将目标函数设定为总完成时间最小导致的。此外,当无人机最大装载量大于各需求点需求量上限时,其分配方案也会趋于一致,均呈现为无中转的形式。In this paper,in order to find the optimal task allocation method of unmanned aerial vehicles in the terminal delivery of emergency supplies,we established the relevant model with the shortest total delivery time as the objective function,and according to two commonly used task allocation principles,designed two methods based on ant colony algorithm to solve the model.The result showed that both methods could solve the task allocation problem of unmanned aerial vehicles and the applicability of the two methods is not much different in the scenarios established,that is,the allocation schemes derived by the two methods are not exactly the same but probably require the same amount of time to accomplish the delivery task,which is mainly due to the setting of the total completion time as the objective function.In addition,when the maximum loading capacity of the unmanned aerial vehicles is greater than the upper limit of the demand volume of each demand point,the two methods also tend to produce identical allocation schemes,that is,direct delivery with no need for transfer.
分 类 号:V279[航空宇航科学与技术—飞行器设计] F252[经济管理—国民经济]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222