Skip to main content
SpringerLink
Log in

An Algorithm for Maximum Flow Analysis in Traffic Network Based on Fuzzy Matrix

  • Conference paper
Communications and Information Processing

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

Abstract

The problem of traffic network analysis is studied in this paper. Firstly, the traffic flows in a traffic network is modeled by fuzzy matrix. Then the maximum flow in the traffic network is transformed to the transitive closure of the fuzzy matrix. By discussing the relations between the transitive closure of an arbitrary fuzzy matrix and that of its corresponding reflexive matrix, the squaring algorithm for computing the transitive closure of a fuzzy reflexive matrix is extended to the arbitrary case in the following. Lastly, the feasibility and effectiveness of the given algorithm is verified by an example.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yin, J., Wu, K.: Graphtheory and It’s Algorithm. China Science and Technology University Press, Beijing (2003)

    Google Scholar 

  2. Gui, L., Gong, J.: Path-based and sa-based algorithm for transportation network design problem. Geomatics and Information Science of Wuhan University 33(4), 388–392 (2008)

    Google Scholar 

  3. Li, X., An, S.: A closed frequent subgraph based containment query algorithm. Acta Electronica Sinica 38(12), 2937–2943 (2010)

    Google Scholar 

  4. Zhong, S., Deng, W.: Path travel time reliability-based stochastic system optimum congestion pricing model. Systems Engeering—Theorem & Practice 30(12), 2297–2308 (2010)

    Google Scholar 

  5. Qin, J., Shi, F., Deng, L., Xiao, L.: Quantitative evaluation method for road transportation network efficiency and its application. Journal of Jilin University(Engineering and Technology Edition) 40(1), 47–1 (2010)

    Google Scholar 

  6. He, D., Yan, Y., Guo, S., Hao, G.: Optimal Routing algorithm for public traffic network based on matrix analysis. Journal of Southwest Jiao Tong University 42(3), 315–319 (2007)

    MATH  Google Scholar 

  7. Zhou, Z.: Maximum path analysis by the fuzzy matrix in the traffic network. Periodical of Ocean University of China 33(2), 324–328 (2003)

    Google Scholar 

  8. Zhou, Z., Ding, X.-Q., Liu, W.-B.: Fuzzy matrix analysis of the maximum road in traffic network. In: 22nd International Conference of the North American Fuzzy Information Processing Society-NAFIPS, pp. 283–286 (2003)

    Google Scholar 

  9. Yao, Z.-S., Liu, W.-B., Zhou, Z.: Maximum road analysis of traffic network. Advances in System Science and Application 4(4), 618–621 (2004)

    Google Scholar 

  10. Dunn, J.C.: Some recent investigations of a new fuzzy portioning algorithm and its application to pattern classification problems. J. Cybernet. 4, 1–15 (1974)

    Article  MathSciNet  Google Scholar 

  11. Li, G.-X.: Fuzzy cluster analysis on provenance of ancient Yaozhou porcelain bodies. Chinese Science Bulletin 23, 1781–1783 (2002)

    Google Scholar 

  12. Lemström, K., Hella, L.: Approximate pattern matching and transitive closure logics. Theoretical Computer Science 299(4), 387–412 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Penner, M., Prasanna, V.K.: Cache-Friendly implementations of transitive closure. Journal of Experimental Algorithmics (JEA) 11, 283–286 (2003)

    MATH  Google Scholar 

  14. Li, H.-X., Li, X.-F., Wang, J.-Y., Mo, Z.-W., Li, Y.-D.: Fuzzy decision making based on variable weights. Mathematical and Computer Modelling 39(1), 163–179 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lee, J., Lee Jin, S.: Heuristic: search for scheduling flexible manufacturing systems using lower bound reachability matrix. Computers & Industrial Engineering 59(4), 799–806 (2010)

    Article  MathSciNet  Google Scholar 

  16. Pan, T.-T., Lin, S.-S., Qiu, K.: The transitive closure and related algorithms of digraph of the reconfigurable architecture. Parallel Processing Letters 21(1), 27–69 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics Science, Liaocheng University, Liaocheng, 252059, P.R. China

    Feng Zhao

  2. School of Mathematics and Physics, North China Electric Power University, Beijing, 102206, P.R. China

    Yundong Gu

Authors
  1. Feng Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yundong Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Taiyuan University, Xueyuan Road 3, 030051, Taiyuan, Shanxi, China

    Maotai Zhao

  2. Xi’an University, Jinhua Road 4, 710032, Xi’an, Shanxi, China

    Junpin Sha

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, F., Gu, Y. (2012). An Algorithm for Maximum Flow Analysis in Traffic Network Based on Fuzzy Matrix. In: Zhao, M., Sha, J. (eds) Communications and Information Processing. Communications in Computer and Information Science, vol 289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31968-6_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31968-6_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31967-9

  • Online ISBN: 978-3-642-31968-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation