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]
dc.contributor.author | Nilay Yücenur G. | |
dc.date.accessioned | 2024-03-13T10:01:21Z | |
dc.date.available | 2024-03-13T10:01:21Z | |
dc.date.issued | 2020 | |
dc.department | İstanbul Beykent Üniversitesi | en_US |
dc.description.abstract | 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. | en_US |
dc.identifier.doi | 10.7307/PTT.V32I1.3156 | |
dc.identifier.endpage | 90 | en_US |
dc.identifier.issn | 0353-5320 | |
dc.identifier.issue | 1 | en_US |
dc.identifier.scopus | 2-s2.0-85082943022 | en_US |
dc.identifier.scopusquality | Q2 | en_US |
dc.identifier.startpage | 79 | en_US |
dc.identifier.uri | https://doi.org/10.7307/PTT.V32I1.3156 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12662/3143 | |
dc.identifier.volume | 32 | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Faculty of Transport and Traffic Engineering | en_US |
dc.relation.ispartof | Promet - Traffic and Transportation | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Crossover rate | en_US |
dc.subject | Genetic algorithm | en_US |
dc.subject | Geometric shape-based clustering | en_US |
dc.subject | The k-Nearest Neighbour algorithm | en_US |
dc.subject | Vehicle assignment problem | en_US |
dc.title | 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] | en_US |
dc.type | Article | en_US |