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 …

This paper surveys the research on the metaheuristics for the Vehicle Routing Problem with
Time Windows (VRPTW). The VRPTW can be described as the problem of designing least …

In this paper, we present a multi-objective vehicle routing problem with flexible time windows
(MOVRPFlexTW). In this problem, a fleet of vehicles can service a set of customers earlier …

Driven by new laws and regulations concerning the emission of greenhouse gases, carriers
are starting to use electric vehicles for last-mile deliveries. The limited battery capacities of …

The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control for a
large class of time-constrained vehicle routing problems, introducing several new features to …

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

We present a unified heuristic which is able to solve five different variants of the vehicle
routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated …

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 …

In this paper, a new variant of the Particle Swarm Optimization (PSO) algorithm is proposed
for the solution of the Vehicle Routing Problem with Time Windows (VRPTW). Three different …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …