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

116 citations · 341 across the 11 of their papers we have counts for

collaborators

11 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.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.LG2022

Learning the Quality of Machine Permutations in Job Shop Scheduling

Andrea Corsini, Simone Calderara, Mauro Dell'Amico

In recent years, the power demonstrated by Machine Learning (ML) has increasingly attracted the interest of the optimization community that is starting to leverage ML for enhancing…

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.OC2020★ 18 cited

Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time

Arthur Kramer, Mauro Dell'Amico, Dominique Feillet +1

This paper addresses the problem of scheduling a set of jobs that are released over the time on a set of identical parallel machines, aiming at the minimization of the total weight…

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…

math.OC2019★ 5 cited

A Branch-and-Price Algorithm for the Temporal Bin Packing Problem

Mauro Dell'Amico, Fabio Furini, Manuel Iori

We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks f…

cs.DS2018★ 34 cited

Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines

Arthur Kramer, Mauro Dell'Amico, Manuel Iori

We consider the problem of scheduling a set of jobs on a set of identical parallel machines, with the aim of minimizing the total weighted completion time. The problem has been sol…