Abstract
In the last decade, aerial delivery system has been considered as a promising response to increasing traffic jams and incremental demand for transportation. In this study, a distance-constrained mobile hierarchical facility location problem is used in order to find the optimal number and locations of launch and recharge stations with the objective of minimizing the total costs of the system. System costs include establishment cost for launching and recharge stations, drone procurement, and drone usage costs. It is supposed that the demand occurs according to Poisson distribution, distributed uniformly along the network edges and is satisfied by the closest open facility. Since the flying duration of a drone is limited to its endurance, it may visit one or more recharge stations to reach to the demand point. This route is calculated by the shortest path algorithm, and the Euclidean distance is considered between nodes and facilities. It is proved that facility location problems are NP-hard on a general graph. Accordingly, heuristic algorithms are proposed as solution method. To illustrate the applicability of the algorithms, a case study is presented and the results are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
