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
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 …
Flood susceptibility map** using novel ensembles of adaptive neuro fuzzy inference system and metaheuristic algorithms
Flood is one of the most destructive natural disasters which cause great financial and life
losses per year. Therefore, producing susceptibility maps for flood management are …
losses per year. Therefore, producing susceptibility maps for flood management are …
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 …
has the following two differences in relation to the classical vehicle routing problem: there …
Optimizing the green open vehicle routing problem with time windows by minimizing comprehensive routing cost
Y Niu, Z Yang, P Chen, J **ao - Journal of cleaner production, 2018 - Elsevier
With the rapid development of the sharing economy, outsourcing logistics operations to third
party logistics has become an efficient way of reducing costs in freight transportation. It can …
party logistics has become an efficient way of reducing costs in freight transportation. It can …
Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm
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 …
vehicle routing problem with capacity and distance constraints. Consider a depot from which …
Open vehicle routing problem with cross-docking
The advantages of the cross-docking technique have been increasingly appreciated in
literature and in practice. This appreciation, coupled with the advances of numerous …
literature and in practice. This appreciation, coupled with the advances of numerous …
A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application
In this paper, a multi-objective dynamic vehicle routing problem with fuzzy time windows
(DVRPFTW) is presented. In this problem, unlike most of the work where all the data are …
(DVRPFTW) is presented. In this problem, unlike most of the work where all the data are …
An ACO hybrid metaheuristic for close–open vehicle routing problems with time windows and fuzzy constraints
The close–open vehicle routing problem is a realistic variant of the “classical” vehicle routing
problem where the routes can be opened and closed, ie all the vehicles are not required to …
problem where the routes can be opened and closed, ie all the vehicles are not required to …
Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem
In this paper, we address the Multi-Depot Open Vehicle Routing Problem (MDOVRP), which
is a generalization of the Capacitated Vehicle Routing Problem (CVRP) where vehicles start …
is a generalization of the Capacitated Vehicle Routing Problem (CVRP) where vehicles start …