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.
Article PDF
Avoid common mistakes on your manuscript.
References
J.H.Jansson, A simple bus line model for optimization of service frequency and bus size, Journal of Transport Economic and Policy, 14(1) (1980) 53–80.
A. Ceder, Bus timetables with even passenger loads as opposed to even headways, Transportation Research Record, 1760 (2001) 3–9.
S. C. Wirasinghe, Initial planning for urban transit systems, Advanced Modeling for Transit Operations and Service Planning, Elsevier Science, Oxford, (2003) 1–29.
V. Guihaire, J. K. Hao, Transit network design and scheduling: a global review, Transportation Research Part A, 42 (10) (2008) 1251–1273.
P. Prioni, D. Hensher, Measuring service quality in scheduled bus services, Journal of Public Transportation, 3 (2000) 51–74.
J. H. Banks, Optimal headways for multi-route transit systems, Journal of Advanced Transportation, 24 (1990) 127–154.
K. K. T. Lee, S. H. F. Kuo, P. M. Schonfeld, Optimal mixed bus fleet for urban operations, Transportation Research Record, 1503 (1995) 39–48.
T. A. S. Vijayaraghavan, K. M. Anantharamaiah, Fleet assignment strategies in urban transportation using express and partial services, Transportation Research Part A, 29(2) (1995) 157–171.
S. P. Delle, F. Filippi, Service optimization for bus corridors with short-turn strategies and variable vehicle size, Transportation Research Part A, 32(1) (1998) 19–38.
X.J. Eberlein, N. Wilson, B. Bernstein, The real time deadheading problem in transit operations control, Transportation Research Part B, 32(2) (1998) 77–109.
L. Fu, Q. Liu, P. Calamai, A real-time optimization model for dynamic scheduling of transit operations. Transportation Research Record, 1857 (2003) 48–55.
C. Leiva, J. C. Muzoa, R. Giesen, H. Larrain, Design of limited-stop services for an urban bus corridor with capacity constraints, Transportation Research Part B, 44(10) (2010) 1186–1201.
H. M. Niu, A. Z. Hu, Optimization model and algorithm for system operation division of labor at two-way marshalling station, Science in China Part E, 41 (5) (1998) 511–518.
J. Gao, R. Chen, A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem, International Journal of Computational Intelligence Systems, 4(4) (2011) 497–508.
R.S. Kumar, N. Alagumurthi, Integrated total cost and tolerance optimization with genetic algorithm, International Journal of Computational Intelligence Systems, 3(3) (2010) 325–333.
Y. Marinakisa, M. Marinakib, A bilevel genetic algorithm for a real life location routing problem, International Journal of Logistics Research and Applications, 11(1) (2008) 49–65.
Z. X. Guo, W. K. Wong, S. Y. S. Leung, J. T. Fan, S. F. Chan, A bi-level genetic algorithm for multi-objective scheduling of multi-and mixed-model apparel assembly lines, Lecture Notes in Computer Science, 4304 (2006) 934–941.
M. Gen, R. W. Cheng, Genetic Algorithms and Engineering Optimization (John Wiley & Son, 2000).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
Niu, H. Determination of the Skip-Stop Scheduling for a Congested Transit Line by Bilevel Genetic Algorithm. Int J Comput Intell Syst 4, 1158–1167 (2011). https://doi.org/10.2991/ijcis.2011.4.6.7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.2991/ijcis.2011.4.6.7