Carregant...
Carregant...

Vés al contingut (premeu Retorn)

MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems

Autor
Juan, A.; Faulín, F.; Ferrer, A.; Lourenço, H.; Barrios, B.
Tipus d'activitat
Article en revista
Revista
TOP
Data de publicació
2011
Volum
21
Número
1
Pàgina inicial
109
Pàgina final
132
DOI
https://doi.org/10.1007/s11750-011-0245-1 Obrir en finestra nova
Resum
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 probability distributions to add a biased random behavior to the well-known savings heuristic. By doing so, a large set of alternative good solutions can be quickly obtained in a natural way and without complex configuration processes. Since the solution-generation process is based on the criterion of maximizing the savi...
Paraules clau
Biased random search, Combinatorial optimization, Heuristics, Randomized algorithms, Vehicle routing problem
Grup de recerca
GNOM - Grup d'Optimització Numèrica i Modelització

Participants

  • Juan Perez, Angel Alejandro  (autor)
  • Faulín Fajardo, Francisco Javier  (autor)
  • Ferrer Biosca, Alberto  (autor)
  • Lourenço, Helena R.  (autor)
  • Barrios, Barry B.  (autor)