dc.contributor.author | Ionescu, Dragos |
dc.contributor.author | Juan Pérez, Angel Alejandro |
dc.contributor.author | Faulín, Javier |
dc.contributor.author | Ferrer Biosca, Alberto |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I |
dc.date.accessioned | 2011-01-31T09:43:37Z |
dc.date.available | 2011-01-31T09:43:37Z |
dc.date.issued | 2011-01 |
dc.identifier.citation | 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. |
dc.identifier.other | https://ddd.uab.cat/record/76057 |
dc.identifier.uri | http://hdl.handle.net/2117/11227 |
dc.description.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 |
dc.format.extent | 21 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | Preprint number 991 |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria |
dc.subject.lcsh | Heuristic algorithms |
dc.subject.lcsh | Combinatorial optimization |
dc.title | A Parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics |
dc.type | Article |
dc.subject.lemac | Heurística |
dc.subject.lemac | Optimització combinatòria |
dc.contributor.group | Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming |
dc.subject.ams | Classificació AMS::65 Numerical analysis::65K Mathematical programming, optimization and variational techniques |
dc.rights.access | Open Access |
local.identifier.drac | 4587650 |
dc.description.version | Preprint |
local.personalitzacitacio | true |