4.8 Article

Admissible Orders on Fuzzy Numbers

Journal

IEEE TRANSACTIONS ON FUZZY SYSTEMS
Volume 30, Issue 11, Pages 4788-4799

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TFUZZ.2022.3160326

Keywords

Fuzzy sets; Kernel; Shortest path problem; Writing; Upper bound; Uncertainty; Topology; Admissible orders; fuzzy numbers; fuzzy weighted graphs; orders on fuzzy numbers

Funding

  1. CNPq (Brazilian Research Council) [311429/2020-3]
  2. Spanish Government [PID2019-108392GB-I00]

Ask authors/readers for more resources

This article introduces the concept of admissible order for fuzzy numbers and proposes a method to construct admissible orders. With this method, the path costs in fuzzy weighted graphs can be ranked.
From the more than two hundred partial orders for fuzzy numbers proposed in the literature, only a few are total. In this article, we introduce the notion of admissible order for fuzzy numbers equipped with a partial order, i.e., a total order which refines the partial order. In particular, it is given special attention to the partial order proposed by Klir and Yuan in 1995. Moreover, we propose a method to construct admissible orders on fuzzy numbers in terms of linear orders defined for intervals considering a strictly increasing upper dense sequence, proving that this order is admissible for a given partial order. Finally, we use admissible orders to ranking the path costs in fuzzy weighted graphs.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available