Makaleler     Dergiler     Kitaplar    

International Journal of Finance and Banking Studies

Yıl 2012 , Cilt 1 , Sayı 1

Makale özeti ve diğer detaylar.

Makale özeti
Başlık :

Finding shortest path in static networks: using a modified algorithm

Yazarlar :
Yazar kurumları :
Department of Industrial Engineering, Najafabad Branch, Islamic Azad University1
Görüntülenme :
167
DOI :
Özet Türkçe :

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.

Anahtar kelimeler :
Özet İngilizce :

Anahtar kelimeler :
Paylaş :
Benzer Makaleler
Yorum Yap
  • Adınız :
  • Güvenlik Kodu :
  • Yorum :