Randomized heuristics are widely used to solve large scale combinatorial optimization problems. Among the plethora of randomized heuristics, this paper reviews those that …
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 …
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 …
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 …
Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best- known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …
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 …
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 …
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 …
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 …