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 …
Biased randomization of heuristics using skewed probability distributions: A survey and some applications
Randomized heuristics are widely used to solve large scale combinatorial optimization
problems. Among the plethora of randomized heuristics, this paper reviews those that …
problems. Among the plethora of randomized heuristics, this paper reviews those that …
A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
This paper studies the well-known capacitated vehicle routing problem with two-dimensional
loading constraints (2L-CVRP). It requires designing a set of min-cost routes, starting and …
loading constraints (2L-CVRP). It requires designing a set of min-cost routes, starting and …
Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic
J De Armas, AA Juan, JM Marquès… - Journal of the …, 2017 - Taylor & Francis
The uncapacitated facility location problem (UFLP) is a popular combinatorial optimization
problem with practical applications in different areas, from logistics to telecommunication …
problem with practical applications in different areas, from logistics to telecommunication …
A simheuristic approach for the two-dimensional vehicle routing problem with stochastic travel times
D Guimarans, O Dominguez, J Panadero… - … Modelling Practice and …, 2018 - Elsevier
The two-dimensional vehicle routing problem (2L-VRP) is a realistic extension of the
classical vehicle routing problem in which customers' demands are composed by sets of non …
classical vehicle routing problem in which customers' demands are composed by sets of non …
Enhancing and extending the classical GRASP framework with biased randomisation and simulation
Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best-
known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …
known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …
A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
We consider a family of rich vehicle routing problems (RVRP) which have the particularity to
combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots …
combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots …
A multicriteria analysis for the green VRP: A case discussion for the distribution problem of a Spanish retailer
This research presents the group of green vehicle routing problems with environmental
costs translated into money versus production of noise, pollution and fuel consumption. This …
costs translated into money versus production of noise, pollution and fuel consumption. This …
A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
O Dominguez, D Guimarans, AA Juan… - European Journal of …, 2016 - Elsevier
The two-dimensional loading vehicle routing problem with clustered backhauls (2L-VRPB) is
a realistic extension of the classical vehicle routing problem where both delivery and pickup …
a realistic extension of the classical vehicle routing problem where both delivery and pickup …
A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
Green transportation is becoming relevant in the context of smart cities, where the use of
electric vehicles represents a promising strategy to support sustainability policies. However …
electric vehicles represents a promising strategy to support sustainability policies. However …