Skip to main content
SpringerLink
Log in

Finding the Most Reliable Maximum Flow in Transport Network

  • Conference paper
  • First Online:
Cognitive Cities (IC3 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1227))

Included in the following conference series:

  • 1455 Accesses

Abstract

This paper intends to solve the most reliable maximum flow problem (MRMF) on transport network. A subgraph path division algorithm (SPDA) is proposed to get the most reliable maximum flow distribution, which avoid the negative impact of the number of simple paths and its bottleneck capacity. SPDA divides the sub-graph space of a transport network into a set of disjoint closed intervals, which satisfies the maximum flow constraints. Among the lower bounds of all the intervals, the one with discovered probability has proven to be the most reliable maximum. Finally, experimental results reveal the effectiveness and efficiency of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Geoff, B.: OSMnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput. Environ. Urban Syst. 65, 126–139 (2017)

    Article  Google Scholar 

  2. Lin, L., Xu, L., Zhou, S., Wang, D.: The reliability of subgraphs in the arrangement graph. IEEE Trans. Reliab. 64(2), 807–818 (2015)

    Article  Google Scholar 

  3. Liu, L., Jin, R., Aggarwal, C., Shen, Y.: Reliable clustering on uncertain graphs. In: IEEE International Conference on Data Mining (2013)

    Google Scholar 

  4. Liu, Z., Wang, C., Wang, J.: Aggregate nearest neighbor queries in uncertain graphs. World Wide Web 17(1), 161–188 (2014). https://doi.org/10.1007/s11280-012-0200-6

    Article  Google Scholar 

  5. Xu, M., Wang, G., Grant-Muller, S., Gao, Z.: Joint road toll pricing and capacity development in discrete transport network design problem. Transportation 44(4), 731–752 (2017)

    Article  Google Scholar 

  6. Parchas, P., Gullo, F., Papadias, D., Bonchi, F.: Uncertain graph processing through representative instances. ACM Trans. Database Syst. 40(3), 1–39 (2015)

    Article  MathSciNet  Google Scholar 

  7. Cancela, H., Murray, L., Rubino, G.: Highly reliable stochastic flow network reliability estimation. In: Computing Conference (2017)

    Google Scholar 

  8. Yuan, Y., Wang, G.R.: Answering probabilistic reachability queries over uncertain graphs. Chin. J. Comput. 33(8), 1378–1386 (2010)

    Article  MathSciNet  Google Scholar 

  9. Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT 2010, Proceedings of the 13th International Conference on Extending Database Technology, Lausanne, Switzerland, 22–26 March 2010 (2010)

    Google Scholar 

  10. Cats, O., Jenelius, E.: Planning for the unexpected: the value of reserve capacity for public transport network robustness. Transp. Res. Part A: Policy Pract. 81, 47–61 (2015). https://www.sciencedirect.com/science/article/abs/pii/S0965856415000300

    Google Scholar 

  11. Xu, M., Wang, G., Grant-Muller, S., Gao, Z.: Joint road toll pricing and capacity development in discrete transport network design problem. Transportation 44(4), 731–752 (2017)

    Article  Google Scholar 

  12. Doulliez, P., Jamoulle, E.: Transportation networks with random arc capacities. RAIRO 6(3), 45–59 (1972)

    MathSciNet  MATH  Google Scholar 

  13. Alexopoulos, C.: Note on state-space decomposition methods for analyzing stochastic flow networks. IEEE Trans. Reliab. 44(2), 354–357 (1995)

    Article  Google Scholar 

  14. Jane, C.C., Laih, Y.W.: A practical algorithm for computing multi-state two-terminal reliability. IEEE Trans. Reliab. 57(2), 295–302 (2008)

    Article  Google Scholar 

  15. Chin-Chia, J., Yih-Wenn, L.: Computing multi-state two-terminal reliability through critical arc states that interrupt demand. IEEE Trans. Reliab. 59(2), 338–345 (2010)

    Article  Google Scholar 

  16. Peixin, Z., Xin, Z.: A survey on reliability evaluation of stochastic-flow networks in terms of minimal paths. In: International Conference on Information Engineering & Computer Science (2009)

    Google Scholar 

  17. Lin, J.S.: Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets. Int. J. Inf. Manag. Sci. 27(3), 13 (2016)

    MATH  Google Scholar 

  18. Lin, Y.K.: System reliability evaluation for a multistate supply chain network with failure nodes using minimal paths. IEEE Trans. Reliab. 58(1), 34–40 (2009)

    Article  Google Scholar 

  19. Ramirez-Marquez, J.E., Coit, D.W.: A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability. Reliab. Eng. Syst. Saf. 87(2), 253–264 (2005)

    Article  Google Scholar 

  20. Claudio, M.R.S., Muselli, M.: Approximate multi-state reliability expressions using a new machine learning technique. Reliab. Eng. Syst. Saf. 89(3), 261–270 (2005)

    Article  Google Scholar 

  21. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithm and Applications. China Machine Press, Beijing (2005)

    MATH  Google Scholar 

  22. Jane, C.C., Lin, J.S., Yuan, J.: Reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Trans. Reliab. 42(3), 354–361 (1993)

    Article  Google Scholar 

  23. 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)

    Article  MathSciNet  Google Scholar 

  24. Lee, S.H.: Reliability evaluation of a flow network. IEEE Trans. Reliab. R-29(1), 24–26 (2009)

    Google Scholar 

  25. Klingman, D., Napier, A., Stutz, J.: NETGEN: a program for generating large scale capacitated assignment, transportation and minimal cost flow network problems. Manag. Sci. 20(5), 814–821 (1974)

    Article  Google Scholar 

  26. Han, W.S., Lee, J., Pham, M.D.: iGraph: a framework for comparisons of disk-based graph indexing techniques. In: Proceedings of the 36th International Conference on Very Large Data Bases (VLDB), Singapore, pp. 449–559 (2010)

    Google Scholar 

Download references

Acknowledgements

This work was partly supported by the National Key R&D Program of China (2018YFC0830200), the Fundamental Research Funds for the Central Universities (2242018S30021 and 2242017S30023) and Open Research Fund from Key Laboratory of Computer Network and Information Integration In Southeast University, Ministry of Education, China.

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Southeast University, Nanjing, 211189, China

    Jie Wang, Wei Cai, Sihai Zhou, Yundi Liu, Weicheng Liao & Baili Zhang

  2. Key Laboratory of Computer Network and Information Integration of Ministry of Education, Nanjing, China

    Sihai Zhou, Yundi Liu & Weicheng Liao

  3. Research Center for Judicial Big Data, Supreme Count of China, Nanjing, 211189, China

    Baili Zhang

Authors
  1. Jie Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sihai Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yundi Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Weicheng Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Baili Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jie Wang .

Editor information

Editors and Affiliations

  1. Nanjing University of Information Science and Technology, Nanjing, China

    Jian Shen

  2. National Taitung University, Taitung City, Taiwan

    Yao-Chung Chang

  3. National Taiwan Ocean University, Keelung, Taiwan

    Yu-Sheng Su

  4. Kyoto University, Kyoto, Japan

    Hiroaki Ogata

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, J., Cai, W., Zhou, S., Liu, Y., Liao, W., Zhang, B. (2020). Finding the Most Reliable Maximum Flow in Transport Network. In: Shen, J., Chang, YC., Su, YS., Ogata, H. (eds) Cognitive Cities. IC3 2019. Communications in Computer and Information Science, vol 1227. Springer, Singapore. https://doi.org/10.1007/978-981-15-6113-9_44

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-6113-9_44

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-6112-2

  • Online ISBN: 978-981-15-6113-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation