Show simple item record

dc.contributor.authorIonescu, Dragos
dc.contributor.authorJuan Pérez, Angel Alejandro
dc.contributor.authorFaulín, Javier
dc.contributor.authorFerrer Biosca, Alberto
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
dc.date.accessioned2011-01-31T09:43:37Z
dc.date.available2011-01-31T09:43:37Z
dc.date.issued2011-01
dc.identifier.citationDragos, 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.otherhttps://ddd.uab.cat/record/76057
dc.identifier.urihttp://hdl.handle.net/2117/11227
dc.description.abstractThis 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.extent21 p.
dc.language.isoeng
dc.relation.ispartofseriesPreprint number 991
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://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.lcshHeuristic algorithms
dc.subject.lcshCombinatorial optimization
dc.titleA Parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics
dc.typeArticle
dc.subject.lemacHeurística
dc.subject.lemacOptimització combinatòria
dc.contributor.groupUniversitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
dc.subject.amsClassificació AMS::65 Numerical analysis::65K Mathematical programming, optimization and variational techniques
dc.rights.accessOpen Access
local.identifier.drac4587650
dc.description.versionPreprint
local.personalitzacitaciotrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record