检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈婷 CHEN Ting(Logistics Management Engineering College,Nanning Normal University,Nanning Guangxi 530299,China)
机构地区:[1]南宁师范大学物流管理与工程学院,广西南宁530299
出 处:《计算机仿真》2021年第3期355-359,共5页Computer Simulation
基 金:2016年度广西师范学院青年科研基金项目(0807-QNJJ2016007)。
摘 要:在快递爆仓期间,应用传统的物流配送路线规划方法规划出的配送路线成本较高。为了解决上述问题,提出一种新的电商物流末端配送路线规划方法。设立农产品电子商务平台,在平台上划分配送区域并采集配送的起始点,按照需求点的数量和距离选择配送中心地址、按照送货的距离进行配送排序得到初始路径,最后利用蚁群算法,从时间最短、路程最短、运费最省三个方面实现物流配送原始路径的优化,并通过更新信息素的方法实现配送路线的动态更新。经仿真可知:相较于传统的配送路线规划方法,该配送路线规划方法规划出的路线时间成本节省了33.3%,路程成本节省了24.5%,运费成本节省了60.1%,实现了有效的路径规划。In this article,a new route planning method for e-commerce logistics terminal distribution was proposed.At first,e-commerce platform of agricultural products was built.On the platform,the distribution regions were divided and the starting points for distribution were collected.According to the number and distance of demand points,the distribution center address was selected.Based on the distribution distance,the initial path was obtained by distribution scheduling.Finally,the ant colony algorithm was adopted.In order to minimize total transportation cost,time and distance,the original path of logistics distribution was optimized.Thus,the dynamic update of delivery path was achieved by updating the pheromone.Simulation results show that,compared with the traditional distribution route planning method,the proposed method saves 33.3%of the time cost,24.5%of the distance cost,and 60.1%of the freight cost.Thus,the effective path planning is achieved.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.13.165