An efficient alternative to the exact evaluation of the quickest path flow network reliability problem

DOI10.1016/J.COR.2016.06.010MaRDI QIDQ342541zbMATH OpenOpenAlexFDO

Authors M. El Khadiri, W.-C. Yeh

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2016.06.010

zbMATH Keywords

reliabilityquickest pathMonte-Carlo simulationarc capacityarc lead timeflow networkinclusion-exclusionminimal pathpath capacitypath lead timepath transmission time

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic network models in operations research (90B15)

Recommendations

• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Time version of the shortest path problem in a stochastic-flow network
• Algorithms for the quickest path problem and the reliable quickest path problem
• System reliability for quickest path problems under time threshold and budget
• Evaluating Reliability of Stochastic Flow Networks

Cites work

• scientific article; zbMATH DE number 1638973 (Why is no real title available?)
• scientific article; zbMATH DE number 4115803 (Why is no real title available?)
• scientific article; zbMATH DE number 854710 (Why is no real title available?)
• A comprehensive survey on the quickest path problem
• A new importance sampling Monte Carlo method for a flow network reliability problem
• A new simulation method based on the RVR principle for the rare event network reliability problem
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Algorithms for the quickest path problem and the reliable quickest path problem
• An algorithm for ranking quickest simple paths
• An algorithm for the quickest path problem
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Finding the \(k\) quickest simple paths in a network
• Handbook of Monte Carlo Methods
• On the quickest path problem
• Rare event analysis by Monte Carlo techniques in static models
• Reliable and restricted quickest path problems
• Stochastic computer network under accuracy rate constraint from QoS viewpoint
• The all-pairs quickest path problem
• The quickest path problem
• The quickest path problem with interval lead times
• The transform likelihood ratio method for rare event simulation with heavy tails
• Topological optimization of reliable networks under dependent failures

Cited in

(6)

• Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
• System reliability for quickest path problems under time threshold and budget
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks

This page was built for publication: An efficient alternative to the exact evaluation of the quickest path flow network reliability problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342541)