Minimizing dispersion in multiple drone routing

DOI10.1016/j.cor.2019.04.022zbMath1458.90079OpenAlexW2943545481MaRDI QIDQ2003561

Marcelo Serrano Zanetti, Ghendy Jr. Cardoso, Olinto César Bassi de Araújo, Guilherme Dhein

Publication date: 9 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.022

zbMATH Keywords

dispersion minimizationdrone swarmlocal search genetic algorithmminimum dispersion routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• TSPLIB
• Boids

Cites Work

• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
• The \(k\)-dissimilar vehicle routing problem
• A multi-criteria police districting problem for the efficient and effective design of patrol sector
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• Variable neighborhood search
• Synchronized arc routing for snow plowing operations
• On finding dissimilar paths
• Determining optimal police patrol areas with maximal covering and backup covering location models
• Integer linear programming formulations of multiple salesman problems and its variations
• TSPLIB—A Traveling Salesman Problem Library