首页 | 本学科首页   官方微博 | 高级检索  
     检索      

服务半径约束下城市快递双层配送网络节点选址优化
引用本文:杜刚诚,冉林娜.服务半径约束下城市快递双层配送网络节点选址优化[J].上海海事大学学报,2019,40(2):41-47.
作者姓名:杜刚诚  冉林娜
作者单位:广州市交通规划研究院;同济大学道路与交通工程教育部重点实验室
摘    要:为提高快递配送效率,基于城市快递双层配送网络的构成和优势,建立该网络二级节点选址模型,包括末端配送站点和便民寄存点选址,其中便民寄存点选址需考虑服务半径约束和容量限制。提出分解算法进行模型求解,其中针对便民寄存点选址采用改进的最少点覆盖启发式算法,针对末端配送站点选址采用k-均值聚类算法。利用算例进行模型和算法验证,结果表明,该模型和算法能有效解决城市快递双层配送网络的节点选址优化问题。

关 键 词:物流规划  城市快递  双层配送网络  节点选址
收稿时间:2018/5/14 0:00:00
修稿时间:2019/3/14 0:00:00

Node location optimization of urban express double-layer distribution network under constraint of service radius
Dugangcheng and Ranlinna.Node location optimization of urban express double-layer distribution network under constraint of service radius[J].Journal of Shanghai Maritime University,2019,40(2):41-47.
Authors:Dugangcheng and Ranlinna
Institution:Guangzhou Transport Planning Research Institute and Tongji University
Abstract:In order to improve the efficiency of express delivery, based on the structure and advantages of the double layer distribution network of urban express delivery, a two level node location model of the network is established, where the nodes include the terminal distribution stations and temporary storage stations, and the service radius constraint and capacity constraint are considered in the location of temporary storage stations. A decomposition algorithm is used to solve the model, where an improved least point coverage heuristic algorithm is applied to the node location of temporary storage stations, and the k means clustering algorithm is applied to the node location of terminal distribution stations. An example is used to verify the model and the algorithm. The result shows that the model and the algorithm can effectively solve the node location optimization problem of the urban express double layer distribution network.
Keywords:logistics planning  urban express delivery  double layer distribution network  node location
本文献已被 CNKI 等数据库收录!
点击此处可从《上海海事大学学报》浏览原始摘要信息
点击此处可从《上海海事大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号