• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于资源共享的协同多中心物流配送网络优化

Collaborative multicenter logistics delivery network optimization with resource sharing.

作者信息

Deng Shejun, Yuan Yingying, Wang Yong, Wang Haizhong, Koll Charles

机构信息

College of Civil Science and Engineering, Yangzhou University, Yangzhou, China.

School of Management, Shanghai University, Shanghai, China.

出版信息

PLoS One. 2020 Nov 23;15(11):e0242555. doi: 10.1371/journal.pone.0242555. eCollection 2020.

DOI:10.1371/journal.pone.0242555
PMID:33227040
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7682872/
Abstract

Collaboration among logistics facilities in a multicenter logistics delivery network can significantly improve the utilization of logistics resources through resource sharing including logistics facilities, vehicles, and customer services. This study proposes and tests different resource sharing schemes to solve the optimization problem of a collaborative multicenter logistics delivery network based on resource sharing (CMCLDN-RS). The CMCLDN-RS problem aims to establish a collaborative mechanism of allocating logistics resources in a manner that improves the operational efficiency of a logistics network. A bi-objective optimization model is proposed with consideration of various resource sharing schemes in multiple service periods to minimize the total cost and number of vehicles. An adaptive grid particle swarm optimization (AGPSO) algorithm based on customer clustering is devised to solve the CMCLDN-RS problem and find Pareto optimal solutions. An effective elite iteration and selective endowment mechanism is designed for the algorithm to combine global and local search to improve search capabilities. The solution of CMCLDN-RS guarantees that cost savings are fairly allocated to the collaborative participants through a suitable profit allocation model. Compared with the computation performance of the existing nondominated sorting genetic algorithm-II and multi-objective evolutionary algorithm, AGPSO is more computationally efficient. An empirical case study in Chengdu, China suggests that the proposed collaborative mechanism with resource sharing can effectively reduce total operational costs and number of vehicles, thereby enhancing the operational efficiency of the logistics network.

摘要

多中心物流配送网络中物流设施之间的协作可以通过包括物流设施、车辆和客户服务在内的资源共享,显著提高物流资源的利用率。本研究提出并测试了不同的资源共享方案,以解决基于资源共享的协作式多中心物流配送网络(CMCLDN-RS)的优化问题。CMCLDN-RS问题旨在建立一种物流资源分配的协作机制,以提高物流网络的运营效率。考虑到多个服务期内的各种资源共享方案,提出了一个双目标优化模型,以最小化总成本和车辆数量。设计了一种基于客户聚类的自适应网格粒子群优化(AGPSO)算法来解决CMCLDN-RS问题并找到帕累托最优解。为该算法设计了一种有效的精英迭代和选择性赋权机制,将全局搜索和局部搜索相结合以提高搜索能力。CMCLDN-RS的解决方案通过合适的利润分配模型,保证成本节约能够公平地分配给协作参与者。与现有的非支配排序遗传算法-II和多目标进化算法的计算性能相比,AGPSO的计算效率更高。在中国成都的一个实证案例研究表明,所提出的具有资源共享的协作机制可以有效降低总运营成本和车辆数量,从而提高物流网络的运营效率。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/ee415651dbed/pone.0242555.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/f5d3de790cae/pone.0242555.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/d8a53b17fb96/pone.0242555.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/ab639c84a859/pone.0242555.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/037f00430997/pone.0242555.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/134c7cb99375/pone.0242555.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/44763ffed18c/pone.0242555.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/1fbb9b9d9573/pone.0242555.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/ee415651dbed/pone.0242555.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/f5d3de790cae/pone.0242555.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/d8a53b17fb96/pone.0242555.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/ab639c84a859/pone.0242555.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/037f00430997/pone.0242555.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/134c7cb99375/pone.0242555.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/44763ffed18c/pone.0242555.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/1fbb9b9d9573/pone.0242555.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8351/7682872/ee415651dbed/pone.0242555.g008.jpg

相似文献

