Finding shortest path in static networks: using a modified algorithm

Sahar Abbas and Fahimeh Moosavi
Additional contact information
Sahar Abbas: Department of Industrial Engineering, NajafabadBranch, Islamic Azad University, Esfahan, Iran
Fahimeh Moosavi: Department of Industrial Engineering, NajafabadBranch, Islamic Azad University, Esfahan, Iran

International Journal of Finance & Banking Studies, 2012, vol. 1, issue 1, 29-34

Abstract: This paper considers the problem of finding the shortest path in a static network, where the costs are constant. The CE Algorithm based strategy that is presented by Rubinstein to solving rare eventand combinatorial optimization problem is modified to finding shortest path in this research. To analyze the efficiency of the used algorithm three sets of small, medium and large sized problems that generated randomly are solved. The results on the set of problems show that the modified algorithm produces good solutions and time saving in computation of large-scale network.

Keywords: shortest path; CE Algorithm; rare event; combinatorial (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.ssbfnet.com/ojs/index.php/ijfbs/article/view/446/408 (application/pdf)
https://www.ssbfnet.com/ojs/index.php/ijfbs/article/view/446 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rbs:ijfbss:v:1:y:2012:i:1:p:29-34

Access Statistics for this article

International Journal of Finance & Banking Studies is currently edited by Prof.Dr.Hasan Dincer

More articles in International Journal of Finance & Banking Studies from Center for the Strategic Studies in Business and Finance IJFBS Editorial Office, IMU, School of Business. Contact information at EDIRC.
Bibliographic data for series maintained by Hasan Dincer ().