Time version of the shortest path problem in a stochastic-flow network

Journal of Computational and Applied Mathematics

Volumn 228, Issue 1, 2009, Pages 150-157

  Lin, Yi Kuei ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Quickest path; Shortest path; Stochastic flow network; Time constraint; Two minimal paths

Indexed keywords

CAVITY RESONATORS; RANDOM PROCESSES; RELIABILITY;

QUICKEST PATH; SHORTEST PATH; STOCHASTIC-FLOW NETWORK; TIME CONSTRAINT; TWO MINIMAL PATHS;

COMPUTER NETWORKS;

EID: 63349098550     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2008.09.003     Document Type: Article

References (33)

1. Ahuja R.K. Minimum cost-reliability ratio problem. Computers & Operations Research 16 (1998) 83-89
2. Alexopoulos C. A Note on state-space decomposition methods for analyzing stochastic flow networks. IEEE Transactions on Reliability 44 (1995) 354-357
3. Al-Ghanim A.M. A heuristic technique for generating minimal paths and cutsets of a general network. Computers and Industrial Engineering 36 (1999) 45-55
4. Aven T. Reliability evaluation of multistate systems with multistate components. IEEE Transactions on Reliability 34 (1985) 473-479
5. Bodin L.D., Golden B.L., Assad A.A., and Ball M.O. Routing and scheduling of vehicles and crews: The state of the art. Computers & Operations Research 10 (1982) 63-211
6. Chen G.H., and Hung Y.C. On the quickest path problem. Information Processing Letters 46 (1993) 125-128
7. Chen G.H., and Hung Y.C. Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Computers & Operations Research 21 (1994) 113-118
8. Chen Y.L., and Chin Y.H. The quickest path problem. Computers & Operations Research 17 (1990) 153-161
9. Chen Y.L. An algorithm for finding the k quickest paths in a network. Computers & Operations Research 20 (1993) 59-65
10. Chen Y.L. Finding the k quickest simples paths in a network. Information Processing Letters 50 (1994) 89-92
11. Chen Y.L., and Tang K. Minimum time paths in a network with mixed time constraints. Computers & Operations Research 25 (1998) 793-805
12. Clímaco J.C.N., Pascoal M.M.B., Craveirinha J.M.F., and Captivo M.E.V. Internet packet routing: Application of a K-quickest path algorithm. European Journal of Operational Research 181 (2007) 1045-1054
13. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of ACM 34 (1987) 596-615
14. Golden B.L., and Magnanti T.L. Deterministic network optimization: A bibliography. Networks 7 (1977) 149-183
15. Hudson J.C., and Kapur K.C. Reliability bounds for multistate systems with multistate components. Operations Research 33 (1985) 153-160
16. Hung Y.C., and Chen G.H. Distributed algorithms for the quickest path problem. Parallel Computing 18 (1992) 823-834
17. Jane C.C., Lin J.S., and Yuan J. On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Transactions on Reliability 42 (1993) 354-361
18. Kobayashi K., and Yamamoto H. A new algorithm in enumerating all minimal paths in a sparse network. Reliability Engineering & System Safety 65 (1999) 11-15
19. Lee D.T., and Papadopoulou E. The all-pairs quickest path problem. Information Processing Letters 45 (1993) 261-267
20. Lin J.S., Jane C.C., and Yuan J. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25 (1995) 131-138
21. Lin Y.K. Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network. Computers & Operations Research 30 (2003) 567-575
22. Lin Y.K. Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints. IEEE Transactions on Reliability 53 (2004) 381-387
23. Lin Y.K. 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 (2007) 180-188
24. Lin Y.K. On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint. European Journal of Operational Research 176 (2007) 347-360
25. Martins E.D.Q.V., and Santos J.L.E.D. An algorithm for the quickest path problem. Operations Research Letters 20 (1997) 195-198
26. Park C.K., Lee S., and Park S. A label-setting algorithm for finding a quickest path. Computers & Operations Research 31 (2004) 2405-2418
27. Pascoal M.M.B., Captivo M.E.V., and Clímaco J.C.N. An algorithm for ranking quickest simple paths. Computers & Operations Research 32 (2005) 509-520
28. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectronics and Reliability 35 (1995) 973-976
29. Xue J. On multistate system analysis. IEEE Transactions on Reliability 34 (1985) 329-337
30. Yarlagadda R., and Hershey J. Fast algorithm for computing the reliability of communication network. International Journal of Electronics 70 (1991) 549-564
31. Yeh W.C. Search for minimal paths in modified networks. Reliability Engineering & System Safety 75 (2002) 389-395
32. Yeh W.C. An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths. Reliability Engineering & System Safety 92 (2007) 260-268
33. Yeh W.C. A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability. Reliability Engineering & System Safety 93 (2008) 125-136