A Parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/11227
Tipus de documentArticle
Data publicació2011-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful
method that can be successfully applied in a variety of cases
CitacióDragos, I.; Juan Pérez, A.A.; Faulín, J.; Ferrer Biosca, A. A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics. "Centre de Recerca Matemàtica", 2010, núm 991, p.1-21.
Forma partPreprint number 991
Altres identificadorshttps://ddd.uab.cat/record/76057
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Pr991.pdf | 394,0Kb | Visualitza/Obre |