Two-step meta-heuristic approach for a vehicle assignment problem – Case from İstanbul/Turkey [Bir araç atama problemi için iki adimli meta-sezgisel yaklaşim: Istanbul / Türkiye örneği]
Küçük Resim Yok
Tarih
2020
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Faculty of Transport and Traffic Engineering
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In this paper, a two-step meta-heuristic approach is proposed for vehicle assignment problem with geometric shape-based clustering and genetic algorithm. First, the geometric shape-based clustering method is used and then the solution of this method is given to the genetic algorithm as initial solution. The solution process is continued by genetic algorithm. There are 282 bus lines in İstanbul European side. Those buses should be assigned to six bus garages. The proposed method is used to determine the minimum distance between the bus lines and garages by assigning buses to garages. According to the computational results, the proposed algorithm has better clustering performance in terms of the distance from each bus-line start point to each bus garage in the cluster. The crossover rate changing method is also applied as a trial in order to improve the algorithm performance. Finally, the outputs that are generated by different crossover rates are compared with the results of the k-Nearest Neighbour algorithm to prove the effectiveness of the study. © 2020, Faculty of Transport and Traffic Engineering. All rights reserved.
Açıklama
Anahtar Kelimeler
Crossover rate, Genetic algorithm, Geometric shape-based clustering, The k-Nearest Neighbour algorithm, Vehicle assignment problem
Kaynak
Promet - Traffic and Transportation
WoS Q Değeri
Scopus Q Değeri
Q2
Cilt
32
Sayı
1
