A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants
Recently, a taxonomic review of the Vehicle Routing Problem (VRP) literature published
between 2009 and June 2015 stated that most of the surveyed articles use metaheuristics …
between 2009 and June 2015 stated that most of the surveyed articles use metaheuristics …
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 …
more popular in the academic literature. Yet, the problem characteristics and assumptions …
Thirty years of heterogeneous vehicle routing
It has been around 30 years since the heterogeneous vehicle routing problem was
introduced, and significant progress has since been made on this problem and its variants …
introduced, and significant progress has since been made on this problem and its variants …
A unified solution framework for multi-attribute vehicle routing problems
Vehicle routing attributes are extra characteristics and decisions that complement the
academic problem formulations and aim to properly account for real-life application needs …
academic problem formulations and aim to properly account for real-life application needs …
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
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 …
aim to better take into account the specificities of real applications. The variants thus formed …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
An iterated local search heuristic for the heterogeneous fleet vehicle routing problem
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The
HFVRP is NP-hard since it is a generalization of the classical Vehicle Routing Problem …
HFVRP is NP-hard since it is a generalization of the classical Vehicle Routing Problem …
The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation
The multi-depot fleet size and mix vehicle routing problem, also known as the multi-depot
routing with heterogeneous vehicles, is investigated. A mathematical formulation is given …
routing with heterogeneous vehicles, is investigated. A mathematical formulation is given …
Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
The minmax multiple traveling salesman problem with single depot (the minmax mTSP) or
multiple depots (the minmax multidepot mTSP) aims to minimize the longest tour among a …
multiple depots (the minmax multidepot mTSP) aims to minimize the longest tour among a …
Order-first split-second methods for vehicle routing problems: A review
Cluster-first route-second methods like the sweep heuristic (Gillett and Miller, 1974) are well
known in vehicle routing. They determine clusters of customers compatible with vehicle …
known in vehicle routing. They determine clusters of customers compatible with vehicle …