Let's Connect
Follow Us
Watch Us
(+385) 1 2380 262
journal.prometfpz.unizg.hr
Promet - Traffic&Transportation journal

Accelerating Discoveries in Traffic Science

Accelerating Discoveries in Traffic Science

PUBLISHED
06.02.2020
LICENSE
Copyright (c) 2024 G. Nilay Yücenur

Two-step Meta-heuristic Approach for a Vehicle Assignment Problem – Case from İstanbul/Turkey

Authors:

G. Nilay Yücenur
Beykent University

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

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.

References

  1. Verbas Ö, Mahmassani HS, Hyland MF. Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale application. Transportation Research Part B. 2016;93: 1-16. Available from: doi:10.1016/j.trb.2016.07.002

    Vidal T, Crainic TG, Gendreau M, Prins C. Implicit depot assignments and rotations in vehicle routing heuristics. European Journal of Operational Research. 2014;237: 15-28. Available from: doi:10.1016/j.ejor.2013.12.044

    Zhao Y, Leng L, Qian Z, Wang W. A Discrete hybrid invasive weed optimization algorithm for the capacitated vehicle routing problem. Procedia Computer Science. 2016;91: 978-987. Available from: doi:10.1016/j.procs.2016.07.127

    Tlili T, Faiz S, Krichen S. A Hybrid metaheuristic for the distance-constrained capacitated vehicle routing problem. Procedia – Social and Behavioral Sciences. 2014;109: 779-783. Available from: doi:10.1016/j.sbspro.2013.12.543

    Yassen ET, Ayob M, Nazri MZA, Sabar NR. An adaptive hybri

Show more
How to Cite
Yücenur, G. (et al.) 2020. Two-step Meta-heuristic Approach for a Vehicle Assignment Problem – Case from İstanbul\u002FTurkey. Traffic&Transportation Journal. 32, 1 (Feb. 2020), 79-90. DOI: https://doi.org/10.7307/ptt.v32i1.3156.

SPECIAL ISSUE IS OUT

Guest Editor: Eleonora Papadimitriou, PhD

Editors: Marko Matulin, PhD, Dario Babić, PhD, Marko Ševrović, PhD


Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal