A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets

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...

Full description

Bibliographic Details
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:
Shortest path problem
Single criterion networks
Multiple criteria networks
Fuzzy sets
Ideal fuzzy sets
Online Access:http://www.qjie.ir/article_144_d85c20492b1a214701dc86923bd91ce6.pdf
id doaj-0838d6557241498dad375bfc8640de7d
record_format Article
spelling doaj-0838d6557241498dad375bfc8640de7d2020-11-25T00:44:55ZengIslamic Azad University, Qazvin BranchJournal of Optimization in Industrial Engineering2251-99042423-39352013-09-016132737144A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy SetsSadollah Ebrahimnejad0Seyed Meysam Mousavi1Behnam Vahdani2Assistant Professor, Department of Industrial Engineering, Karaj Branch, Islamic Azad University, Karaj, IranPh.D. Student, Young Researches Club, South Tehran Branch, Islamic Azad University, Tehran, IranAssistant Professor, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, IranA 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 a fuzzy network problem including three criteria, namely time, cost and quality risk. Several numerical examples are provided and experimental results are then compared against the fuzzy minimum algorithm with reference to the multi-labeling algorithm based on the similarity degree in order to demonstrate the suitability of the proposed algorithm. The computational results and statistical analyses indicate that the proposed algorithm performs well compared to the fuzzy minimum algorithm.http://www.qjie.ir/article_144_d85c20492b1a214701dc86923bd91ce6.pdfShortest path problemSingle criterion networksMultiple criteria networksFuzzy setsIdeal fuzzy sets
collection DOAJ
language English
format Article
sources DOAJ
author Sadollah Ebrahimnejad
Seyed Meysam Mousavi
Behnam Vahdani
spellingShingle Sadollah Ebrahimnejad
Seyed Meysam Mousavi
Behnam Vahdani
A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
Journal of Optimization in Industrial Engineering
Shortest path problem
Single criterion networks
Multiple criteria networks
Fuzzy sets
Ideal fuzzy sets
author_facet Sadollah Ebrahimnejad
Seyed Meysam Mousavi
Behnam Vahdani
author_sort Sadollah Ebrahimnejad
title A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
title_short A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
title_full A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
title_fullStr A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
title_full_unstemmed A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
title_sort new algorithm for the discrete shortest path problem in a network based on ideal fuzzy sets
publisher Islamic Azad University, Qazvin Branch
series Journal of Optimization in Industrial Engineering
issn 2251-9904
2423-3935
publishDate 2013-09-01
description 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 a fuzzy network problem including three criteria, namely time, cost and quality risk. Several numerical examples are provided and experimental results are then compared against the fuzzy minimum algorithm with reference to the multi-labeling algorithm based on the similarity degree in order to demonstrate the suitability of the proposed algorithm. The computational results and statistical analyses indicate that the proposed algorithm performs well compared to the fuzzy minimum algorithm.
topic Shortest path problem
Single criterion networks
Multiple criteria networks
Fuzzy sets
Ideal fuzzy sets
url http://www.qjie.ir/article_144_d85c20492b1a214701dc86923bd91ce6.pdf
work_keys_str_mv AT sadollahebrahimnejad anewalgorithmforthediscreteshortestpathprobleminanetworkbasedonidealfuzzysets
AT seyedmeysammousavi anewalgorithmforthediscreteshortestpathprobleminanetworkbasedonidealfuzzysets
AT behnamvahdani anewalgorithmforthediscreteshortestpathprobleminanetworkbasedonidealfuzzysets
AT sadollahebrahimnejad newalgorithmforthediscreteshortestpathprobleminanetworkbasedonidealfuzzysets
AT seyedmeysammousavi newalgorithmforthediscreteshortestpathprobleminanetworkbasedonidealfuzzysets
AT behnamvahdani newalgorithmforthediscreteshortestpathprobleminanetworkbasedonidealfuzzysets
_version_ 1725272416688537600

Similar Items