It is an optimization problem minimizing the total travel distance of the drones in the environment of the locker-based drone delivery (LDD), in which the roofs of the lockers are reused as airports for drones such that the lockers and drones can work in a cooperative manner.
As any a drone must park on a locker, the limited number of lockers become a contested resource for drones. The LDDP is a routing and parking hybrid combinatorial problem. We creatively put forward a solution method for the problem based on dynamic graph theory and mathematical programming.
The numerical tests show that our algorithm can solve all the 30 uniformly-generated instances, the largest of which has 1000 sites and 1500 tasks, to optimal in less than 1 minute; can solve all the 81 simulated instances for cities Beijing, Hangzhou... within 1 second.
All the instances as well as the detail solutions are available on the website. And a simple statistical results can also be found in the right-hand of the first page.
For further information please don't hesitate to contact us.