International Journal of Finance & Banking Studies

International Journal of Finance & Banking Studies

Finding shortest path in static networks: using a modified algorithm

Yazarlar: Seher Abbasi, Fahimeh Moosavi

Cilt 1 , Sayı 1 , 2012 , Sayfalar -

Konular:

Anahtar Kelimeler:Shortest path CE Algorithm rare event combinatorial

Özet: 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 event and 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.

ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2012, title={Finding shortest path in static networks: using a modified algorithm}, volume={1}, number={0}, publisher={International Journal of Finance & Banking Studies}, author={Seher Abbasi, Fahimeh Moosavi}, year={2012} }
APA
KOPYALA
Seher Abbasi, Fahimeh Moosavi. (2012). Finding shortest path in static networks: using a modified algorithm (Vol. 1). Vol. 1. International Journal of Finance & Banking Studies.
MLA
KOPYALA
Seher Abbasi, Fahimeh Moosavi. Finding Shortest Path in Static Networks: Using a Modified Algorithm. no. 0, International Journal of Finance & Banking Studies, 2012.
Atıf Görüntüle
PDF Görüntüle
Kaynak Görüntüle
Paylaş
Dergi Bilgileri