Over the past decades, the Vehicle Routing Problem (VRP) and its variants have grown ever
more popular in the academic literature. Yet, the problem characteristics and assumptions …

Vehicle routing problems (VRPs) are among the most studied problems in operations
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …

Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of
robots is tasked with transporting a set of tasks, each from an initial location and each to a …

This paper studies the multi-robot task assignment problem in which a fleet of dispersed
robots needs to efficiently transport a set of dynamically appearing packages from their initial …

In this paper, we present a state-of-the-art survey on the vehicle routing problem with
multiple depots (MDVRP). Our review considered papers published between 1988 and …

This study investigates a multi-depot multi-trip vehicle routing problem with time windows
and release dates, which is a practical problem in the last mile distribution operations. This …

It has been around 30 years since the heterogeneous vehicle routing problem was
introduced, and significant progress has since been made on this problem and its variants …

The Vehicle Routing Problem (VRP) is a well-known research line in the optimization
research community. Its different basic variants have been widely explored in the literature …

Previous work on assigning tasks to robots has proposed extensive categorizations of
allocation of tasks with and without constraints. The main contribution of this paper is a …

Heterogeneous fleet vehicles can be used to reduce carbon emissions. We propose an
improved branch-and-price (BAP) algorithm to precisely solve the heterogeneous fleet …