Affiliation:
1. Department of Computer Engineering, King Mongkut’s University of Technology, Thonburi, Bangkok, Thailand.
Abstract
This paper investigates the problem of route planning for rechargeable unmanned aerial vehicles (UAV) under the mission time constraint in cases where more than one trip per round is required due to limited battery capacities. The goal is to determine the number of UAVs to be deployed and the flying paths that minimize the total mission cost. Unlike previous works, the electric cost incurred by UAV recharging proportional to actual flying distances is incorporated into our model. The problem is formulated as a mixed-integer programming model to minimize the sum of electric charging cost, the UAV usage cost, and the penalty cost from the violation of the mission time constraint. Extensive numerical experiments are conducted to examine the integrity and performance of the proposed model under various model parameters and deployment scenarios in grid areas and a real terrain area. The optimal solutions can be obtained for small-scale problem instances in a reasonable runtime. For large-scale problems, only feasible solutions can be obtained due to limited computational resources.
Publisher
International Journal of Mathematical, Engineering and Management Sciences plus Mangey Ram
Subject
General Engineering,General Business, Management and Accounting,General Mathematics,General Computer Science
Reference23 articles.
1. Alonso, F., Alvarez, M.J., & Beasley, J.E. (2008). A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of the Operational Research Society, 59, 963-976. https://doi.org/10.1057/palgrave.jors.2602405.
2. Aurambout, J.P., Gkoumas, K., & Ciuffo, B. (2019). Last mile delivery by drones: an estimation of viable market potential and access to citizens across European cities. European Transport Research Review, 11(30), 1-21. https://doi.org/10.1186/s12544-019-0368-2.
3. Authority, M.E. (2020). Energy charge of residential. URL: https://www.mea.or.th/en/profile/109/111.
4. Ayadi, R., & Benadada, Y. (2013). Memetic algorithm for a multi-objective vehicle routing problem with multiple trips. International Journal of Computer Science and Applications, 10(2), 72-91.
5. Choi, Y., Robertson, B., Choi, Y., & Mavris, D. (2019). A multi-trip vehicle routing problem for small unmanned aircraft systems-based urban delivery. Journal of Aircraft, 56(6), 2309-2323. https://doi.org/10.2514/1.C035473
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献