A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
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...
Main Authors: | Sadollah Ebrahimnejad, Seyed Meysam Mousavi, Behnam Vahdani |
---|---|
Format: | Article |
Language: | English |
Published: |
Islamic Azad University, Qazvin Branch
2013-09-01
|
Series: | Journal of Optimization in Industrial Engineering |
Subjects: | |
Online Access: | http://www.qjie.ir/article_144_d85c20492b1a214701dc86923bd91ce6.pdf |
Similar Items
-
A novel ant colony algorithm for solving shortest path problems with fuzzy arc weights
by: Debora Di Caprio, et al.
Published: (2022-05-01) -
Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions
by: Lissette Valdés, et al.
Published: (2021-08-01) -
Picture fuzzy semi-prime ideals
by: Amal Adak, et al.
Published: (2023-06-01) -
Neutrosophic Fuzzy Ideals in Γ Rings
by: P. Durgadevi, et al.
Published: (2023-05-01) -
Shortest Path Problem in Network with Type-2 Triangular Fuzzy Arc Length
by: Ranjan Kumar, et al.
Published: (2017-03-01)