Drones, or unmanned aerial vehicles (UAVs), have the potential to considerably reduce the cost and time required to deliver parcels. This paper addresses a parcel delivery scheduling problem, which is to find the optimal assignment of customers to the drones and their takeoff points. In this problem, depending on the number of the drones, the optimal solution changes. We propose a genetic algorithm to find near-optimal solutions simultaneously for multiple different numbers of the drones. The performance of the proposed method is evaluated through conducting experiments.
J-STAGEがリニューアルされました! https://www.jstage.jst.go.jp/browse/-char/ja/
