疫情封控下的卡车和无人车联合配送问题研究  

On the joint distribution problem of trucks and unmanned vehicles considering epidemic containment

在线阅读下载全文

作  者:姜博涵 刘翱[1] 邓旭东[1] 任亮[1] 彭琨琨 艾学轶 JIANG Bohan;LIU Ao;DENG Xudong;REN Liang;PENG Kunkun;AI Xueyi(School of Management,Wuhan University of Science and Technology,Wuhan 430065,China)

机构地区:[1]武汉科技大学管理学院,武汉430065

出  处:《智能计算机与应用》2023年第5期145-150,共6页Intelligent Computer and Applications

基  金:武汉科技大学资助项目(2022H20537);教育部人文社会科学研究规划基金项目(21YJAZH050);国家自然科学基金青年项目(71901167);武汉市知识创新专项曙光计划项目(2022010801020317);武汉市知识创新专项基础研究项目(2022010801010301);中国物流学会、中国物流与采购联合会面上研究课题(2022CSLKT3-130);湖北省高等学校优秀中青年科技创新团队计划项目(T2022003)。

摘  要:在疫情防控需求背景下,常规配送模式已不能满足城市内封控地区物资需求,而采用卡车和无人车联合配送的模式,能够在保证未封控地区进行常规配送的同时,在封控区设立无人车站点,由无人车对封控地区的需求点进行无接触配送。针对此问题,首先,建立以总运输成本最小化为目标的整数规划模型;其次,采用最大最小距离算法MMD,对疫情封控区的需求点进行聚类操作,解决无人车站点的选址问题。同时,采用PSO算法进行配送路径优化,从而得到两级配送路线。研究结果表明,卡车和无人车联合配送可以为疫情背景下的配送模式提供可行、有效的方案。Under the background of the needs of epidemic prevention and control,the conventional distribution mode can’t meet the needs of the urban sealed control areas in the city.The joint distribution mode of trucks and unmanned vehicles can ensure the normal regular distribution in the unsealed areas,while the unmanned vehicles can carry out non-contact distribution to the demand points in the sealed control areas by setting up the unmanned stations in the sealed control areas.In order to solve this problem,firstly,an integer programming model is established with the objective of minimizing the total transportation cost.Secondly,the Maximum and minimum distance algorithm MMD is used to cluster the demand points in the epidemic sealed control area to solve the location problem of unmanned distribution station points.Meanwhile,the PSO algorithm is employed to optimize the distribution route,so as to obtain the two-level distribution route.The results show that the joint distribution of trucks and unmanned vehicles can provide a feasible and effective scheme for the distribution mode under the background of the epidemic.

关 键 词:后疫情时代 无人车 车辆路径问题 最大最小距离算法 联合配送 

分 类 号:TP399[自动化与计算机技术—计算机应用技术]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象