A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems
In the last few years, the formulation of real-world optimization problems and their efficient
solution via metaheuristic algorithms has been a catalyst for a myriad of research studies. In …
solution via metaheuristic algorithms has been a catalyst for a myriad of research studies. In …
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 …
Hybrid particle swarm optimization algorithm for solving the clustered vehicle routing problem
This paper considers a variant of the classical capacitated vehicle routing problem called
clustered vehicle routing problem (CluVRP). In CluVRP, customers are grouped into …
clustered vehicle routing problem (CluVRP). In CluVRP, customers are grouped into …
Optimization and machine learning applied to last-mile logistics: A review
The growth in e-commerce that our society has faced in recent years is changing the view
companies have on last-mile logistics, due to its increasing impact on the whole supply …
companies have on last-mile logistics, due to its increasing impact on the whole supply …
Bilevel memetic search approach to the soft-clustered vehicle routing problem
This work addresses a soft-clustered vehicle routing problem that extends the classical
capacitated vehicle routing problem with one additional constraint, that is, customers are …
capacitated vehicle routing problem with one additional constraint, that is, customers are …
A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy
A real-world newspaper distribution problem with recycling policy is tackled in this work. To
meet all the complex restrictions contained in such a problem, it has been modeled as a rich …
meet all the complex restrictions contained in such a problem, it has been modeled as a rich …
A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
The static bike rebalancing problem (SBRP) concerns the task of repositioning bikes among
stations in self-service bike-sharing systems. This problem can be seen as a variant of the …
stations in self-service bike-sharing systems. This problem can be seen as a variant of the …
The static bike relocation problem with multiple vehicles and visits
This paper introduces the static bike relocation problem with multiple vehicles and visits, the
objective of which is to rebalance at minimum cost the stations of a bike sharing system …
objective of which is to rebalance at minimum cost the stations of a bike sharing system …
A fast two-level variable neighborhood search for the clustered vehicle routing problem
C Defryn, K Sörensen - Computers & Operations Research, 2017 - Elsevier
In this paper, we present an improved two-level heuristic to solve the clustered vehicle
routing problem (CluVRP). The CluVRP is a generalization of the classical capacitated …
routing problem (CluVRP). The CluVRP is a generalization of the classical capacitated …