Skip to main content

Optimal Path Problem with Possibilistic Weights

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Geoinformation and Cartography ((LNGC))

Abstract

The selection of optimal path is one of the classic problems in graph theory. Its utilization have various practical uses ranging from the transportation, civil engineering and other applications. Rarely those applications take into account the uncertainty of the weights of the graph. However this uncertainty can have high impact on the results. Several studies offer solution by implementing the fuzzy arithmetic for calculation of the optimal path but even in those cases neither of those studies proposed complete solution to the problem of ranking of the fuzzy numbers. In the study the ranking system based on the Theory of Possibility is used. The biggest advantage of this approach is that it very well addresses the indistinguishability of fuzzy numbers. Lengths of the paths are compared based on the possibility and the necessity of being smaller than the alternative. The algorithm offers the user more information than only the optimal path, instead the list of possible solutions is calculated and the alternatives can be ranked using the possibility and the necessity to identify the possibly best variant.

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

Buying options

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
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Yu C, Lee J, Munro-Stasiuk MJ (2003) Extensions to least-cost path algorithms for roadway planning. Int J Geogr Inf Sci 17(4):361–376

    Article  Google Scholar 

  2. Mahdavi I, Nourifar R, Heidarzade A, Amiri NM (2009) A dynamic programming approach for finding shortest chains in a fuzzy network. Appl Soft Comput 9(2):503–511

    Article  Google Scholar 

  3. Okada S, Oper T (2000) A shortest path problem on a network with fuzzy arc lengths. Fuzzy Sets Syst 109(1):129–140

    Article  Google Scholar 

  4. Deng Y, Chen Y, Zhang Y, Mahadevan S (2012) Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Appl Soft Comput 12(3):1231–1237

    Article  Google Scholar 

  5. Ghatee M, Hashemi SM (2009) Application of fuzzy minimum cost flow problems to network design under uncertainty. Fuzzy Sets Syst 160(22):3263–3289

    Article  Google Scholar 

  6. Hernandes F, Lamata MT, Verdegay JL, Yamakami A (2007) The shortest path problem on networks with fuzzy parameters. Fuzzy Sets Syst 158(14):1561–1570

    Article  Google Scholar 

  7. Ji X, Iwamura K, Shao Z (2007) New models for shortest path problem with fuzzy arc lengths. Appl Math Model 31(2):259–269

    Article  Google Scholar 

  8. Okada S (2004) Fuzzy shortest path problems incorporating interactivity among paths. Fuzzy Sets Syst 142(3):335–357

    Article  Google Scholar 

  9. Tajdin A, Mahdavi I, Mahdavi-Amiri N, Sadeghpour-Gildeh B (2010) Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using α-cuts. Comput Math Appl 60(4):989–1002

    Article  Google Scholar 

  10. Hanss M (2005) Applied fuzzy arithmetic: an introduction with engineering applications. Springer, Berlin

    Google Scholar 

  11. Dubois D, Prade H (1983) Ranking fuzzy numbers in the setting of possibility theory. Inf Sci 30(3):183–224

    Article  Google Scholar 

  12. Bondy JA, Murty USR (2008) Graph theory. Springer, New York

    Book  Google Scholar 

  13. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271

    Article  Google Scholar 

  14. Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338–353

    Article  Google Scholar 

  15. Moore RE, Kearfott RB, Cloud MJ (2009) Introduction to interval analysis. Society for Industrial and Applied Mathematics, Philadelphia

    Book  Google Scholar 

  16. Zadeh LA (1978) Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst 1:3–28

    Article  Google Scholar 

Download references

Acknowledgments

The authors gratefully acknowledge the support by the Operational Program Education for Competitiveness—European Social Fund (projects CZ.1.07/2.3.00/20.0170 and CZ.1.07/2.2.00/28.0078 of the Ministry of Education, Youth and Sports of the Czech Republic).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Caha .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Caha, J., Dvorský, J. (2015). Optimal Path Problem with Possibilistic Weights. In: Ivan, I., Benenson, I., Jiang, B., Horák, J., Haworth, J., Inspektor, T. (eds) Geoinformatics for Intelligent Transportation. Lecture Notes in Geoinformation and Cartography. Springer, Cham. https://doi.org/10.1007/978-3-319-11463-7_3

Download citation

Publish with us

Policies and ethics