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 …

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 …

The recent research on the CVRP is being slowed down by the lack of a good set of
benchmark instances. The existing sets suffer from at least one of the following drawbacks:(i) …

Major advances were recently obtained in the exact solution of vehicle routing problems
(VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical …

Globally, e-commerce warehouses have begun implementing robotic mobile fulfillment
systems (RMFS), which can improve order-picking efficiency by using automated guided …

This article presents a survey of genetic algorithms that are designed for solving multi depot
vehicle routing problem. In this context, most of the articles focus on different genetic …

The best performing exact algorithms for the capacitated vehicle routing problem developed
in the last 10 years are based in the combination of cut and column generation. Some …

In recent years, the rapid growth of e-commerce and the need to make last-mile logistics
more sustainable have stimulated the development of new distribution paradigms, based on …

Abstract We present a Variable Tabu Neighborhood Search (VTNS) algorithm for solving a
class of Multi-Depot Vehicle Routing Problems (MDVRP). The proposed algorithm applies a …

Collaboration among service providers in a logistics network can greatly increase their
operation efficiencies and reduce transportation emissions. This study proposes, formulates …