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 …

Vehicle routing attributes are extra characteristics and decisions that complement the
academic problem formulations and aim to properly account for real-life application needs …

Vehicle routing is a well-known optimization research topic with significant practical
importance. Among different approaches to solving vehicle routing, heuristics can produce a …

The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO)
that has been of great interest for decades for both, science and industry. The CVRP is a …

Two socioeconomic transformations, namely, the booms in the sharing economy and retail e-
commerce, lead to the prospect where shared mobility of passenger cars prevails …

Abstract The Vehicle Routing Problem (VRP) is one of the most frequently encountered
optimization problems in logistics, which aims to minimize the cost of transportation …

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 …

Local search has been established as a successful cornerstone to tackle the Vehicle
Routing Problem, and is included in many state-of-the-art heuristics. In this paper we aim to …

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 …

In this paper, we propose a two-phase hybrid heuristic algorithm to solve the capacitated
location-routing problem (CLRP). The CLRP combines depot location and routing decisions …