Identificador persistente para citar o vincular este elemento:
http://hdl.handle.net/10553/76161
Campo DC | Valor | idioma |
---|---|---|
dc.contributor.author | Rocco S, Claudio M. | en_US |
dc.contributor.author | Emmanuel Ramirez-Marquez, Jose | en_US |
dc.contributor.author | Salazar Aponte, Daniel E. | en_US |
dc.date.accessioned | 2020-12-01T10:29:16Z | - |
dc.date.available | 2020-12-01T10:29:16Z | - |
dc.date.issued | 2010 | en_US |
dc.identifier.issn | 0951-8320 | en_US |
dc.identifier.other | WoS | - |
dc.identifier.uri | http://hdl.handle.net/10553/76161 | - |
dc.description.abstract | Solution approaches to the deterministic network interdiction problem have previously been developed for optimizing a single figure-of-merit of the network configuration (i.e. flow that can be transmitted between a source node and a sink node for a fixed network design) under constraints related to limited amount of resources available to interdict network links. These approaches work under the assumption that: (1) nominal capacity of each link is completely reduced when interdicted and (2) there is a single criterion to optimize. This paper presents a newly developed evolutionary algorithm that for the first time allows solving multi-objective optimization models for the design of network interdiction strategies that take into account a variety of figures-of-merit. The algorithm provides an approximation to the optimal Pareto frontier using: (a) techniques in Monte Carlo simulation to generate potential network interdiction strategies, (b) graph theory to analyze strategies' maximum source-sink flow and (c) an evolutionary search that is driven by the probability that a link will belong to the optimal Pareto set. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate and validate the approach. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | Reliability Engineering and System Safety | en_US |
dc.source | Reliability Engineering and System Safety [ISSN 0951-8320], v. 95 (8), p. 887-896, (Agosto 2010) | en_US |
dc.subject | 3310 tecnología industrial | en_US |
dc.subject | 330411 Diseño de sistemas de calculo | en_US |
dc.subject.other | Evolutionary Approach | en_US |
dc.subject.other | Algorithms | en_US |
dc.subject.other | Design | en_US |
dc.subject.other | Models | en_US |
dc.subject.other | Network | en_US |
dc.subject.other | Interdiction | en_US |
dc.subject.other | Evolutionary | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Multi-Objective | en_US |
dc.title | Bi and tri-objective optimization in the deterministic network interdiction problem | en_US |
dc.type | info:eu-repo/semantics/Article | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.ress.2010.03.008 | en_US |
dc.identifier.scopus | 79251610757 | - |
dc.identifier.isi | 000279233300009 | - |
dc.contributor.authorscopusid | 7004508307 | - |
dc.contributor.authorscopusid | 6506312498 | - |
dc.contributor.authorscopusid | 56240751500 | - |
dc.identifier.eissn | 1879-0836 | - |
dc.description.lastpage | 896 | en_US |
dc.identifier.issue | 8 | - |
dc.description.firstpage | 887 | en_US |
dc.relation.volume | 95 | en_US |
dc.investigacion | Ingeniería y Arquitectura | en_US |
dc.type2 | Artículo | en_US |
dc.contributor.daisngid | 771425 | - |
dc.contributor.daisngid | 346740 | - |
dc.contributor.daisngid | 1400577 | - |
dc.description.numberofpages | 10 | en_US |
dc.utils.revision | Sí | en_US |
dc.contributor.wosstandard | WOS:Rocco, CM | - |
dc.contributor.wosstandard | WOS:Ramirez-Marquez, JE | - |
dc.contributor.wosstandard | WOS:Salazar, DE | - |
dc.date.coverdate | Enero 2010 | en_US |
dc.identifier.ulpgc | Sí | en_US |
dc.contributor.buulpgc | BU-ING | en_US |
dc.description.jcr | 1,899 | |
dc.description.jcrq | Q1 | |
dc.description.scie | SCIE | |
item.fulltext | Sin texto completo | - |
item.grantfulltext | none | - |
Colección: | Artículos |
Citas SCOPUSTM
35
actualizado el 25-ago-2024
Citas de WEB OF SCIENCETM
Citations
29
actualizado el 25-ago-2024
Visitas
69
actualizado el 19-may-2024
Google ScholarTM
Verifica
Altmetric
Comparte
Exporta metadatos
Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.