302
Views
26
CrossRef citations to date
0
Altmetric
Original Articles

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

Pages 1158-1167 | Received 11 Jul 2011, Accepted 25 Nov 2011, Published online: 12 Mar 2012

References

  • Jansson , J. H. 1980 . A simple bus line model for optimization of service frequency and bus size . Journal of Transport Economic and Policy , 14 ( 1 ) : 53 – 80 .
  • Ceder , A. 2001 . Bus timetables with even passenger loads as opposed to even headways . Transportation Research Record , 1760 : 3 – 9 .
  • Wirasinghe , S. C. 2003 . “ Initial planning for urban transit systems ” . In Advanced Modeling for Transit Operations and Service Planning, Elsevier Science, Oxford 1 – 29 .
  • Guihaire , V. and Hao , J. K. 2008 . Transit network design and scheduling: a global review . Transportation Research Part A , 42 ( 10 ) : 1251 – 1273 .
  • Prioni , P. and Hensher , D. 2000 . Measuring service quality in scheduled bus services . Journal of Public Transportation , 3 : 51 – 74 .
  • Banks , J. H. 1990 . Optimal headways for multi-route transit systems . Journal of Advanced Transportation , 24 : 127 – 154 .
  • Lee , K. K. T. , Kuo , S. H. F. and Schonfeld , P. M. 1995 . Optimal mixed bus fleet for urban operations . Transportation Research Record , 1503 : 39 – 48 .
  • Vijayaraghavan , T. A. S. and Anantharamaiah , K. M. 1995 . Fleet assignment strategies in urban transportation using express and partial services . Transportation Research Part A , 29 ( 2 ) : 157 – 171 .
  • Delle , S. P. and Filippi , F. 1998 . Service optimization for bus corridors with short-turn strategies and variable vehicle size . Transportation Research Part A , 32 ( 1 ) : 19 – 38 .
  • Eberlein , X. J. , Wilson , N. and Bernstein , B. 1998 . The real time deadheading problem in transit operations control . Transportation Research Part B , 32 ( 2 ) : 77 – 109 .
  • Fu , L. , Liu , Q. and Calamai , P. 2003 . A real-time optimization model for dynamic scheduling of transit operations . Transportation Research Record , 1857 : 48 – 55 .
  • Leiva , C. , Muzoa , J. C. , Giesen , R. and Larrain , H. 2010 . Design of limited-stop services for an urban bus corridor with capacity constraints . Transportation Research Part B , 44 ( 10 ) : 1186 – 1201 .
  • Niu , H. M. and Hu , A. Z. 1998 . Optimization model and algorithm for system operation division of labor at two-way marshalling station . Science in China Part E , 41 ( 5 ) : 511 – 518 .
  • Gao , J. and Chen , R. 2011 . A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem . International Journal of Computational Intelligence Systems , 4 ( 4 ) : 497 – 508 .
  • Kumar , R. S. and Alagumurthi , N. 2010 . Integrated total cost and tolerance optimization with genetic algorithm . International Journal of Computational Intelligence Systems , 3 ( 3 ) : 325 – 333 .
  • Marinakisa , Y. and Marinakib , M. 2008 . A bilevel genetic algorithm for a real life location routing problem . International Journal of Logistics Research and Applications , 11 ( 1 ) : 49 – 65 .
  • Guo , Z. X. , Wong , W. K. , Leung , S. Y. S. , Fan , J. T. and Chan , S. F. 2006 . A bi-level genetic algorithm for multi-objective scheduling of multi-and mixed-model apparel assembly lines . Lecture Notes in Computer Science , 4304 : 934 – 941 .
  • Gen , M. and Cheng , R. W. 2000 . Genetic Algorithms and Engineering Optimization , John Wiley & Son .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.