Competitive Analysis for the Most Reliable Path Problem with Online and Fuzzy Uncertainties

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.

[1]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[2]  L. Zadeh.  Fuzzy sets as a basis for a theory of possibility , 1999 .

[3]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Allan Borodin,et al.  An optimal online algorithm for metrical task systems , 1987, STOC.

[5]  Hong Liu,et al.  Fuzzy Transductive Support Vector Machines For Hypertext Classification , 2004, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[6]  Wei-Min Ma,et al.  Competitive analysis for the on-line fuzzy shortest path problem , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[7]  Miro Kraetzl,et al.  The Cross-Entropy Method for Network Reliability Estimation , 2005, Ann. Oper. Res..

[8]  Ching-Hsue Cheng,et al.  Evaluating weapon systems using ranking fuzzy numbers , 1999, Fuzzy Sets Syst..

[9]  James Nga-Kwok Liu,et al.  On the On-line Number of Snacks Problem , 2002, J. Glob. Optim..

[10]  Jack Shaio.  Constraint Generation for Network Reliability Problems , 2001, Ann. Oper. Res..

[11]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[12]  Wei-Min Ma,et al.  Competitive algorithms for the on-line inventory problem , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[13]  Yin-Feng Xu,et al.  On-line k-Truck Problem and Its Competitive Algorithms , 2001, J. Glob. Optim..

[14]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[15]  Jsen-Shung Lin.  Reliability evaluation of capacitated-flow networks with budget constraints , 1998 .

[16]  Ronald E. Giachetti,et al.  Analysis of the error in the standard approximation used for multiplication of triangular and trapezoidal fuzzy numbers and the development of a new approximation , 1997, Fuzzy Sets Syst..

[17]  James Nga-Kwok Liu,et al.  On The K-Truck Scheduling Problem , 2004, Int. J. Found. Comput. Sci..

[18]  Jsen-Shung Lin,et al.  Reliability evaluation of capacitated-flow networks with budget constraints , 1998 .

[19]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[20]  Douglas R. Woodall.  The Bay Restaurant — A Linear Storage Problem , 1974 .

[21]  Dirk P. Kroese,et al.  Cross‐Entropy Method , 2011 .

[22]  Hossain Poorzahedy,et al.  Network performance improvement under stochastic events with long-term effects , 2005 .