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

Basit Öğe Kaydı
dc.contributor.authorYucenur, G. Nilay
dc.date.accessioned2024-03-13T10:33:30Z
dc.date.available2024-03-13T10:33:30Z
dc.date.issued2020
dc.departmentİstanbul Beykent Üniversitesien_US
dc.description.abstractIn 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.en_US
dc.identifier.endpage90en_US
dc.identifier.issn0353-5320
dc.identifier.issn1848-4069
dc.identifier.issue1en_US
dc.identifier.startpage79en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12662/3997
dc.identifier.volume32en_US
dc.identifier.wosWOS:000520022100007en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherSvenciliste U Zagrebu, Fakultet Prometnih Znanostien_US
dc.relation.ispartofPromet-Traffic & Transportationen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectvehicle assignment problemen_US
dc.subjectgeometric shape-based clusteringen_US
dc.subjectgenetic algorithmen_US
dc.subjectcrossover rateen_US
dc.subjectthe k-Nearest Neighbour algorithmen_US
dc.titleTWO-STEP META-HEURISTIC APPROACH FOR A VEHICLE ASSIGNMENT PROBLEM - CASE FROM ISTANBUL/TURKEYen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu