An Algorithm for the Cycled Shortest Path Problem
For a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with cycle. In this paper, a new algorithm for thi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Allameh Tabataba'i University Press
2011-06-01
|
| Series: | Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī |
| Subjects: | |
| Online Access: | https://jims.atu.ac.ir/article_4497_4fe0370c52c56cf608b193bb5417f3ad.pdf |
| _version_ | 1797368950758047744 |
|---|---|
| author | Asghar Aini Amir Salehipour |
| author_facet | Asghar Aini Amir Salehipour |
| author_sort | Asghar Aini |
| collection | DOAJ |
| description | For a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with cycle. In this paper, a new algorithm for this problem which requires less computational effort than the Floyd-Warshall algorithm has been developed Furthermore, it can be shown that the basis of our algorithm is much easier to be learnt and understood which might be an advantage for educational puposes. A small example validates our algorithm and shows its implementation. |
| first_indexed | 2024-03-08T17:39:59Z |
| format | Article |
| id | doaj.art-899381dee8a643ceada8561ac45900a3 |
| institution | Directory Open Access Journal |
| issn | 2251-8029 2476-602X |
| language | fas |
| last_indexed | 2024-03-08T17:39:59Z |
| publishDate | 2011-06-01 |
| publisher | Allameh Tabataba'i University Press |
| record_format | Article |
| series | Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī |
| spelling | doaj.art-899381dee8a643ceada8561ac45900a32024-01-02T11:14:54ZfasAllameh Tabataba'i University PressMuṭāli̒āt-i Mudīriyyat-i Ṣan̒atī2251-80292476-602X2011-06-018211671804497An Algorithm for the Cycled Shortest Path ProblemAsghar Aini0Amir Salehipour1عضو هیئت علمی دانشکده مهندسی کامپیوتر و فناوری اطلاعات دانشگاه هوایی شهید ستاری تهران، (مسئول مکاتبات)عضو هیئت علمی دانشگاه آزاد اسلامی، گرمسارFor a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with cycle. In this paper, a new algorithm for this problem which requires less computational effort than the Floyd-Warshall algorithm has been developed Furthermore, it can be shown that the basis of our algorithm is much easier to be learnt and understood which might be an advantage for educational puposes. A small example validates our algorithm and shows its implementation.https://jims.atu.ac.ir/article_4497_4fe0370c52c56cf608b193bb5417f3ad.pdfthe shortest path problemshortest path network with cyclefloyd-warshall algorithmrectangular algorithm |
| spellingShingle | Asghar Aini Amir Salehipour An Algorithm for the Cycled Shortest Path Problem Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī the shortest path problem shortest path network with cycle floyd-warshall algorithm rectangular algorithm |
| title | An Algorithm for the Cycled Shortest Path Problem |
| title_full | An Algorithm for the Cycled Shortest Path Problem |
| title_fullStr | An Algorithm for the Cycled Shortest Path Problem |
| title_full_unstemmed | An Algorithm for the Cycled Shortest Path Problem |
| title_short | An Algorithm for the Cycled Shortest Path Problem |
| title_sort | algorithm for the cycled shortest path problem |
| topic | the shortest path problem shortest path network with cycle floyd-warshall algorithm rectangular algorithm |
| url | https://jims.atu.ac.ir/article_4497_4fe0370c52c56cf608b193bb5417f3ad.pdf |
| work_keys_str_mv | AT asgharaini analgorithmforthecycledshortestpathproblem AT amirsalehipour analgorithmforthecycledshortestpathproblem AT asgharaini algorithmforthecycledshortestpathproblem AT amirsalehipour algorithmforthecycledshortestpathproblem |