Vehicle routing problems have been the focus of extensive research over the past sixty
years, driven by their economic importance and their theoretical interest. The diversity of …

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 design of distribution systems raises hard combinatorial optimization problems. For
instance, facility location problems must be solved at the strategic decision level to place …

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-
Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The …

Abstract The Capacitated Location-Routing Problem (CLRP) is a strategic-level problem
involving the selection of one or many depots from a set of candidate locations and the …

This article presents an exact algorithm for the multi-depot vehicle routing problem (MDVRP)
under capacity and route length constraints. The MDVRP is formulated using a vehicle-flow …

We study the integrated optimization of location, inventory and routing in supply chain
network design (SCDN) problem. The SCND decision has significant impact on the …

The growth of online retail leads to increasing last-mile delivery operations that contribute to
various negative externalities, such as traffic congestion and air pollution, especially in …

In this paper, we define the standard LRP as a deterministic, static, discrete, single-echelon,
single-objective location-routing problem in which each customer (vertex) must be visited …