Metaheuristic approaches for urban transit scheduling problem: a review

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)...

Full description

Bibliographic Details
Main Authors: Uvaraja, Vikneswary, Lee, Lai Soon
Format: Article
Language:English
Published: Penerbit Akademia Baru 2017
Online Access:http://psasir.upm.edu.my/id/eprint/62400/1/Metaheuristic%20approaches%20for%20urban%20transit%20scheduling%20problem.pdf
_version_ 1796977619986546688
author Uvaraja, Vikneswary
Lee, Lai Soon
author_facet Uvaraja, Vikneswary
Lee, Lai Soon
author_sort Uvaraja, Vikneswary
collection UPM
description 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.
first_indexed 2024-03-06T09:42:44Z
format Article
id upm.eprints-62400
institution Universiti Putra Malaysia
language English
last_indexed 2024-03-06T09:42:44Z
publishDate 2017
publisher Penerbit Akademia Baru
record_format dspace
spelling upm.eprints-624002020-01-10T06:59:44Z http://psasir.upm.edu.my/id/eprint/62400/ Metaheuristic approaches for urban transit scheduling problem: a review Uvaraja, Vikneswary Lee, Lai Soon 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. Penerbit Akademia Baru 2017 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/62400/1/Metaheuristic%20approaches%20for%20urban%20transit%20scheduling%20problem.pdf 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 http://www.akademiabaru.com/arsr.html
spellingShingle Uvaraja, Vikneswary
Lee, Lai Soon
Metaheuristic approaches for urban transit scheduling problem: a review
title Metaheuristic approaches for urban transit scheduling problem: a review
title_full Metaheuristic approaches for urban transit scheduling problem: a review
title_fullStr Metaheuristic approaches for urban transit scheduling problem: a review
title_full_unstemmed Metaheuristic approaches for urban transit scheduling problem: a review
title_short Metaheuristic approaches for urban transit scheduling problem: a review
title_sort metaheuristic approaches for urban transit scheduling problem a review
url http://psasir.upm.edu.my/id/eprint/62400/1/Metaheuristic%20approaches%20for%20urban%20transit%20scheduling%20problem.pdf
work_keys_str_mv AT uvarajavikneswary metaheuristicapproachesforurbantransitschedulingproblemareview
AT leelaisoon metaheuristicapproachesforurbantransitschedulingproblemareview