Since 2014
Finding shortest path in static networks: using a modified algorithm
International Journal of Finance & Banking Studies
View Archive Info| Field | Value | |
| Title |
Finding shortest path in static networks: using a modified algorithm
|
|
| Creator |
Abbasi, Seher; Department of Industrial Engineering, Najafabad Branch, Islamic Azad University, Esfahan, Iran
|
|
| Subject |
—
shortest path, CE Algorithm, rare event, combinatorial |
|
| Description |
This paper considers the problem of finding the shortest path in a static network, where the costs are constant. The CE Algorithmbased strategy that is presented by Rubinstein to solving rare event and combinatorial optimization problem is modified to findingshortest path in this research. To analyze the efficiency of the used algorithm three sets of small, medium and large sized problemsthat generated randomly are solved. The results on the set of problems show that the modified algorithm produces good solutionsand time saving in computation of large-scale network.
|
|
| Publisher |
SSBFNET
|
|
| Contributor |
—
|
|
| Date |
2012-12-15
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion Peer-reviewed Article |
|
| Format |
application/pdf
|
|
| Identifier |
http://www.ssbfnet.com/ojs/index.php/ijfbs/article/view/12
|
|
| Source |
International Journal of Finance & Banking Studies (ISSN: 2147- 4486); Vol 1, No 1 (2012): IJFBS; 29-34
2147-4486 |
|
| Language |
eng
|
|
| Relation |
http://www.ssbfnet.com/ojs/index.php/ijfbs/article/view/12/12
|
|