GENETIC ALGORITHM BASED A NEW ALGORITHM FOR TIME DYNAMIC SHORTEST PATH PROBLEM

DENER M., AKCAYOL M. A., Toklu S., BAY Ö. F.

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, cilt.26, sa.4, ss.915-928, 2011 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 26 Sayı: 4
  • Basım Tarihi: 2011
  • Dergi Adı: JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.915-928
  • Anahtar Kelimeler: Genetic algorithm, Shortest path problem, Networks, ROUTING PROBLEM, NETWORK DESIGN
  • Gazi Üniversitesi Adresli: Evet

Özet

Many studies have been done for the shortest path problem and the results of these studies have been applied to different areas especially computer engineering and industrial engineering. In this study, a new algorithm has been developed using genetic algorithm for shortest path problem which have dynamic path cost depending on time. An example case study have been developed to compare proposed algorithm and the others. The simulation results show that the proposed algorithm is more successful than the others.