Routing for unmanned aerial vehicles: touring dimensional sets

DOI10.1016/j.ejor.2021.06.061zbMath1490.90295arXiv2012.02547OpenAlexW3180631778MaRDI QIDQ2076917

Carlos Valverde, Justo Puerto

Publication date: 22 February 2022

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

Full work available at URL: https://arxiv.org/abs/2012.02547

zbMATH Keywords

networksroutinglogisticsconic programming and interior point methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Interior-point methods (90C51)

Related Items (7)

Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ On hub location problems in geographically flexible networks ⋮ A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management ⋮ The multi‐purpose K‐drones general routing problem ⋮ An extended model of coordination of an all‐terrain vehicle and a multivisit drone ⋮ Minimum cost \(b\)-matching problems with neighborhoods

Uses Software

• Gurobi
• GitHub

Cites Work

• Unnamed Item
• Applications of second-order cone programming
• Partitioning procedures for solving mixed-variables programming problems
• Approximation algorithms for the Geometric Covering Salesman Problem
• Variable neighborhood search
• Continuous location of dimensional structures.
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
• Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem
• On location-allocation problems for dimensional facilities
• Ordered \(p\)-median problems with neighbourhoods
• Generalized Benders decomposition
• On crossings, the Crossing Postman Problem, and the Rural Postman Problem
• Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
• Integer Programming Formulation of Traveling Salesman Problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A fundamental problem in vehicle routing
• The travelling salesman problem with neighbourhoods: MINLP solution
• Arc Routing
• Minimum Spanning Tree with Neighborhoods

This page was built for publication: Routing for unmanned aerial vehicles: touring dimensional sets