TWO-STEP META-HEURISTIC APPROACH FOR A VEHICLE ASSIGNMENT PROBLEM - CASE FROM ISTANBUL/TURKEY

Küçük Resim Yok

Tarih

2020

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Svenciliste U Zagrebu, Fakultet Prometnih Znanosti

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Ö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 Istanbul 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.

Açıklama

Anahtar Kelimeler

vehicle assignment problem, geometric shape-based clustering, genetic algorithm, crossover rate, the k-Nearest Neighbour algorithm

Kaynak

Promet-Traffic & Transportation

WoS Q Değeri

Q4

Scopus Q Değeri

Cilt

32

Sayı

1

Künye