Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES   SUMMER 2011 , Volume 8 , Number 21; Page(s) 167 To 180.
 
Paper: 

AN ALGORITHM FOR THE CYCLED SHORTEST PATH PROBLEM

 
 
Author(s):  AINI ASGHAR*, SALEHI POUR AMIR
 
* FACULTY OF COMPUTER ENGINEERING, SHAHID SATTARI AIR UNIVERSITY, TEHRAN, IRAN
 
Abstract: 

For a network with cycle, where at least one cycle exists, the Floyd-War shall algorithm is probably the most used algorithm to determine the 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- War shall 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 purposes. A small example validates our algorithm and shows its implementation.

 
Keyword(s): THE SHORTEST PATH PROBLEM, SHORTEST PATH NETWORK WITH CYCLE, FLOYD- WAR SHALL ALGORITHM, RECTANGULAR ALGORITHM
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 66
 
Latest on Blog
Enter SID Blog