Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification

GD Konstantakopoulos, SP Gayialis… - Operational research, 2022 - Springer
The scheduling of deliveries and the routing of vehicles are of great importance for supply
chain operations, as both determine to a great extent the distribution costs, as well as …

The vehicle routing problem: State of the art classification and review

K Braekers, K Ramaekers… - Computers & industrial …, 2016 - Elsevier
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 …

A unified solution framework for multi-attribute vehicle routing problems

T Vidal, TG Crainic, M Gendreau, C Prins - European Journal of …, 2014 - Elsevier
Vehicle routing attributes are extra characteristics and decisions that complement the
academic problem formulations and aim to properly account for real-life application needs …

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis

T Vidal, TG Crainic, M Gendreau, C Prins - European Journal of …, 2013 - Elsevier
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 …

[HTML][HTML] A hybrid algorithm for a class of vehicle routing problems

A Subramanian, E Uchoa, LS Ochi - Computers & Operations Research, 2013 - Elsevier
In this work we propose a hybrid algorithm for a class of Vehicle Routing Problems with
homogeneous fleet. A sequence of Set Partitioning (SP) models, with columns …

A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem

J Brandão - European Journal of Operational Research, 2020 - Elsevier
The problem studied in this paper is the multi-depot open vehicle routing problem, which
has the following two differences in relation to the classical vehicle routing problem: there …

An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems

MEH Sadati, B Çatay, D Aksen - Computers & Operations Research, 2021 - Elsevier
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 …

Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm

E Ruiz, V Soto-Mendoza, AER Barbosa… - Computers & Industrial …, 2019 - Elsevier
This paper presents a biased random-key genetic algorithm designed to solve the open
vehicle routing problem with capacity and distance constraints. Consider a depot from which …

Open vehicle routing problem with cross-docking

FY Vincent, P Jewpanya, AANP Redi - Computers & Industrial Engineering, 2016 - Elsevier
The advantages of the cross-docking technique have been increasingly appreciated in
literature and in practice. This appreciation, coupled with the advances of numerous …

Solving the feeder vehicle routing problem using ant colony optimization

YH Huang, CA Blazquez, SH Huang… - Computers & industrial …, 2019 - Elsevier
This paper studies the Feeder Vehicle Routing Problem (FVRP), a new variant of the vehicle
routing problem (VRP), in which each customer is served by either a large (truck) or a small …