Solving the length constrained \(K\)-drones rural postman problem

DOI10.1016/j.ejor.2020.10.035zbMath1487.90082OpenAlexW3096364569MaRDI QIDQ2030543

Paula Segura, Isaac Plana, James F. Campbell, José María Sanchis, Angel Corberán

Publication date: 7 June 2021

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

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

zbMATH Keywords

logisticsarc routingmatheuristicdroneslength constraints

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)

Related Items (5)

Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ Upgrading edges in the graphical TSP ⋮ A multiple-drone arc routing and mothership coordination problem ⋮ The multi‐purpose K‐drones general routing problem ⋮ A linearithmic heuristic for the travelling salesman problem

Cites Work

• Unnamed Item
• The fleet size and mix problem for capacitated arc routing
• On the cycle polytope of a binary matroid
• A branch-and-cut algorithm for the undirected rural postman problem
• Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions
• Odd Minimum Cut-Sets and b-Matchings
• Arc Routing
• A branch & cut algorithm for the windy general routing problem and special cases
• Coordinated road-network search route planning by a team of UAVs

This page was built for publication: Solving the length constrained \(K\)-drones rural postman problem