检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:于雅歌 鲍心怡 张煜炜 李珍萍[1] YU Yage;BAO Xinyi;ZHANG Yuwei;LI Zhenping(School of Information,Beijing Wuzi University,Beijing 101149,China)
出 处:《现代制造工程》2023年第10期113-119,共7页Modern Manufacturing Engineering
基 金:国家自然科学基金项目(71771028);北京市自然科学基金项目(9212004)。
摘 要:空港物流地面暂存区爆仓和配送车辆装载率低的问题一直亟待解决。基于航空公司暂存区货物入库和出卡流程,考虑航班的到达时间、货物目的地、货物件数和货物重量等信息,以货物在暂存区的滞留时间成本和配送车辆运输成本之和最小化为目标建立混合整数规划模型,并设计了聚类算法。基于MU航空公司的真实数据生成算例进行模拟计算,并与该航空公司实际分拨配送方案进行对比,验证了所提方法的有效性。结果显示,优化后货物分拨配送方案的货物在暂存区的平均滞留时间减少了32%,配送车辆装载率提升了32%,总成本降低了31%,为解决空港物流地面暂存区爆仓问题提供了决策支持。The problem of warehouse explosions in the ground temporary storage area of airport logistics and low loading rate of delivery vehicles has always been an urgent need to be addressed.Based on the cargo warehousing and card issuing process in the temporary storage area of the airline,considering the arrival time of the flight,the destination of the cargo,the number of cargo pieces,and the weight of cargo,a mixed integer programming model was established with the goal of minimizing the sum of the cost of the detention time of cargo in the temporary storage area and the transportation cost of distribution vehicles,and a clustering algorithm was designed.Based on the real data generated by MU airlines,simulation calculations were conducted and compared with the actual batching and distribution plan of the airline,the effectiveness of the proposed method was verified.The results show that the optimized cargo batching and distribution scheme can reduce the average detention time of cargoes in the temporary storage area by 32 %,increase the loading rate of delivery vehicles by 32 %,and reduce the total cost by 31 %,providing decision support for solving the problem of warehouse explosion in the ground temporary storage area of airport logistics.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33