Improved PSO-Based Two-Phase Logistics UAV Path Planning under Dynamic Demand and Wind Conditions

Author:

Tang Guangfu1,Xiao Tingyue1,Du Pengfei1ORCID,Zhang Peiying23ORCID,Liu Kai45ORCID,Tan Lizhuang36

Affiliation:

1. Engineering Research Center of Intelligent Airground Integrated Vehicle and Traffic Control, Ministry of Education, Xihua University, Chengdu 610039, China

2. Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China

3. Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan 250013, China

4. State Key Laboratory of Space Network and Communications, Tsinghua University, Beijing 100084, China

5. Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing 100084, China

6. Shandong Provincial Key Laboratory of Computer Networks, Shandong Fundamental Research Center for Computer Science, Jinan 250013, China

Abstract

Unmanned aerial vehicles (UAVs) have increasingly become integral to logistics and distribution due to their flexibility and mobility. However, the existing studies often overlook the dynamic nature of customer demands and wind conditions, limiting the practical applicability of their proposed strategies. To tackle this challenge, we firstly construct a time-slicing-based UAV path planning model that incorporates dynamic customer demands and wind impacts. Based on this model, a two-stage logistics UAV path planning framework is developed according to the analysis of the customer pool updates and dynamic attitudes. Secondly, a dynamic demand and wind-aware logistics UAV path planning problem is formulated to minimize the weighted average of the energy consumption and the customer satisfaction penalty cost, which comprehensively takes the energy consumption constraints, load weight constraints, and hybrid time window constraints into consideration. To solve this problem, an improved particle swarm optimization (PSO)-based multiple logistics UAV path planning algorithm is developed, which has good performance with fast convergence and better solutions. Finally, extensive simulation results verify that the proposed algorithm can not only adhere to the UAV’s maximum load and battery power constraints but also significantly enhance the loading efficiency and battery utilization rate. Particularly, compared to the genetic algorithm (GA), simulated annealing (SA), and traditional PSO strategies, our proposed algorithm achieves satisfactory solutions within a reasonable time frame and reduces the distribution costs by up to 9.82%.

Funder

National Natural Science Foundation of China

Natural Science Foundation of Sichuan Province

Shandong Provincial Natural Science Foundation

Open Foundation of Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Qilu University of Technology

Publisher

MDPI AG

Reference50 articles.

1. Smart Logistics Based on the Internet of Things Technology: An Overview;Ding;Int. J. Logist. Res. Appl.,2021

2. Operations Management of Smart Logistics: A Literature Review and Future Research;Feng;Front. Eng. Manag.,2021

3. Big Data IoT-based Agile-lean Logistic in Pharmaceutical Industries;Aliahmadi;Int. J. Innov. Manag. Econ. Soc. Sci.,2022

4. Solving the Last Mile Problem in Logistics: A Mobile Edge Computing and Blockchain-Based Unmanned Aerial Vehicle Delivery System;Li;Concurr. Comput. Pract. Exp.,2022

5. Amazon Plans to Take Home Delivery to New Heights;Jones;IEEE Spectr.,2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3