检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:廖海锋 尤妮斯·B·库斯托迪奥 LIAO Hai-feng;Eunice·B·Custodio(Guangdong University of Science&Technology,Dongguan Guangdong 523000,China;Bulacan State University,Malolos Bulacan 0100,Philippines;Yunnan University,Kunming Yunnan 650091,China)
机构地区:[1]广东科技学院,广东东莞523000 [2]菲律宾布拉卡国立大学,菲律宾布拉卡马洛洛斯0100 [3]云南大学,云南昆明650091
出 处:《计算机仿真》2024年第5期158-162,共5页Computer Simulation
基 金:江西省社会科学研究“十四五”(2022年)地区规划项目(2022DY41)。
摘 要:由于远距离物流通常涉及多个节点、多个运输模式和不同的运输路径,且需要考虑不同节点之间的时间窗要求,导致调度过程中的信息传递和协调难度增加。为此,提出一种响应用户随机需求的远距离物流配送调度算法。针对用户随机需求信息和经验数据,采用汇集预测方法形成合理的虚拟用户出现概率、坐标位置和需求量信息,以远距离物流配送调度时间最短和用户满意度最高为目标,按照车辆先真实后虚拟用户配送的原则,组建响应用户随机需求的远距离物流配送调度模型。引入改进粒子群(Particle Swarm Optimization,PSO)算法对模型求解,确定最优远距离物流配送调度方案。仿真分析证明,所提算法可以快速响应用户需求,用户满意度均在96%以上,远距离物流配送调度时间最长仅为30min。Generally,long-distance logistics involves multiple nodes,multiple transportation modes and different transportation paths,so we have to consider the time window requirements between different nodes.The difficulty of information transmission and coordination during the scheduling process will increase as a result.Therefore,a longdistance logistics distribution scheduling algorithm was proposed to respond to the random needs of users.Based on the user's random demand information and experience data,the reasonable occurrence probability of virtual users,coordinate position and demand information were obtained by aggregation and prediction.In order to achieve the shortest scheduling time and the highest user satisfaction in long-distance logistics distribution,a long-distance logistics distribution scheduling model responding to users'random demand was built according to the principle that vehicles first deliver to real users before delivering to virtual users.Finally,an improved Particle Swarm Optimization(PSO)algorithm was introduced to solve the model.Thus,the optimal scheduling scheme was determined.Simulation analysis proves that the proposed algorithm can respond to user demand quickly,and user satisfaction is more than 96%all the time.The longest dispatching time of long-distance logistics is only 30min.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7