An elliptical cover problem in drone delivery network design and its solution algorithms

DOI10.1016/j.ejor.2022.04.034OpenAlexW4224996701MaRDI QIDQ2079395

Yanchao Liu

Publication date: 29 September 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.04.034

zbMATH Keywords

locationNP-hard problemarea coverageellipsesdrone delivery

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

A trajectory based heuristic for the planar \(p\)-median problem

Uses Software

• BARON
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous multifacility ordered median location problems
• New heuristic algorithms for solving the planar \(p\)-median problem
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• Facility location models for distribution system design
• A continuous location-allocation problem with zone-dependent fixed cost
• Optimal location with equitable loads
• On a circle placement problem
• Facility location models for distribution planning
• An optimal method for solving the (generalized) multi-Weber problem
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
• BARON: A general purpose global optimization software package
• Covering problems with polyellipsoids: a location analysis perspective
• New exact algorithms for planar maximum covering location by ellipses problems
• Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
• An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones
• The optimal solution set of the multi-source Weber problem
• On the Complexity of Some Common Geometric Location Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Improved starting solutions for the planar p-median problem
• An Algorithm for the p-Center Problem in the Plane
• The p-center location problem in an area
• The Plant Location Problem: New Models and Research Prospects
• Heuristic Methods for Location-Allocation Problems
• Solving the continuous space p-centre problem: planning application issues
• The m-Center Problem

This page was built for publication: An elliptical cover problem in drone delivery network design and its solution algorithms