A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs
The Shortest Path Problem is a core problem in network optimization, with applications in various scientific and engineering fields, such as communication, transportation, routing, scheduling, and computer networks. Many studies and algorithms have been proposed to solve the traditional shortest pat...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Etamaths Publishing
2023-11-01
|
Series: | International Journal of Analysis and Applications |
Online Access: | http://etamaths.com/index.php/ijaa/article/view/2993 |
_version_ | 1797404904004780032 |
---|---|
author | K. Vidhya A. Saraswathi |
author_facet | K. Vidhya A. Saraswathi |
author_sort | K. Vidhya |
collection | DOAJ |
description | The Shortest Path Problem is a core problem in network optimization, with applications in various scientific and engineering fields, such as communication, transportation, routing, scheduling, and computer networks. Many studies and algorithms have been proposed to solve the traditional shortest path problem, but they often fail to provide optimal solutions when dealing with the uncertainties and vagueness that exist in real-world situations. This study aims to address the Bi-objective Shortest Path Problem using intuitionistic fuzzy arc numbers. The main goal is to find the path that minimizes both cost and time between a given source node and destination node. To handle the complexities introduced by trapezoidal intuitionistic fuzzy numbers, an accuracy function is used. The study suggests a simple yet effective method to solve this problem and shows its efficiency through a numerical example. The research tries to offer innovative solutions for optimizing paths in scenarios where cost and time factors are important, navigating the complex landscape of uncertainty inherent in practical applications. |
first_indexed | 2024-03-09T03:01:49Z |
format | Article |
id | doaj.art-429eff590fb04dc3a158bc0bde8ff418 |
institution | Directory Open Access Journal |
issn | 2291-8639 |
language | English |
last_indexed | 2024-03-09T03:01:49Z |
publishDate | 2023-11-01 |
publisher | Etamaths Publishing |
record_format | Article |
series | International Journal of Analysis and Applications |
spelling | doaj.art-429eff590fb04dc3a158bc0bde8ff4182023-12-04T12:13:04ZengEtamaths PublishingInternational Journal of Analysis and Applications2291-86392023-11-012112112110.28924/2291-8639-21-2023-1212378A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc CostsK. VidhyaA. SaraswathiThe Shortest Path Problem is a core problem in network optimization, with applications in various scientific and engineering fields, such as communication, transportation, routing, scheduling, and computer networks. Many studies and algorithms have been proposed to solve the traditional shortest path problem, but they often fail to provide optimal solutions when dealing with the uncertainties and vagueness that exist in real-world situations. This study aims to address the Bi-objective Shortest Path Problem using intuitionistic fuzzy arc numbers. The main goal is to find the path that minimizes both cost and time between a given source node and destination node. To handle the complexities introduced by trapezoidal intuitionistic fuzzy numbers, an accuracy function is used. The study suggests a simple yet effective method to solve this problem and shows its efficiency through a numerical example. The research tries to offer innovative solutions for optimizing paths in scenarios where cost and time factors are important, navigating the complex landscape of uncertainty inherent in practical applications.http://etamaths.com/index.php/ijaa/article/view/2993 |
spellingShingle | K. Vidhya A. Saraswathi A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs International Journal of Analysis and Applications |
title | A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs |
title_full | A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs |
title_fullStr | A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs |
title_full_unstemmed | A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs |
title_short | A Novel Method for Finding the Shortest Path With Two Objectives Under Trapezoidal Intuitionistic Fuzzy Arc Costs |
title_sort | novel method for finding the shortest path with two objectives under trapezoidal intuitionistic fuzzy arc costs |
url | http://etamaths.com/index.php/ijaa/article/view/2993 |
work_keys_str_mv | AT kvidhya anovelmethodforfindingtheshortestpathwithtwoobjectivesundertrapezoidalintuitionisticfuzzyarccosts AT asaraswathi anovelmethodforfindingtheshortestpathwithtwoobjectivesundertrapezoidalintuitionisticfuzzyarccosts AT kvidhya novelmethodforfindingtheshortestpathwithtwoobjectivesundertrapezoidalintuitionisticfuzzyarccosts AT asaraswathi novelmethodforfindingtheshortestpathwithtwoobjectivesundertrapezoidalintuitionisticfuzzyarccosts |