• Publications
  • Influence
On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
TLDR
We present the SR-GCWS-CS probabilistic algorithm that combines Monte Carlo simulation with splitting techniques and the Clarke and Wright savings heuristic to find competitive quasi-optimal solutions to the Capacitated Vehicle Routing Problem (CVRP) in reasonable response times. Expand
  • 122
  • 6
  • PDF
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem
TLDR
We present SR-GCWS, a hybrid algorithm that combines a CVRP classical heuristic with Monte Carlo simulation using state-of-the-art random number generators. Expand
  • 101
  • 6
  • PDF
Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
TLDR
This paper proposes a hybrid approach for solving the multidepot vehicle routing problem (MDVRP) with a limited number of identical vehicles per depot. Expand
  • 58
  • 6
MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
This paper discusses the use of probabilistic or randomized algorithms for solving vehicle routing problems with non-smooth objective functions. Our approach employs non-uniform probabilityExpand
  • 62
  • 5
  • PDF
Using Oriented Random Search to Provide a Set of Alternative Solutions to the Capacitated Vehicle Routing Problem
TLDR
The SR-GCWS algorithm incorporates a randomness criterion to the classical Clarke and Wright Savings (CWS) heuristic and starts an iterative process in order to obtain a set of alternative solutions, each of which outperforms the CWS algorithm. Expand
  • 41
  • 5
Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions
TLDR
This is the accepted version of the following article: Perez-Bernabeu, E., Juan, A. A., Faulin, J. B. and Barrios, B. (2015), Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions. Expand
  • 70
  • 4
A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times
TLDR
This paper describes a simulation–optimization algorithm for the Permutation Flow shop Problem with Stochastic processing Times (PFSPST) with an Iterated Local Search metaheuristic in order to deal with the stochastic behavior of the problem. Expand
  • 61
  • 3
Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
TLDR
This paper discusses the two-dimensional loading capacitated vehicle routing problem (2L-CVRP) with heterogeneous fleet (2 L-HFVRP). Expand
  • 52
  • 1
Biased Randomization of Classical Heuristics
TLDR
This chapter discusses how to randomize classical heuristics in order to transform these deterministic procedures into more efficient probabilistic algorithms. Expand
  • 9
  • 1
  • PDF
A successive approximations method for the heterogeneous vehicle routing problem: analysing different fleet configurations
In this paper, we propose a relatively simple-to-implement procedure for solving the heterogeneous-fleet vehicle routing problem (HeVRP), in which different types of vehicle loading capacities areExpand
  • 11