A MILP Model and Two‐Stage Heuristic Algorithm for Vehicle‐Assisted Multi‐Drone Inspection Routing Problem
ABSTRACT This paper introduces a vehicle‐assisted multi‐drone inspection routing problem (VAMDIRP), which enables the vehicle to repeatedly traverse roads, thereby reducing task completion time. Firstly, a mixed‐integer linear programming (MILP) model is constructed for the problem using a series of decision variables and auxiliary variables. The model can be solved by GUROBI for small‐scale instances. Secondly, a two‐stage heuristic algorithm is proposed to solve large‐scale instances. Experimental results show that this algorithm improves the solution quality by an average of 20.71% and reduces the running time by an average of 60.31% compared to existing algorithms. Finally, a sensitivity analysis is conducted on relevant parameters, revealing that changes in the number and speed of drones significantly affect the solution quality.
Authors
- Yunqiang Yin (ORCID: https://orcid.org/0000-0001-5761-6680)
- He Luo (ORCID: https://orcid.org/0000-0003-2062-5510)
- Yuanqing Xia (ORCID: https://orcid.org/0000-0002-5977-4911)
- Lin Shi-zhong
- Rui Dong (ORCID: https://orcid.org/0000-0001-9645-4768)
- Guoqiang Wang (ORCID: https://orcid.org/0000-0002-2549-6212)
Institutions
- Ministry of Education of the People's Republic of China (CN)
- Hefei University of Technology (CN)
- State Grid Corporation of China (China) (CN)
Publication Details
- Journal
- IET Intelligent Transport Systems
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1049/itr2.70028
- Primary Topic
- Vehicle Routing Optimization Methods
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China