COMPETITIVE ANALYSIS FOR THE ON-LINE FUZZY MOST CONNECTIVE PATH PROBLEM
In this paper, the On-line Fuzzy most Connective Path Problem (OFCP) without a map is originally proposed and studied by our team, based on the traditional optimal path problem in the domain of the operations research, fuzzy theory and logic and the theory of the on-line algorithms. In this model, two kinds of uncertainties, namely on-line and fuzzy, are combined to be considered at the same time. Firstly,some preliminaries concerning the competitive analysis and the most connective path problem and then the model of OFCP are established and relevant concepts are formulated.Following that, some on-line fuzzy algorithms are designed to handle the problem of OFCP and the rigorous proofs for the competitive ratio are given. Finally, conclusions are made and some possible research directions are discussed.
Competitive analysis on-line fuzzy algorithm most connective competitive ratio
WEI-MIN MA ZHI-FANG YU KE WANG
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing 1000 School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing 1000
国际会议
2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)
大连
英文
1845-1850
2006-08-13（万方平台首次上网日期，不代表论文的发表时间）