ENERGY EFFICIENT SIMULTANEOUS DRONE AND MOBILE CHARGER ROUTING PROBLEM WITH TIME RESTRICTIONS

Date

2023-8-09

Author

Canpolat, Alptuğ Ayberk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

177
views

71
downloads

Cite This

This study focuses on simultaneous routing of a drone and a mobile charging station given a specific time constraint to complete a mission, based on energy efficiency. The drone is expected to visit certain service points within a certain period of time in the problem. During this operation, the energy needed by the drone is provided by the mobile charging station moving on the ground. The aim is to find the most energy-efficient (or time-efficient) route and the velocities of both vehicles during the operation. The route is obtained by operating a matheuristic that integrates various heuristic algorithms and a mathematical model based on Second Order Cone Programming. The aim of this study is to determine the visiting sequence of service points by the drone, the meeting sequence with the mobile charging station, the meeting points (locations), and vehicles' speeds during the operation. These outputs can be obtained under two different objective functions. The first objective function aims to minimize the total energy consumption of the two vehicles, and the second objective function aims to minimize the total system time. In the model implemented with the first objective function, the total system time is one of the most critical constraints. At the end of the study, different experimental setups are created to analyze the impact of variations in parameters and algorithms on the results. Experiments are conducted to examine the impact of different energy consumption parameters of the drone and mobile charging station and total system times on the solution. Additionally, these experiments investigate the effect of different algorithmic setups, such as running the 2-Opt Algorithm with or without a speed-up method and moving on to a new iteration after the first improvement during the trial of alternative routes obtained by 2-Opt or testing all alternatives. The aim is to analyze the impact of these setups on the results. These experiments yield results from instances with varying numbers of service points. The experiments' results and durations are compared and analyzed at the end of the study.

Subject Keywords

Energy Efficiency, Second Order Cone Programming, Drones, Mobile Charging Station, Routing, Rendezvous Problem

URI

https://hdl.handle.net/11511/104908

Collections

Graduate School of Natural and Applied Sciences, Thesis