Study on multi-objective optimization of flow allocation in a multi-commodity stochastic-flow network with unreliable nodes

Journal of Applied Mathematics and Computing

Volumn 28, Issue 1-2, 2008, Pages 185-198

  Liu, Qiang ^a   Zhao, Qingzhen ^b   Zang, Wenke ^b  

^a SHANDONG UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b SHANDONG NORMAL UNIVERSITY   (China)

Author keywords

Minimal path; Multi objective genetic algorithm; Stochastic integer programming; Stochastic flow network

Indexed keywords

EID: 48749113165     PISSN: 15985865     EISSN: None     Source Type: Journal    
DOI: 10.1007/s12190-008-0093-9     Document Type: Article

References (20)

1. 1. A.M. Al-Ghanim 1999 A heuristic technique for generating minimal paths and cut sets of a general network[J] Comput. Ind. Eng. 36 45 55 10.1016/S0360-8352(98)00111-9 Al-Ghanim, A.M.: A heuristic technique for generating minimal paths and cut sets of a general network[J]. Comput. Ind. Eng. 36, 45–55 (1999)
2. 2. K. Deb 2000 An efficient constraint handling method for genetic algorithms Comput. Methods Appl. Mech. Eng. 186 2–4 311 338 1028.90533 10.1016/S0045-7825(99)00389-8 Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186 (2–4), 311–338 (2000)
3. 3. K. Deb A. Pratap S. Agarwal T. Meyarivan 2002 A fast and elitist multi-objective genetic algorithm: NSGA-II IEEE Trans. Evol. Comput. 6 2 182 197 10.1109/4235.996017 Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6 (2), 182–197 (2002)
4. 4. C.-C. Hsieh M.-H. Lin 2003 Reliability-oriented multi-resource allocation in a stochastic-flow network Reliab. Eng. Syst. Saf. 81 2 155 161 10.1016/S0951-8320(03)00082-6 Hsieh, C.-C., Lin, M.-H.: Reliability-oriented multi-resource allocation in a stochastic-flow network. Reliab. Eng. Syst. Saf. 81 (2), 155–161 (2003)
5. 5. K. Kobayashi H. Yamamoto 1999 A new algorithm in enumerating all minimal paths in a sparse network[J] Reliab. Eng. Syst. Saf. 65 11 15 10.1016/S0951-8320(98)00076-3 Kobayashi, K., Yamamoto, H.: A new algorithm in enumerating all minimal paths in a sparse network[J]. Reliab. Eng. Syst. Saf. 65, 11–15 (1999)
6. 6. Y.-K. Lin 2001 A simple algorithm for reliability evaluation of a stochastic-flow network with node failure Comput. Oper. Res. 28 13 1277 1285 0989.90015 10.1016/S0305-0548(00)00039-3 1849248 Lin, Y.-K.: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput. Oper. Res. 28 (13), 1277–1285 (2001)
7. 7. Y.-K. Lin 2002 Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs Reliab. Eng. Syst. Saf. 75 1 41 46 10.1016/S0951-8320(01)00110-7 Lin, Y.-K.: Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliab. Eng. Syst. Saf. 75 (1), 41–46 (2002)
8. 8. Y.-K. Lin 2002 Study on the system capacity for a multicommodity stochastic-flow network with node failure Reliab. Eng. Syst. Saf. 78 1 57 62 10.1016/S0951-8320(02)00108-4 Lin, Y.-K.: Study on the system capacity for a multicommodity stochastic-flow network with node failure. Reliab. Eng. Syst. Saf. 78 (1), 57–62 (2002)
9. 9. Y.-K. Lin 2002 Two-commodity reliability evaluation for a stochastic-flow network with node failure Comput. Oper. Res. 29 13 1927 1939 10.1016/S0305-0548(01)00069-7 Lin, Y.-K.: Two-commodity reliability evaluation for a stochastic-flow network with node failure. Comput. Oper. Res. 29 (13), 1927–1939 (2002)
10. 10. Y.-K. Lin 2003 Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network Comput. Oper. Res. 30 4 567 575 1026.90024 10.1016/S0305-0548(02)00025-4 Lin, Y.-K.: Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network. Comput. Oper. Res. 30 (4), 567–575 (2003)
11. 11. Y.-K. Lin 2003 Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case Comput. Oper. Res. 30 11 1595 1607 1039.90006 10.1016/S0305-0548(02)00094-1 1978053 Lin, Y.-K.: Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case. Comput. Oper. Res. 30 (11), 1595–1607 (2003)
12. 12. Y.-K. Lin 2004 An algorithm to evaluate the system reliability for multicommodity case under cost constraint Comput. Math. Appl. 48 5–6 805 812 1079.90035 10.1016/j.camwa.2004.01.012 2105253 Lin, Y.-K.: An algorithm to evaluate the system reliability for multicommodity case under cost constraint. Comput. Math. Appl. 48 (5–6), 805–812 (2004)
13. 13. Y.-K. Lin 2006 Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts Reliab. Eng. Syst. Saf. 91 5 539 45 10.1016/j.ress.2005.03.018 Lin, Y.-K.: Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts. Reliab. Eng. Syst. Saf. 91 (5), 539–45 (2006)
14. 14. Lin, Y.-K.: On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint. Eur. J. Oper. Res. (2008, in press). Available online 7 September 2005. doi: 10.1016/j.ejor.2005.07.015
15. 15. Y. Shen 1995 A new simple algorithm for enumerating all minimal paths and cuts of a graph[J] Microelectron. Reliab. 35 973 976 10.1016/0026-2714(94)00121-4 Shen, Y.: A new simple algorithm for enumerating all minimal paths and cuts of a graph[J]. Microelectron. Reliab. 35, 973–976 (1995)
16. 16. Yan, Z., Qian, M.: Improving efficiency of solving d-MC problem in stochastic-flow network. Reliab. Eng. Syst. Saf. (2008, in press). Available online 27 December 2005. doi: 10.1016/j.ress.2005.11.006
17. 17. W.C. Yeh 2001 A simple approach to search for all d-MCs of a limited-flow network Reliab. Eng. Syst. Saf. 71 1 15 19 10.1016/S0951-8320(00)00070-3 Yeh, W.C.: A simple approach to search for all d-MCs of a limited-flow network. Reliab. Eng. Syst. Saf. 71 (1), 15–19 (2001)
18. 18. W.C. Yeh 2001 A simple algorithm to search for all d-MPs with unreliable nodes Reliab. Eng. Syst. Saf. 73 1 49 54 10.1016/S0951-8320(01)00032-1 Yeh, W.C.: A simple algorithm to search for all d-MPs with unreliable nodes. Reliab. Eng. Syst. Saf. 73 (1), 49–54 (2001)
19. 19. W.C. Yeh 2002 A simple method to verify all d-minimal path candidates of a limited-flow network and its reliability Int. J. Adv. Manuf. Technol. 20 1 77 81 10.1007/s001700200127 Yeh, W.C.: A simple method to verify all d-minimal path candidates of a limited-flow network and its reliability. Int. J. Adv. Manuf. Technol. 20 (1), 77–81 (2002)
20. 20. W.-C. Yeh 2004 A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes Reliab. Eng. Syst. Saf. 83 1 47 55 10.1016/j.ress.2003.08.007 Yeh, W.-C.: A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes. Reliab. Eng. Syst. Saf. 83 (1), 47–55 (2004)