a shortest path problem is a practical issue in networks for real-world situations. this paper addresses the fuzzy shortest path (fsp) problem to obtain the best fuzzy path among fuzzy paths sets. for this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (ifss) in order to determine the fuzzy shortest path. moreover, this algorithm is developed for ...

Powerset structures of extensional fuzzy sets in sets with similarity relations are investigated. It is proved that extensional fuzzy sets have powerset structures which are powerset theories in the category of sets with similarity relations, and some of these powerset theories are defined also by algebraic theories (monads). Between Zadeh's fuzzy powerset theory and the classical powerset theo...

here we consider the p-center problem on different types of fuzzy networks. in particular, we are interested in the networks with interval and triangular fuzzy arc lengths and vertex-weights. a methodology to obtain the best satisfaction level of the decision maker who wishes to reduce the cost within the tolerance limits is proposed. illustrative examples are provided.

In this paper, we introduce the concept of linear v{C}ech closure spaces and establish the properties of open sets in linear v{C}ech closure spaces (Lv{C}CS). Here, we observe that the concept of linearity is preserved by semi-open sets, g-semi open sets, $gamma$-open sets, sgc-dense sets and compact sets in Lv{C}CS. We also discuss the concept of relative v{C}ech closure operator, meet and pro...

In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...