Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/76132
Title: Routing drones with refuelling constraints
Authors: Lee, Gary Yanqing
Keywords: DRNTU::Engineering::Computer science and engineering::Computer applications
Issue Date: 2018
Abstract: Drone delivery reduces the time and cost of delivery which benefit both the company and the end-user. However, battery constraint is one of the main factor that limits the effective range of the drone and requires additional recharge during flight mission and this translates to additional costs. The environment states when the drone is executing the flight plan may change and affect the recharging plan and the overall cost therefore this report proposed heuristic Insert, Reduce, Exchange (heuristicIRE) algorithm that can generate a near optimal solution fast. The problem scenario is the drone starts from initial depot, visit a sequence of targets and recharge along the way if needed, and return to the initial depot. The average cost difference against the benchmark algorithm is less than 1% and the solution is generated in less than 10ms with a range of targets from 15 to 30 incremented by 5. The algorithm improves drone adaptability during re-planning of flight during flight execution when environment state changes and the reduced cost and time can bring more benefits to the company and the end-user in drone routing.
URI: http://hdl.handle.net/10356/76132
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
FYP_Report_amended.pdf
  Restricted Access
1.16 MBAdobe PDFView/Open

Page view(s) 20

32
checked on Oct 24, 2020

Download(s) 20

6
checked on Oct 24, 2020

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.