In order to ensure high‐quality and on‐time delivery in logistic distribution processes, it is
necessary to efficiently manage the delivery fleet. Nowadays, due to the new policies 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 …

The vehicle routing problem is one of the most studied combinatorial optimization topics,
due to its practical importance and methodological interest. Yet, despite extensive …

The fast and cost-efficient home delivery of goods ordered online is logistically challenging.
Many companies are looking for new ways to cross the last mile to their customers. One …

Over the past decade, electric vehicles (EVs) have been considered in a growing number of
models and methods for vehicle routing problems (VRPs). This study presents a …

The projects of reediting the Toth and Vigo book on vehicle routing and of editing a book on
arc routing germinated during the ROUTE Conference in Sitges, Spain, in June 2011. The …

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 …

The attributes of vehicle routing problems are additional characteristics or constraints that
aim to better take into account the specificities of real applications. The variants thus formed …

The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the
vehicle routing problem with capacity and route length restrictions. The algorithm considers …

The vehicle routing problem (VRP) under capacity and distance restrictions involves the
design of a set of minimum cost delivery routes, originating and terminating at a central …