A GENETIC ALGORITHM FOR COLLABORATISVE TRUCK-DRONE ROUTING AND SCHEDULING PROBLEM IN SURVEILLANCE OPERATIONS

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

Drones can access areas that are difficult to reach for ground surveillance resources. However, drones have limited surveillance operations over large areas because of their short flight durations. To tackle the limitations of drones, one viable approach to use trucks as mobile platforms for the takeoff and landing of drones, ensuring close proximity to surveillance areas. However, coordinating the trucks and the drones is challenging due to the combinatorial complexity of scheduling their surveillance routes collaboratively. Motivated by this challenge, this study develops a genetic algorithm to solve the truck-drone routing and scheduling problem for surveillance. This algorithm determines the routes and schedules of multiple trucks and drones to monitor a given set of surveillance areas, aiming to minimize the time spent completing all surveillance operations. A set of numerical experiments is performed to validate the performance of the algorithm and discuss the managerial implications of collaborative surveillance.

키워드

RoutingSchedulingTruck-Drone CollaborationSurveillanceGenetic AlgorithmTRAVELING SALESMAN PROBLEMOPTIMIZATION
제목
A GENETIC ALGORITHM FOR COLLABORATISVE TRUCK-DRONE ROUTING AND SCHEDULING PROBLEM IN SURVEILLANCE OPERATIONS
저자
Son, Dong-HoonKim, Hwa-Joong
DOI
10.23055/ijietap.2025.32.3.10375
발행일
2025-06
유형
Article
저널명
International Journal of Industrial Engineering : Theory Applications and Practice
32
3
페이지
809 ~ 821