A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning

DOI10.1016/j.ejor.2021.09.008zbMath1506.90048OpenAlexW3200869038MaRDI QIDQ2116920

Yannis Marinakis, Nikolaos A. Kyriakakis, Nikolaos F. Matsatsinis, Magdalene Marinaki

Publication date: 18 March 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.2021.09.008

zbMATH Keywords

greedy randomized adaptive search procedurehumanitarian coverage path planningunmanned aerial vehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Drones for relief logistics under uncertainty after an earthquake ⋮ A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management

Uses Software

• VRP

Cites Work

• Unnamed Item
• A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
• A survey of motion planning algorithms from the perspective of autonomous UAV guidance
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• Variable neighborhood search
• Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Greedy randomized adaptive search procedures
• Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review
• Coverage for robotics -- a survey of recent results
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
• GRASP and path relinking for project scheduling under partially renewable resources
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• An efficient algorithm for determining the convex hull of a finite planar set
• A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
• GRASP with Path Relinking for Three-Index Assignment
• Optimization by GRASP
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem

This page was built for publication: A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning