121
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

Reliability evaluation of a multistate network subject to time constraint under routing policy

Pages 1400-1408 | Received 19 Feb 2011, Accepted 06 Nov 2011, Published online: 15 Feb 2012

References

  • Ahuja , RK . 1988 . Minimum Cost-reliability Ratio Problem . Computers and Operations Research , 16 : 83 – 89 .
  • Alexopoulos , C . 1995 . A Note on State-space Decomposition Methods for Analyzing Stochastic Flow Networks . IEEE Transactions on Reliability , 44 : 354 – 357 .
  • Anbuudayasankar , SP , Ganesh , K , Lenny Koh , SC and Mohandas , K . 2010 . Unified Heuristics to Solve Routing Problem of Reverse Logistics in Sustainable Supply Chain . International Journal of Systems Science , 41 : 337 – 351 .
  • Aven , T . 1985 . Reliability Evaluation of Multistate Systems with Multistate Components . IEEE Transactions on Reliability , 34 : 473 – 479 .
  • Bodin , LD , Golden , BL , Assad , AA and Ball , MO . 1982 . Routing and Scheduling of Vehicles and Crews: The State of the Art . Computers and Operations Research , 10 : 63 – 211 .
  • Chen , YL . 1993 . An Algorithm for Finding the k Quickest Paths in a Network . Computers and Operations Research , 20 : 59 – 65 .
  • Chen , YL . 1994 . Finding the k Quickest Simples Paths in a Network . Information Processing Letters , 50 : 89 – 92 .
  • Chen , YL and Chin , YH . 1990 . The Quickest Path Problem . Computers and Operations Research , 17 : 153 – 161 .
  • Chen , GH and Hung , YC . 1993 . On the Quickest Path Problem . Information Processing Letters , 46 : 125 – 128 .
  • Chen , GH and Hung , YC . 1994 . Algorithms for the Constrained Quickest Path Problem and the Enumeration of Quickest Paths . Computers and Operations Research , 21 : 113 – 118 .
  • Chen , YL and Tang , K . 1998 . Minimum Time Paths in a Network with Mixed Time Constraints . Computers and Operations Research , 25 : 793 – 805 .
  • Clímaco , JCN , Pascoal , MMB , Craveirinha , JMF and Captivo , MEV . 2007 . Internet Packet Routing: Application of a K-quickest Path Algorithm . European Journal of Operational Research , 181 : 1045 – 1054 .
  • Fredman , ML and Tarjan , RE . 1987 . Fibonacci Heaps and their Uses in Improved Network Optimization Algorithms . Journal of the ACM , 34 : 596 – 615 .
  • Golden , BL and Magnanti , TL . 1977 . Deterministic Network Optimization: A Bibliography . Networks , 7 : 149 – 183 .
  • Hudson , JC and Kapur , KC . 1985 . Reliability Bounds for Multistate Systems with Multistate Components . Operations Research , 33 : 153 – 160 .
  • Hung , YC and Chen , GH . 1992 . Distributed Algorithms for the Quickest Path Problem . Parallel Computing , 18 : 823 – 834 .
  • Jane , CC , Lin , JS and Yuan , J . 1993 . On Reliability Evaluation of a Limited-flow Network in Terms of Minimal Cutsets . IEEE Transactions on Reliability , 42 : 354 – 361 .
  • Lee , DT and Papadopoulou , E . 1993 . The All-pairs Quickest Path Problem . Information Processing Letters , 45 : 261 – 267 .
  • Lin , YK . 2003 . Extend the Quickest Path Problem to the System Reliability Evaluation for a Stochastic-flow Network . Computers and Operations Research , 30 : 567 – 575 .
  • Lin , YK . 2004 . Reliability of a Stochastic-flow Network with Unreliable Branches & Nodes under Budget Constraints . IEEE Transactions on Reliability , 53 : 381 – 387 .
  • Lin , YK . 2006 . Measure the Quality Level for a Supplier-demand System by a Multicommodity Stochastic-flow Network . International Journal of Systems Science , 37 : 1123 – 1130 .
  • Lin , YK . 2007 . Reliability Evaluation for an Information Network with Node Failure under Cost Constraint . IEEE Transactions on Systems, Man and Cybernetics – Part A: Systems and Humans , 37 : 180 – 188 .
  • Lin , YK . 2010a . A Stochastic Model to Study the System Capacity for Supply Chains in Terms of Minimal Cuts . International Journal of Production Economics , 124 : 181 – 187 .
  • Lin , YK . 2010b . Reliability of k Separate Minimal Paths under Both Time and Budget Constraints . IEEE Transactions on Reliability , 59 : 183 – 190 .
  • Lin , JS , Jane , CC and Yuan , J . 1995 . On Reliability Evaluation of a Capacitated-flow Network in Terms of Minimal Pathsets . Networks , 25 : 131 – 138 .
  • Lin , YK and Yeh , CT . 2011a . Maximal Network Reliability with Optimal Transmission Line Assignment for Stochastic Electric Power Networks via Genetic Algorithms . Applied Soft Computing , 11 : 2714 – 2724 .
  • Lin , YK and Yeh , CT . 2011b . Multistate Components Assignment Problem with Optimal Network Reliability Subject to Assignment Budget . Applied Mathematics and Computation , 217 : 10074 – 10086 .
  • Martins , EDQV and Santos , JLED . 1997 . An Algorithm for the Quickest Path Problem . Operations Research Letters , 20 : 195 – 198 .
  • Park , CK , Lee , S and Park , S . 2004 . A Label-setting Algorithm for Finding a Quickest Path . Computers and Operations Research , 31 : 2405 – 2418 .
  • Pascoal , MMB , Captivo , MEV and Clímaco , JCN . 2005 . An Algorithm for Ranking Quickest Simple Paths . Computers and Operations Research , 32 : 509 – 520 .
  • Reichhart , A , Framinan , JM and Holweg , M . 2008 . On the Link Between Inventory and Responsiveness in Multi-product Supply Chains . International Journal of Systems Science , 39 : 677 – 688 .
  • Xue , J . 1985 . On Multistate System Analysis . IEEE Transactions on Reliability , 34 : 329 – 337 .
  • Yarlagadda , R and Hershey , J . 1991 . Fast algorithm for computing the reliability of communication network . International Journal of Electronics , 70 : 549 – 564 .
  • Yeh , WC . 2007 . An Improved Sum-of-disjoint-products Technique for the Symbolic Network Reliability Analysis with Known Minimal Paths . Reliability Engineering and System Safety , 92 : 260 – 268 .
  • Yeh , WC . 2008 . A Simple Minimal Path Method for Estimating the Weighted Multi-commodity Multistate Unreliable Networks Reliability . Reliability Engineering and System Safety , 93 : 125 – 136 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.