Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
An Elliptical Cover Problem In Drone Delivery Network Design And Its Solution Algorithms, Yanchao Liu
An Elliptical Cover Problem In Drone Delivery Network Design And Its Solution Algorithms, Yanchao Liu
Industrial and Systems Engineering Faculty Research Publications
Given n demand points in a geographic area, the elliptical cover problem is to determine the location of p depots (anywhere in the area) so as to minimize the maximum distance of an economical delivery trip in which a delivery vehicle starts from the nearest depot to a demand point, visits the demand point and then returns to the second nearest depot to that demand point. We show that this problem is NP-hard, and adapt Cooper’s alternating locate-allocate heuristic to find locally optimal solutions for both the point-coverage and area-coverage scenarios. Experiments show that most locally optimal solutions perform similarly …