Fei Deng, Yixuan Wei, Yiqiao Liu, Botao Yan, Jinshun Wu, Ying Cui, Song Pan
{"title":"Distribution route optimisation of emergency supplies based on improved grey wolf optimisation algorithm","authors":"Fei Deng, Yixuan Wei, Yiqiao Liu, Botao Yan, Jinshun Wu, Ying Cui, Song Pan","doi":"10.1080/13675567.2023.2278479","DOIUrl":null,"url":null,"abstract":"The trade-off between the timely delivery of emergency supplies and the long distribution path distance can be described as a generalised multiple travelling salesman problem. To solve this problem, the IDGWOA was proposed to minimise the longest distribution path. Taking the data of several lockdown zones in Pudong, Shanghai, as an example, 10 optimal material distribution routes were obtained by simulation. The results showed that the average distribution route distance was about 22.5 km and the longest distribution distance was 26.40 km. The results verified the effectiveness of the proposed algorithm, realising a reasonable guarantee of supply distribution. Finally, four standard travelling salesman problem datasets were used and the results were compared with five other intelligent optimisation algorithms. The results showed that the relative error value index of the improved algorithm was the smallest for the same dataset, indicating that the algorithm achieves the highest accuracy.","PeriodicalId":14018,"journal":{"name":"International Journal of Logistics Research and Applications","volume":null,"pages":null},"PeriodicalIF":4.5000,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Logistics Research and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/13675567.2023.2278479","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0
Abstract
The trade-off between the timely delivery of emergency supplies and the long distribution path distance can be described as a generalised multiple travelling salesman problem. To solve this problem, the IDGWOA was proposed to minimise the longest distribution path. Taking the data of several lockdown zones in Pudong, Shanghai, as an example, 10 optimal material distribution routes were obtained by simulation. The results showed that the average distribution route distance was about 22.5 km and the longest distribution distance was 26.40 km. The results verified the effectiveness of the proposed algorithm, realising a reasonable guarantee of supply distribution. Finally, four standard travelling salesman problem datasets were used and the results were compared with five other intelligent optimisation algorithms. The results showed that the relative error value index of the improved algorithm was the smallest for the same dataset, indicating that the algorithm achieves the highest accuracy.
期刊介绍:
International Journal of Logistics: Research & Applications publishes original and challenging work that has a clear applicability to the business world. As a result the journal concentrates on papers of an academic journal standard but aimed at the practitioner as much as the academic. High quality contributions are therefore welcomed from both academics and professionals working in the field of logistics and supply chain management. Papers should further our understanding of logistics and supply chain management and make a significant original contribution to knowledge. In this context the term "logistics" is taken in its broadest context as "the management of processes, flow of materials and associated information along the entire supply chain.