UPM Institutional Repository

Metaheuristic approaches for urban transit scheduling problem: a review


Citation

Uvaraja, Vikneswary and Lee, Lai Soon (2017) Metaheuristic approaches for urban transit scheduling problem: a review. Journal of Advanced Review on Scientific Research, 34 (1). pp. 11-25. ISSN 2289-7887

Abstract

Urban Transit Network Design Problem (UTNDP) focuses on deriving useful set of routes, manageable timetabling for each transit route and transit scheduling based on available resources. UTNDP is commonly subdivided into Urban Transit Routing Problem (UTRP) and Urban Transit Scheduling Problem (UTSP), respectively. There are various approaches applied to solve the UTSP. The aim of this paper is to give a comprehensive list of studies on UTSP that deals with metaheuristic approaches such as Tabu Search, Simulated Annealing, Genetic Algorithm and their hybrid methods. This review also addressed possible gaps of the approaches and the limitations of the overall problem. It can be concluded that only some of the metaheuristic approaches and sub-problems are highly studied in UTSP. This review will be useful for researchers who are interested in expanding their knowledge and conduct research in UTSP using metaheuristic approaches.


Download File

[img] Text
Metaheuristic approaches for urban transit scheduling problem.pdf

Download (86kB)

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Penerbit Akademia Baru
Keywords: Hybrid approach; Metaheuristic; Urban transit network design; Urban transit scheduling
Depositing User: Nurul Ainie Mokhtar
Date Deposited: 10 Jan 2020 06:59
Last Modified: 10 Jan 2020 06:59
URI: http://psasir.upm.edu.my/id/eprint/62400
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item