Back to Search Start Over

COMPETITIVE ANALYSIS FOR THE MOST RELIABLE PATH PROBLEM WITH ONLINE AND FUZZY UNCERTAINTIES.

Authors :
Wei-Min Ma
Shao-Hua Tang
Ke Wang
Source :
International Journal of Pattern Recognition & Artificial Intelligence. Feb2008, Vol. 22 Issue 1, p195-206. 12p.
Publication Year :
2008

Abstract

Based on some results of the fuzzy network computation and competitive analysis, the Online Fuzzy Most Reliable Path Problem (OFRP), which is one of the most important problems in network optimization with uncertainty, has been originally proposed by our team. In this paper, the preliminaries about fuzzy and the most reliable path and competitive analysis are given first. Following that, the mathematical model of OFRP, in which two kinds of uncertainties, namely online and fuzzy, are combined to be considered at the same time, is established. Then some online fuzzy algorithms are developed to address the OFRP and the rigorous proofs of the competitive analysis are given in detail. Finally, some possible research directions of the OFRP are discussed and the conclusions are drawn. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
02180014
Volume :
22
Issue :
1
Database :
Academic Search Index
Journal :
International Journal of Pattern Recognition & Artificial Intelligence
Publication Type :
Academic Journal
Accession number :
31359226
Full Text :
https://doi.org/10.1142/S0218001408006156