Paper Information

Journal:   JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)   WINTER 2018 , Volume 14 , Number 4 (55) #S0020; Page(s) 67 To 87.
 
Paper: 

CASCADE RECTANGLE ALGORITHM AND TRANSPOSITION MATRIX IN THE CYCLED SHORTEST PATH NETWORKS

 
 
Author(s):  AINI A.*, ESHGHI K.
 
* DEPARTMENT OF INDUSTRIAL ENGINEERING, SHARIF UNIVERSITY OF TECHNOLOGY, TEHRAN, IRAN.
 
Abstract: 

Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrices-based algorithms for detecting of shortest path and distance between all pairs of this problem in the literature of research. In this paper, a new exact algorithm, named the Cascade Rectangle Algorithm, is presented by using the main structure of previous exact algorithms and developing some new techniques. In cascade rectangle algorithm, all mathematical calculations and operations execute in multirectangle structure. This algorithm is an efficient exact algorithm with simple procedure and fast running time. Furthermore, a new matrix on the basis of route matrix, called the Transposition Matrix, is defined to apply the sensitivity analysis and reoptimization of the all pairs shortest path networks. Finally, one illustrative example is also solved in a step by step procedure to show the details of the cascade rectangle algorithm, floyd-warshall algorithm, revised matrix algorithm, and Transposition Matrix.

 
Keyword(s): CYCLED SHORTEST PATH NETWORKS ALGORITHMS, CASCADE RECANGLE ALGORITHM, REVISED MATRIX METHOD, FLOYD-WARSHALL ALGORITHM, REVISED CASCADE METHOD
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 36
 
Latest on Blog
Enter SID Blog