检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:辜羽洁 占维[1] 魏强 GU Yu-jie;ZHAN Wei;WEI Qiang(Jiangxi V&T College of Communications,Management Engineering Department,Nanchang 330013,China;Jiangxi Provincial Key Laboratory for Modern Transportation and Logistics,Nanchang 330013,China;Jiangxi Expressway Networking Management Center,Nanchang 330036,China)
机构地区:[1]江西交通职业技术学院管理工程系,江西南昌330013 [2]江西省交通运输行业现代交通运输物流重点实验室,江西南昌330013 [3]江西省高速公路联网管理中心,江西南昌330036
出 处:《数学的实践与认识》2019年第19期28-41,共14页Mathematics in Practice and Theory
基 金:江西省交通运输厅科技项目基金(2016R0032)
摘 要:针对物流配送途中客户动态变更配送需求问题,分别研究了满足客户临时变更收货时间窗、收货地址和取消收货的三种要求时所需成本相较于预先设计配送路径所需成本的波动值,建立了客户临时变更配送需求的动态管理模型.基于嵌套分割算法,设计了邻近救援策略、最佳离库策略、增派车辆策略对模型进行求解.最后,通过算例试验,证明模型可以有效的降低物流配送成本,且具有更强的实用性、灵活性,且嵌套分割算法还在数据优化、计算时间上有显著成效.According to the problem that customers often change their distribution demand on the way of goods delivery,this paper establishes a dynamic management model of customers’ temporary changing of distribution demand.It is a result of researches on undulating quantity between expected cost of planned path and actual cost that may happened in conditions like changing delivery time,changing delivery destination,or canceling delivery temporarily.Based on nested partitions algorithm,it designs proximity rescue strategy,optimum off-line strategy and vehicle quantity addition strategy to solve this model.Finally,the simulation results show that this model can reduce the cost and improve the efficiency in goods distribution and it’s more practicable and flexible than the traditional.The nested partitions algorithm also has a significant effect in optimizing data and decreasing computing time.
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30