Fast optimization for large scale logistics in complex urban systems using the hybrid sparrow search algorithm

IF 4.3 1区 地球科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Geographical Information Science Pub Date : 2023-03-24 DOI:10.1080/13658816.2023.2190371
Yao Yao, Siqi Lei, Zijin Guo, Yuanyuan Li, Shuliang Ren, Zhihang Liu, Qingfeng Guan, Peng Luo
{"title":"Fast optimization for large scale logistics in complex urban systems using the hybrid sparrow search algorithm","authors":"Yao Yao, Siqi Lei, Zijin Guo, Yuanyuan Li, Shuliang Ren, Zhihang Liu, Qingfeng Guan, Peng Luo","doi":"10.1080/13658816.2023.2190371","DOIUrl":null,"url":null,"abstract":"Abstract Urban logistics is vital to the development and operation of cities, and its optimization is highly beneficial to economic growth. The increasing customer needs and the complexity of urban systems are two challenges for current logistics optimization. However, little research considers both, failing to balance efficiency and cost. In this study, we propose a hybrid sparrow search algorithm (SA-SSA) by combining the sparrow search algorithm with fast computational speed and the simulated annealing algorithm with the ability to get the global optimum solution. Wuhan city was selected for logistics optimization experiments. The results show that the SA-SSA can optimize large-scale urban logistics with guaranteed efficiency and solution quality. Compared with simulated annealing, sparrow search, and genetic algorithm, the cost of SA-SSA was reduced by 17.12, 18.62, and 14.72%, respectively. Although the cost of SS-SSA was 11.50% higher than the ant colony algorithm, its computation time was reduced by 99.06%. In addition, the simulation experiments were conducted to explore the impact of spatial elements on the algorithm performance. The SA-SSA can provide high-quality solutions with high efficiency, considering the constraints of many customers and complex road networks. It can support realizing the scientific scheduling of distribution vehicles by logistics enterprises.","PeriodicalId":14162,"journal":{"name":"International Journal of Geographical Information Science","volume":"37 1","pages":"1420 - 1448"},"PeriodicalIF":4.3000,"publicationDate":"2023-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Geographical Information Science","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.1080/13658816.2023.2190371","RegionNum":1,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract Urban logistics is vital to the development and operation of cities, and its optimization is highly beneficial to economic growth. The increasing customer needs and the complexity of urban systems are two challenges for current logistics optimization. However, little research considers both, failing to balance efficiency and cost. In this study, we propose a hybrid sparrow search algorithm (SA-SSA) by combining the sparrow search algorithm with fast computational speed and the simulated annealing algorithm with the ability to get the global optimum solution. Wuhan city was selected for logistics optimization experiments. The results show that the SA-SSA can optimize large-scale urban logistics with guaranteed efficiency and solution quality. Compared with simulated annealing, sparrow search, and genetic algorithm, the cost of SA-SSA was reduced by 17.12, 18.62, and 14.72%, respectively. Although the cost of SS-SSA was 11.50% higher than the ant colony algorithm, its computation time was reduced by 99.06%. In addition, the simulation experiments were conducted to explore the impact of spatial elements on the algorithm performance. The SA-SSA can provide high-quality solutions with high efficiency, considering the constraints of many customers and complex road networks. It can support realizing the scientific scheduling of distribution vehicles by logistics enterprises.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于混合麻雀搜索算法的复杂城市系统大规模物流快速优化
摘要城市物流对城市的发展和运营至关重要,其优化对经济增长非常有利。不断增长的客户需求和城市系统的复杂性是当前物流优化的两大挑战。然而,很少有研究考虑两者,未能平衡效率和成本。在本研究中,我们将计算速度快的麻雀搜索算法和能够获得全局最优解的模拟退火算法相结合,提出了一种混合麻雀搜索算法(SA-SSA)。选择武汉市进行物流优化实验。结果表明,SA-SSA可以在保证效率和解决方案质量的前提下优化大型城市物流。与模拟退火、麻雀搜索和遗传算法相比,SA-SSA的成本分别降低了17.12%、18.62%和14.72%。尽管SS-SSA的成本比蚁群算法高11.50%,但其计算时间减少了99.06%。此外,还进行了仿真实验,探讨了空间元素对算法性能的影响。考虑到许多客户和复杂道路网络的限制,SA-SSA可以提供高效的高质量解决方案。支持物流企业实现配送车辆的科学调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
11.00
自引率
7.00%
发文量
81
审稿时长
9 months
期刊介绍: International Journal of Geographical Information Science provides a forum for the exchange of original ideas, approaches, methods and experiences in the rapidly growing field of geographical information science (GIScience). It is intended to interest those who research fundamental and computational issues of geographic information, as well as issues related to the design, implementation and use of geographical information for monitoring, prediction and decision making. Published research covers innovations in GIScience and novel applications of GIScience in natural resources, social systems and the built environment, as well as relevant developments in computer science, cartography, surveying, geography and engineering in both developed and developing countries.
期刊最新文献
GPU-accelerated parallel all-pair shortest path routing within stochastic road networks Collective flow-evolutionary patterns reveal the mesoscopic structure between snapshots of spatial network Geospatial foundation models for image analysis: evaluating and enhancing NASA-IBM Prithvi’s domain adaptability Translating street view imagery to correct perspectives to enhance bikeability and walkability studies A multi-view ensemble machine learning approach for 3D modeling using geological and geophysical data
×
引用
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