Determination of the Skip-Stop Scheduling for a Congested Transit Line by Bilevel Genetic Algorithm

DOI

10.2991/ijcis.2011.4.6.7How to use a DOI?

Keywords

Transit scheduling, Skip-stop operation, Optimization, Bilevel genetic algorithm.

Abstract

This study focuses on how to determine the skip-stop scheduling for a congested urban transit line during the morning rush hours. A transit schedule with uneven headways and skip-stop operations is adopted to match the time-dependent demands and accelerate the circulative utilizations of vehicles. This schedule allows the buses to run on unequal vehicle-departure intervals and to skip some stations. A nonlinear programming model is formulated to minimize the overall waiting times and the in-vehicle crowded costs subjected to a limited number of vehicles. According to the layered characteristics of the skip-stop scheduling, a bilevel genetic algorithm is developed to solve the proposed model. The possible departure times of vehicles at the terminal are searched by the outer genetic algorithm and the skip-stop operations are solved by the inner genetic algorithm. Finally, the proposed model and algorithm are successfully tested with the help of a real-world case.

Copyright

© 2011, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Huimin Niu
PY  - 2011
DA  - 2011/12/01
TI  - Determination of the Skip-Stop Scheduling for a Congested Transit Line by Bilevel Genetic Algorithm
JO  - International Journal of Computational Intelligence Systems
SP  - 1158
EP  - 1167
VL  - 4
IS  - 6
SN  - 1875-6883
UR  - https://doi.org/10.2991/ijcis.2011.4.6.7
DO  - 10.2991/ijcis.2011.4.6.7
ID  - Niu2011
ER  -