Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/74166
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Benavides, Alexander J. | - |
dc.contributor.author | Ritt, Marcus | - |
dc.contributor.author | Buriol, Luciana S. | - |
dc.contributor.author | França, Paulo M. | - |
dc.date.accessioned | 2014-05-27T11:27:28Z | - |
dc.date.accessioned | 2016-10-25T18:40:54Z | - |
dc.date.available | 2014-05-27T11:27:28Z | - |
dc.date.available | 2016-10-25T18:40:54Z | - |
dc.date.issued | 2013-01-01 | - |
dc.identifier | http://dx.doi.org/10.1016/j.cor.2012.05.006 | - |
dc.identifier.citation | Computers and Operations Research, v. 40, n. 1, p. 24-32, 2013. | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/11449/74166 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/74166 | - |
dc.description.abstract | We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches in electrical distribution networks to improve their reliability. Our approach also treats the service restoration problem, which has to be solved as a subproblem, to evaluate the reliability benefit of a given switch allocation proposal. Comparisons with other metaheuristics and with a branch-and-bound procedure evaluate its performance. © 2012 Published by Elsevier Ltd. | en |
dc.format.extent | 24-32 | - |
dc.language.iso | eng | - |
dc.source | Scopus | - |
dc.subject | Metaheuristics | - |
dc.subject | Path relinking | - |
dc.subject | Power systems reliability | - |
dc.subject | Sample algorithms | - |
dc.subject | Switch allocation | - |
dc.subject | Branch and bounds | - |
dc.subject | Electrical distribution networks | - |
dc.subject | Local search | - |
dc.subject | Meta heuristics | - |
dc.subject | Meta-heuristic approach | - |
dc.subject | Reliability benefits | - |
dc.subject | Service restoration | - |
dc.subject | Switch allocations | - |
dc.subject | Electric power distribution | - |
dc.subject | Heuristic algorithms | - |
dc.subject | Reliability | - |
dc.title | An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Federal do Rio Grande do Sul (UFRGS) | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | Instituto de Informática Universidade Federal Do Rio Grande Do sul - UFRGS | - |
dc.description.affiliation | Faculdade de Ciências e Tecnologia Universidade Estadual Paulista - UNESP | - |
dc.description.affiliationUnesp | Faculdade de Ciências e Tecnologia Universidade Estadual Paulista - UNESP | - |
dc.identifier.doi | 10.1016/j.cor.2012.05.006 | - |
dc.identifier.wos | WOS:000309623100003 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Computers and Operations Research | - |
dc.identifier.scopus | 2-s2.0-84866161115 | - |
Appears in Collections: | Artigos, TCCs, Teses e Dissertações da Unesp |
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.