Network reliability

MO Ball, CJ Colbourn, JS Provan - Handbooks in operations research and …, 1995 - Elsevier
Publisher Summary Network reliability encompasses a range of issues related to the design
and analysis of networks which are subject to the random failure of their components …

[HTML][HTML] Bayesian improved cross entropy method with categorical mixture models for network reliability assessment

J Chan, I Papaioannou, D Straub - Reliability Engineering & System Safety, 2024 - Elsevier
We employ the Bayesian improved cross entropy (BiCE) method for rare event estimation in
static networks and choose the categorical mixture (CM) as the parametric family to capture …

Utilizing distributed learning automata to solve stochastic shortest path problems

H Beigy, MR Meybodi - International Journal of Uncertainty …, 2006 - World Scientific
In this paper, we first introduce a network of learning automata, which we call it as distributed
learning automata and then propose some iterative algorithms for solving stochastic shortest …

Counting-based reliability estimation for power-transmission grids

L Duenas-Osorio, K Meel, R Paredes… - Proceedings of the AAAI …, 2017 - ojs.aaai.org
Modern society is increasingly reliant on the functionality of infrastructure facilities and utility
services. Consequently, there has been surge of interest in the problem of quantification of …

Vehicle route guidance systems: Classification and comparison

E Schmitt, H Jula - 2006 IEEE Intelligent Transportation …, 2006 - ieeexplore.ieee.org
Route guidance in vehicular roadways has become an important and emerging method of
congestion alleviation. The proliferation of low cost electronics such as sensors, wireless …

An acceptability index based approach for solving shortest path problem on a network with interval weights

A Ebrahimnejad - RAIRO-Operations Research, 2021 - rairo-ro.org
Based on the acceptability index for comparison of any two imprecise values, efficient
algorithms have been proposed in the literature for solving shortest path (SP) problem when …

Bayesian improved cross entropy method with categorical mixture models

J Chan, I Papaioannou, D Straub - arXiv preprint arXiv:2309.12490, 2023 - arxiv.org
We employ the Bayesian improved cross entropy (BiCE) method for rare event estimation in
static networks and choose the categorical mixture as the parametric family to capture the …

[PDF][PDF] System interdiction and defense

E Israeli - 1999 - calhoun.nps.edu
We study the problem of interdicting components of an adversary's system, eg, a war-time
economy, a transportation network, etc. Basic techniques are developed and illustrated with …

Constrained counting and sampling: bridging the gap between theory and practice

KS Meel - 2017 - search.proquest.com
Constrained counting and sampling are two fundamental problems in Computer Science
with numerous applications, including network reliability, privacy, probabilistic reasoning …

A modified ant colony system for finding the expected shortest path in networks with variable arc lengths and probabilistic nodes

M Farhanchi, R Hassanzadeh, I Mahdavi… - Applied Soft …, 2014 - Elsevier
The problem of finding the expected shortest path in stochastic networks, where the
presence of each node is probabilistic and the arc lengths are random variables, have …