Matheuristic algorithms for the parallel drone scheduling traveling salesman problem

DOI10.1007/s10479-020-03562-3zbMath1496.90072arXiv1906.02962OpenAlexW3009770767MaRDI QIDQ2158611

Stefano Novellani, Mauro Dell'Amico, Roberto Montemanni

Publication date: 26 July 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

traveling salesman problemheuristic algorithmsmixed integer linear programmingmatheuristicsdrone-assisted deliveries

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (9)

The min-cost parallel drone scheduling vehicle routing problem ⋮ Optimal and heuristic algorithms for the multi-objective vehicle routing problem with drones for military surveillance operations ⋮ Truck and drone routing problem with synchronization on arcs ⋮ The two‐echelon routing problem with truck and drones ⋮ Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery ⋮ The vehicle routing problem with drones and drone speed selection ⋮ An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem ⋮ The multiple traveling salesman problem in presence of drone- and robot-supported packet stations ⋮ Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation

Cites Work

• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Integer Programming Formulation of Traveling Salesman Problems
• TSPLIB—A Traveling Salesman Problem Library
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Matheuristic algorithms for the parallel drone scheduling traveling salesman problem