Competitive Analysis for the On-Line Fuzzy Most Connective Path Problem

Author

Ma, Wei-min ; Yu, Zhi-fang ; Wang, Ke

Author_Institution

Sch. of Econ. & Manage., Beijing Univ. of Aeronaut. & Astronaut.

fYear

2006

fDate

13-16 Aug. 2006

Firstpage

1845

Lastpage

1850

Abstract

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

Keywords

fuzzy logic; fuzzy set theory; number theory; operations research; optimisation; competitive analysis; fuzzy logic; fuzzy number theory; online fuzzy most connective path problem; operations research; optimal path problem; Aerodynamics; Algorithm design and analysis; Conference management; Cybernetics; Extraterrestrial measurements; Fuzzy logic; Machine learning; Operations research; Roads; Space technology; Statistics; Technology management; Uncertainty; Competitive analysis; competitive ratio; most connective; on-line fuzzy algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2006 International Conference on

Conference_Location

Dalian, China

Print_ISBN

1-4244-0061-9

Type

conf

DOI

10.1109/ICMLC.2006.259048

Filename

4028365