activity
20192023
most citedMatheuristic algorithms for the parallel drone scheduling traveling salesman problem

116 citations · 297 across the 10 of their papers we have counts for

collaborators

10 papers

math.OC2023★ 1 cited

Parallel drone scheduling vehicle routing problems with collective drones

Roberto Montemanni, Mauro Dell'Amico, Andrea Corsini

We study last-mile delivery problems where trucks and drones collaborate to deliver goods to final customers. In particular, we focus on problem settings where either a single truc…

math.OC2023★ 1 cited

Constraint Programming models for the parallel drone scheduling vehicle routing problem

Roberto Montemanni, Mauro Dell'Amico

Drones are currently seen as a viable way for improving the distribution of parcels in urban and rural environments, while working in coordination with traditional vehicles like tr…

math.OC2023★ 11 cited

An Ant Colony System for the Team Orienteering Problem with Time Windows

Roberto Montemanni, Luca Maria Gambardella

This paper discusses a heuristic approach for Team Orienteering Problems with Time Windows. The method we propose takes advantage of a solution model based on a hierarchic generali…

math.OC2022★ 4 cited

Precedence-Constrained Arborescences

Xiaochen Chou, Mauro Dell'Amico, Jafar Jamal +1

The minimum-cost arborescence problem is a well-studied problem in the area of graph theory, with known polynomial-time algorithms for solving it. Previous literature introduced ne…

cs.AI2021★ 1 cited

A New Constructive Heuristic driven by Machine Learning for the Traveling Salesman Problem

Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni

Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem (TSP) exhibit issues when they try to scale up to real case scenarios with several hundred ver…

cs.AI2021★ 1 cited

Machine Learning Constructives and Local Searches for the Travelling Salesman Problem

Tommaso Vitali, Umberto Junior Mele, Luca Maria Gambardella +1

The ML-Constructive heuristic is a recently presented method and the first hybrid method capable of scaling up to real scale traveling salesman problems. It combines machine learni…

cs.DM2021★ 1 cited

Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone

Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani

The use of drones in logistics is gaining more and more interest, and drones are becoming a more viable and common way of distributing parcels in an urban environment. As a consequ…

math.OC2019★ 63 cited

Models and algorithms for the Flying Sidekick Traveling Salesman Problem

Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani

This paper presents a set of new formulations for the Flying Sidekick Traveling Salesman Problem, where a truck and a drone cooperate to delivery parcels to customers minimizing th…

math.OC2019★ 116 cited

Matheuristic algorithms for the parallel drone scheduling traveling salesman problem

Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani

In a near future drones are likely to become a viable way of distributing parcels in a urban environment. In this paper we consider the parallel drone scheduling traveling salesman…

math.OC2019★ 98 cited

Drone-assisted deliveries: new formulations for the Flying Sidekick Traveling Salesman Problem

Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani

In this paper we consider a problem related to deliveries assisted by an unmanned aerial vehicle, so-called drone. In particular we consider the Flying Sidekick Traveling Salesman…