基于数学模型的船舶物流配送中心选址与路径布局研究

Q2 Engineering Archives of Transport Pub Date : 2022-09-30 DOI:10.5604/01.3001.0015.9925
Haolin Tong
{"title":"基于数学模型的船舶物流配送中心选址与路径布局研究","authors":"Haolin Tong","doi":"10.5604/01.3001.0015.9925","DOIUrl":null,"url":null,"abstract":"For logistics enterprises, site selection and path layout are related to the cost and efficiency of distribution, which is a very critical issue and has an important impact on the development of enterprises. Compared with land logistics, the cost of marine ship logistics is higher due to the high cost of ships, so the research on the location and path layout of its distribution centers is also particularly important. This paper established a two-layer model under the assumption that unit transportation costs and administration expenses are known for the site selection and path layout problems of marine ship logistics distribution centers. Corresponding constraint conditions were set. The upper layer was the optimization model of the site selection problem of the distribution center, and the objective function was to minimize operating and construction costs and was solved using the quantum particle swarm optimization (QPSO) algorithm. The lower layer was the optimization model of the distribution path layout, and the objective function was to minimize the logistics distribution cost and was solved using the ant colony optimization (ACO) algorithm. The model was veri-fied through an example analysis. It was assumed that there were three ships, five candidate distribution centers, and ten customer points. The model was solved in MATLAB software. The results of the example analysis showed that com-pared with K-means, genetic algorithm (GA), and particle swarm optimization (PSO)-ACO algorithms, the QPSO-ACO algorithm had the shortest running time, about 60 s, which saved about 50% compared to the K-means algorithm. The optimal cost of the QPSO-ACO algorithm was 293,400 yuan, which was significantly lower than the K-means, GA, and PSO-ACO algorithms (459,600 yuan, 398,300 yuan, and 357,700 yuan). In this example, the site obtained by the QPSO-ACO algorithm was distribution center 2, and the obtained path distribution was 1-7-5-4, 2-6-3, and 10-8-9. The results verify the effectiveness of the QPSO-ACO algorithm in solving the problem of site selection and path layout. The QPSO-ACO algorithm can be applied in the actual marine ship logistics.\n\n","PeriodicalId":53541,"journal":{"name":"Archives of Transport","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Research on the site selection and path layout of the logistics distribution center of marine ships based on a mathematical model\",\"authors\":\"Haolin Tong\",\"doi\":\"10.5604/01.3001.0015.9925\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For logistics enterprises, site selection and path layout are related to the cost and efficiency of distribution, which is a very critical issue and has an important impact on the development of enterprises. Compared with land logistics, the cost of marine ship logistics is higher due to the high cost of ships, so the research on the location and path layout of its distribution centers is also particularly important. This paper established a two-layer model under the assumption that unit transportation costs and administration expenses are known for the site selection and path layout problems of marine ship logistics distribution centers. Corresponding constraint conditions were set. The upper layer was the optimization model of the site selection problem of the distribution center, and the objective function was to minimize operating and construction costs and was solved using the quantum particle swarm optimization (QPSO) algorithm. The lower layer was the optimization model of the distribution path layout, and the objective function was to minimize the logistics distribution cost and was solved using the ant colony optimization (ACO) algorithm. The model was veri-fied through an example analysis. It was assumed that there were three ships, five candidate distribution centers, and ten customer points. The model was solved in MATLAB software. The results of the example analysis showed that com-pared with K-means, genetic algorithm (GA), and particle swarm optimization (PSO)-ACO algorithms, the QPSO-ACO algorithm had the shortest running time, about 60 s, which saved about 50% compared to the K-means algorithm. The optimal cost of the QPSO-ACO algorithm was 293,400 yuan, which was significantly lower than the K-means, GA, and PSO-ACO algorithms (459,600 yuan, 398,300 yuan, and 357,700 yuan). In this example, the site obtained by the QPSO-ACO algorithm was distribution center 2, and the obtained path distribution was 1-7-5-4, 2-6-3, and 10-8-9. The results verify the effectiveness of the QPSO-ACO algorithm in solving the problem of site selection and path layout. The QPSO-ACO algorithm can be applied in the actual marine ship logistics.\\n\\n\",\"PeriodicalId\":53541,\"journal\":{\"name\":\"Archives of Transport\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archives of Transport\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5604/01.3001.0015.9925\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archives of Transport","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5604/01.3001.0015.9925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

摘要

对于物流企业来说,选址和路径布局关系到配送的成本和效率,是一个非常关键的问题,对企业的发展有着重要的影响。与陆地物流相比,由于船舶成本较高,海运物流的成本较高,因此对其配送中心的选址和路径布局的研究也显得尤为重要。本文在单位运输成本和管理费用已知的前提下,建立了船舶物流配送中心选址和路径布局问题的两层模型。设置相应的约束条件。上层为配送中心选址问题的优化模型,以运营成本和建设成本最小为目标函数,采用量子粒子群优化算法求解。下层为配送路径布局优化模型,目标函数为物流配送成本最小,采用蚁群优化算法求解。通过算例分析验证了模型的正确性。假设有三艘船,五个候选配送中心和十个客户点。在MATLAB软件中对模型进行了求解。算例分析结果表明,与K-means、遗传算法(GA)和粒子群优化(PSO)-ACO算法相比,QPSO-ACO算法运行时间最短,约为60 s,比K-means算法节省约50%的时间。QPSO-ACO算法的最优成本为29.34万元,显著低于K-means、GA和PSO-ACO算法(45.96万元、39.83万元、35.77万元)。本例中,QPSO-ACO算法得到的站点为配送中心2,得到的路径分布为1-7-5-4、2-6-3和10-8-9。结果验证了QPSO-ACO算法在解决选址和路径布局问题上的有效性。QPSO-ACO算法可以应用于实际的船舶物流。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Research on the site selection and path layout of the logistics distribution center of marine ships based on a mathematical model
For logistics enterprises, site selection and path layout are related to the cost and efficiency of distribution, which is a very critical issue and has an important impact on the development of enterprises. Compared with land logistics, the cost of marine ship logistics is higher due to the high cost of ships, so the research on the location and path layout of its distribution centers is also particularly important. This paper established a two-layer model under the assumption that unit transportation costs and administration expenses are known for the site selection and path layout problems of marine ship logistics distribution centers. Corresponding constraint conditions were set. The upper layer was the optimization model of the site selection problem of the distribution center, and the objective function was to minimize operating and construction costs and was solved using the quantum particle swarm optimization (QPSO) algorithm. The lower layer was the optimization model of the distribution path layout, and the objective function was to minimize the logistics distribution cost and was solved using the ant colony optimization (ACO) algorithm. The model was veri-fied through an example analysis. It was assumed that there were three ships, five candidate distribution centers, and ten customer points. The model was solved in MATLAB software. The results of the example analysis showed that com-pared with K-means, genetic algorithm (GA), and particle swarm optimization (PSO)-ACO algorithms, the QPSO-ACO algorithm had the shortest running time, about 60 s, which saved about 50% compared to the K-means algorithm. The optimal cost of the QPSO-ACO algorithm was 293,400 yuan, which was significantly lower than the K-means, GA, and PSO-ACO algorithms (459,600 yuan, 398,300 yuan, and 357,700 yuan). In this example, the site obtained by the QPSO-ACO algorithm was distribution center 2, and the obtained path distribution was 1-7-5-4, 2-6-3, and 10-8-9. The results verify the effectiveness of the QPSO-ACO algorithm in solving the problem of site selection and path layout. The QPSO-ACO algorithm can be applied in the actual marine ship logistics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Archives of Transport
Archives of Transport Engineering-Automotive Engineering
CiteScore
2.50
自引率
0.00%
发文量
26
审稿时长
24 weeks
期刊最新文献
Proactive safety assessment of urban through-roads based on GPS data The Multidimensional Threats of Unmanned Aerial Systems: Exploring Biomechanical, Technical, Operational, and Legal Solutions for Ensuring Safety and Security Predicting severe wildlife vehicle crashes (WVCs) on New Hampshire roads using a hybrid generalized additive model Research on port AGV trajectory tracking control based on improved fuzzy sliding mode control Suitable law-based location selection of high-power electric vehicles charging stations on the TEN-T core network for sustainability: a case of Poland
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1