1
Collaborative multicenter logistics delivery network optimization with resource sharing.基于资源共享的协同多中心物流配送网络优化
PLoS One. 2020 Nov 23;15(11):e0242555. doi: 10.1371/journal.pone.0242555. eCollection 2020.
2
A Vehicle Routing Optimization Problem for Cold Chain Logistics Considering Customer Satisfaction and Carbon Emissions.考虑顾客满意度和碳排放的冷链物流车辆路径优化问题
Int J Environ Res Public Health. 2019 Feb 16;16(4):576. doi: 10.3390/ijerph16040576.
3
Emergency logistics network optimization with time window assignment.带时间窗分配的应急物流网络优化
Expert Syst Appl. 2023 Mar 15;214:119145. doi: 10.1016/j.eswa.2022.119145. Epub 2022 Oct 31.
4
Research on benefit allocation based on multi-weight H-Shapley value: A case study of express logistics sharing.基于多权重 H-Shapley 值的利益分配研究——以快递物流共享为例。
PLoS One. 2024 Jul 11;19(7):e0305656. doi: 10.1371/journal.pone.0305656. eCollection 2024.
5
Optimization of Location-Routing Problem in Emergency Logistics Considering Carbon Emissions.考虑碳排放的应急物流选址-路径问题优化。
Int J Environ Res Public Health. 2019 Aug 19;16(16):2982. doi: 10.3390/ijerph16162982.
6
Optimizing oil spill emergency logistics: a time-varying multi-resource collaborative scheduling model.优化溢油应急物流:一种时变多资源协同调度模型
Environ Sci Pollut Res Int. 2024 Jan;31(2):2773-2801. doi: 10.1007/s11356-023-30987-7. Epub 2023 Dec 8.
7
A Comparative Study on the Routing Problem of Electric and Fuel Vehicles Considering Carbon Trading.考虑碳交易的电动汽车和燃油汽车路径问题的比较研究。
Int J Environ Res Public Health. 2019 Aug 27;16(17):3120. doi: 10.3390/ijerph16173120.
8
Optimization of Location-Routing Problem for Cold Chain Logistics Considering Carbon Footprint.考虑碳足迹的冷链物流选址-路径问题优化。
Int J Environ Res Public Health. 2018 Jan 6;15(1):86. doi: 10.3390/ijerph15010086.
9
A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a Green Operation Perspective.一种新的 TS 算法,用于解决具有拆分交付的低碳物流车辆路径问题——从绿色运营角度。
Int J Environ Res Public Health. 2018 May 10;15(5):949. doi: 10.3390/ijerph15050949.
10
Characteristic Analysis and Route Optimization of Heterogeneous Neural Network in Logistics Allocation System.物流配送系统中异构神经网络的特征分析与路径优化。
Comput Intell Neurosci. 2022 May 31;2022:1713183. doi: 10.1155/2022/1713183. eCollection 2022.

引用本文的文献

1
Evaluation of the sustainable development of logistics based on local characteristics: Matching logistics architecture with resources.基于地方特色的物流可持续发展评价:物流架构与资源匹配。
PLoS One. 2024 Oct 15;19(10):e0307078. doi: 10.1371/journal.pone.0307078. eCollection 2024.

本文引用的文献

1
Dendritic Neuron Model With Effective Learning Algorithms for Classification, Approximation, and Prediction.具有有效学习算法的树突状神经元模型用于分类、逼近和预测。
IEEE Trans Neural Netw Learn Syst. 2019 Feb;30(2):601-614. doi: 10.1109/TNNLS.2018.2846646. Epub 2018 Jul 10.
2
A Two-Stage Multiobjective Evolutionary Algorithm for Multiobjective Multidepot Vehicle Routing Problem With Time Windows.一种用于带时间窗的多目标多配送中心车辆路径问题的两阶段多目标进化算法。
IEEE Trans Cybern. 2019 Jul;49(7):2467-2478. doi: 10.1109/TCYB.2018.2821180. Epub 2018 Apr 16.
3
Exact solutions for the collaborative pickup and delivery problem.
协同取送货问题的精确解
Cent Eur J Oper Res. 2018;26(2):357-371. doi: 10.1007/s10100-017-0503-x. Epub 2017 Nov 15.
4
Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.增强型智能水滴算法求解多仓库车辆路径问题。
PLoS One. 2018 Mar 19;13(3):e0193751. doi: 10.1371/journal.pone.0193751. eCollection 2018.
5
Improved artificial bee colony algorithm for vehicle routing problem with time windows.用于带时间窗车辆路径问题的改进人工蜂群算法
PLoS One. 2017 Sep 29;12(9):e0181275. doi: 10.1371/journal.pone.0181275. eCollection 2017.
6
Approximating the nondominated front using the Pareto Archived Evolution Strategy.使用帕累托存档进化策略逼近非支配前沿。
Evol Comput. 2000 Summer;8(2):149-72. doi: 10.1162/106365600568167.