Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach

Transportation Research Part B: Methodological

Volumn 67, Issue , 2014, Pages 235-263

  Szeto, W Y ^a   Jiang, Y ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Artificial bee colony algorithm; Bi level programming; Bus network design; Matheuristics; Mixed integer program; Transit route and frequency setting problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; LINEAR PROGRAMMING; MASS TRANSPORTATION; NONLINEAR PROGRAMMING; OPTIMIZATION; TRANSPORTATION;

ARTIFICIAL BEE COLONY ALGORITHMS; BI-LEVEL PROGRAMMING; BUS NETWORKS; FREQUENCY SETTING; MATHEURISTICS; MIXED-INTEGER PROGRAMS;

INTEGER PROGRAMMING;

ALGORITHM; BUS TRANSPORT; HEURISTICS; TRANSPORTATION SYSTEM;

APOIDEA;

EID: 84902343252     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2014.05.008     Document Type: Article

References (81)

1. Baaj H., Mahmassani H.S. TRUST: A LISP program for the analysis of transit route configurations. Transportation Research Record 1990, 1283:125-135.
2. Bielli M., Caramia M., Carotenuto P. Genetic algorithms in bus network optimization. Transportation Research Part C 2002, 10(1):19-34.
3. Bunte S., Kliewer N., Suhl L. An overview on vehicle scheduling models in public transport. Proceedings of the 10th International Conference on Computer-Aided Scheduling of Public Transport 2006, Springer-Verlag, Leeds, UK.
4. Ceder A., Wilson N.H.M. Bus network design. Transportation Research Part B 1986, 20(4):331-344.
5. Cepeda M., Corninetti R., Florian M. A frequency-based assignment model for congested transit networks with strict capacity constraints: Characterization and computation of equilibria. Transportation Research Part B 2006, 40(6):437-459.
6. Chakroborty P., Dwivedi T. Optimal route network design for transit systems using genetic algorithms. Engineering Optimization 2002, 34(1):83-100.
7. Constantin L., Florian M. Optimizing frequencies in a transit network: A nonlinear bi-level programming approach. International Transactions in Operational Research 1995, 2(2):149-164.
8. Cortés C.E., Jara-Moroni P., Moreno E., Pineda C. Stochastic transit equilibrium. Transportation Research Part B 2013, 51:29-44.
9. de Cea J., Fernández E. Transit assignment for congested public transport systems: An equilibrium model. Transportation Science 1993, 27(2):133-147.
10. Fan L., Mumford C.L. A metaheuristic approach to the urban transit routing problem. Journal of Heuristics 2010, 16(3):353-372.
11. Fan, W., Machemehl, R., 2004. Optimal transit route network design problem: Algorithms, implementations, and numerical results. Research Report SWUTC/04/167244-1, Southwest Region University Transportation Center, Center for Transportation Research, University of Texas at Austin. [access on 4 Feb 2014]. http://www.d2dtl5nnlpfr0r.cloudfront.net/swutc.tamu.edu/publications/technicalreports/167244-1.pdf.
12. Fan W., Machemehl R. Optimal transit route network design problem with variable transit demand: Genetic algorithm approach. Journal of Transportation Engineering 2006, 132(1):40-51.
13. Fan W., Machemehl R. Using a simulated annealing algorithm to solve the transit route network design problem. Journal of Transportation Engineering 2006, 132(2):122-132.
14. Fernandez E., Marcotte P. Operators-users equilibrium model in a partially regulated transit system. Transportation Science 1992, 26(2):93-105.
15. Fleurent, C., Lessard, R., Seguin, L., 2004. Transit timetable synchronization: Evaluation and optimization. In: Proceedings of the Ninth International Conferences on Computer Aided Scheduling of Public Transport (CASPT), San Diego, CA.
16. Furth P.G., Wilson N.H.M. Setting frequencies on bus routes: Theory and practice. Transportation Research Record 1982, 818:1-7.
17. Gao Z.Y., Sun H., Shan L.L. A continuous equilibrium network design model and algorithm for transit systems. Transportation Research Part B 2004, 38(3):235-250.
18. Guan J.F., Yang H., Wirasinghe S.C. Simultaneous optimization of transit line configuration and passenger line assignment. Transportation Research Part B 2006, 40(10):885-902.
19. Guihaire V., Hao J.K. Transit network design and scheduling: A global review. Transportation Research Part A 2008, 42(10):1251-1273.
20. Hadas Y., Shnaiderman M. Public-transit frequency setting using minimum-cost approach with stochastic demand and travel time. Transportation Research Part B 2012, 46(8):1068-1084.
21. Haupt R.L., Haupt S.E. Practical Genetic Algorithms 2004, John Wiley and Sons, New York.
22. Jara-Díaz S.R., Gschwender A., Ortega M. Is public transport based on transfers optimal? A theoretical investigation. Transportation Research Part B 2012, 46(7):808-816.
23. Kang F., Li J., Xu Q. Structural inverse analysis by hybrid simplex artificial bee colony algorithms. Computers and Structures 2009, 87(13-14):861-870.
24. Karaboga, D., 2005. An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey.
25. Karaboga D. A new design method based on artificial bee colony algorithm for digital IIR filters. Journal of the Franklin Institute 2009, 346(4):328-348.
26. Karaboga D., Ozturk C. Neural networks training by artificial bee colony algorithm on pattern classification. Neural Network World 2009, 19(3):279-292.
27. Kepaptsoglou K., Karlaftis M. Transit route network design problem: Review. Journal of Transportation Engineering 2009, 135(8):491-505.
28. Kurauchi F., Bell M., Schmöcker J.D. Capacity constrained transit assignment with common lines. Journal of Mathematical Modelling and Algorithms 2003, 2(4):309-327.
29. Lam W.H.K., Cheung C.Y., Poon Y.F. A study of train dwelling time at the Hong Kong mass transit railway system. Journal of Advanced Transportation 1998, 32(3):285-295.
30. Lam W.H.K., Gao Z.Y., Chan K.S., Yang H. A stochastic user equilibrium assignment model for congested transit networks. Transportation Research Part B 1999, 33(5):351-368.
31. Lam W.H.K., Zhou J., Sheng Z.H. A capacity restraint transit assignment with elastic line frequency. Transportation Research Part B 2002, 36(10):919-938.
32. Laporte G., Mesa J.A., Perea F. A game theoretic framework for the robust railway transit network design problem. Transportation Research Part B 2010, 44(4):447-459.
33. LeBlanc L.J. Transit network design. Transportation Research Part B 1988, 22(5):383-390.
34. Lee Y.J., Vuchic V.R. Transit network design with variable demand. Journal of Transportation Engineering 2005, 131(1):1-10.
35. Lei, Q.S., Chen, J., 2004. An algorithm for transit assignment with elastic demand under capacity constraint. In: Proceedings of the 5th World Congress on Intelligent Control and Automation (WCICA), 5245-5247.
36. Leiva C., Munoz J.C., Giesen R., Larrain H. Design of limited-stop services for an urban bus corridor with capacity constraints. Transportation Research Part B 2010, 44(10):1186-1201.
37. Li Z.C., Lam W.H.K., Sumalee A. Modeling impacts of transit operator fleet size under various market regimes with uncertainty in network. Transportation Research Record 2008, 2063:18-27.
38. Li Z.C., Lam W.H.K., Wong S.C. The optimal transit fare structure under different market regimes with uncertainty in the network. Networks and Spatial Economics 2009, 9(2):191-216.
39. Li Z.C., Lam W.H.K., Wong S.C. On the allocation of new lines in a competitive transit network with uncertain demand and scale economies. Journal of Advanced Transportation 2011, 45(4):233-251.
40. Li Z.C., Lam W.H.K., Wong S.C., Sumalee A. Design of a rail transit line for profit maximization in a linear transportation corridor. Transportation Research Part E 2012, 48(1):50-70.
41. Lo H.K., Szeto W.Y. Time-dependent transport network design under cost-recovery. Transportation Research Part B 2009, 43(1):142-158.
42. Lo H.K., Yip C.W., Wan K. Modeling transfer and non-linear fare structure in multi-modal network. Transportation Research Part B 2003, 37(2):149-170.
43. Long J.C., Szeto W.Y., Huang H.J. A bi-objective turning restriction design problem in urban road networks. European Journal of Operational Research 2014, 237(2):426-439.
44. Magnanti T.L., Wong R.T. Network design and transportation planning: Models and algorithms. Transportation Science 1984, 18(1):1-55.
45. Mandl C.E. Evaluation and optimization of urban public transportation networks. European Journal of Operational Research 1980, 5(6):41-47.
46. Mazloumi E., Mesbah M., Ceder A., Moridpour S., Currie G. Efficient transit schedule design of timing points: A comparison of ant colony and genetic algorithms. Transportation Research Part B 2012, 46(1):217-234.
47. Miller C.E., Tuker A.W., Zemlin R.A. Integer programming formulation of the traveling salesman problems. Journal of the ACM 1960, 7(4):326-329.
48. Murray A.T. A coverage model for improving public transit system accessibility and expanding access. Annals of Operations Research 2003, 123(1):143-156.
49. Ngamchai S., Lovell D. Optimal time transfer in bus transit route network design using a genetic algorithm. Journal of Transportation Engineering 2003, 129(5):510-521.
50. Nguyen S., Pallottino S. Equilibrium traffic assignment for large scale transit networks. European Journal of Operational Research 1988, 37(2):176-186.
51. Schmöcker J.D., Bell M.G.H., Kurauchi F. A quasi-dynamic capacity constrained frequency-based transit assignment model. Transportation Research Part B 2008, 42(10):925-945.
52. Schmöcker J.D., Fonzone A., Shimamoto H., Kurauchi F., Bell M.G.H. Frequency-based transit assignment considering seat capacities. Transportation Research Part B 2011, 45(2):392-408.
53. Shih M.C., Mahmassani H.S., Baaj M.H. A planning and design model for transit route networks with coordinated operations. Transportation Research Record 1998, 1623:16-23.
54. Spiess H., Florian M. Optimal strategies: A new assignment model for transit networks. Transportation Research Part B 1989, 23(2):83-102.
55. Sumalee A., Uchida K., Lam W.H.K. Stochastic multi-modal transport network under demand uncertainties and adverse weather condition. Transportation Research Part C 2011, 19(2):338-350.
56. Sumalee A., Tan Z.J., Lam W.H.K. Dynamic stochastic transit assignment with explicit seat allocation model. Transportation Research Part B 2009, 43(8-9):895-912.
57. Sun L.J., Gao Z.Y. An equilibrium model for urban transit assignment based on game theory. European Journal of Operational Research 2007, 181(1):305-314.
58. Szeto W.Y., Jiang Y. A hybrid artificial bee colony algorithm for transit network design. Transportation Research Record 2012, 2284:47-56.
59. Szeto W.Y., Jiang Y., Wong K.I., Solayappan M. Reliability-based stochastic transit assignment with capacity constraints: Formulation and solution method. Transportation Research Part C 2013, 35:286-304.
60. Szeto W.Y., Lo H.K. Strategies for road network design over time: Robustness under uncertainty. Transportmetrica 2005, 1(1):47-63.
61. Szeto W.Y., Lo H.K. Time-dependent transport network improvement and tolling strategies. Transportation Research Part A 2008, 42(2):376-391.
62. Szeto W.Y., Solayappan M., Jiang Y. Reliability-based transit assignment for congested stochastic transit networks. Computer-Aided Civil and Infrastructure Engineering 2011, 26(4):311-326.
63. Szeto W.Y., Wu Y.Z. A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong. European Journal of Operational Research 2010, 209(2):141-155.
64. Szeto W.Y., Wu Y.Z., Ho S.C. An artificial bee colony algorithm for the capacitated vehicle routing problem. European Journal of Operational Research 2011, 215(1):126-135.
65. Szeto W.Y. Routing and scheduling hazardous material shipments: Nash game approach. Transportmetrica B 2013, 1(3):237-260.
66. Szeto W.Y., Jiang Y. Transit assignment: Approach-based formulation, extragradient method and paradox. Transportation Research Part B 2014, 62:51-76.
67. Teklu F. A stochastic process approach for frequency-based transit assignment with strict capacity constraints. Networks and Spatial Economics 2008, 8(2-3):225-240.
68. Tom V.M., Mohan S. Transit route network design using frequency coded genetic algorithm. Journal of Transportation Engineering 2003, 129(2):186-195.
69. Uchida K., Sumalee A., Watling D.P., Connors R. A study on optimal frequency design problem for multi-modal network using probit-based user equilibrium assignment. Transportation Research Record 2005, 1923:236-245.
70. Uchida K., Sumalee A., Watling D.P., Connors R. A study on network design problems for multi-modal networks by probit-based stochastic user equilibrium. Networks and Spatial Economics 2007, 7(3):213-240.
71. van Nes R., Hamerslag R., Immers B.H. Design of public transport networks. Transportation Research Record 1988, 1202:74-83.
72. Watling D.P., Cantarella G.E. Modelling sources of variation in transportation systems: Theoretical foundations of day-to-day dynamic models. Transportmetrica B 2013, 1(1):3-32.
73. Wan Q.K., Lo H.K. A mixed integer formulation for multiple-route transit network design. Journal of Mathematical Modeling and Algorithms 2003, 2(4):299-308.
74. Wong R.C.W., Yuen T.W.Y., Fung K.W., Leung J.M.Y. Optimizing timetable synchronization for rail mass transit. Transportation Science 2008, 42(1):57-69.
75. Wren A., Rousseau J.M. Transportation network design using a cumulative algorithm and neural network. Transportation Research Record 1993, 1364:37-44.
76. Yin Y., Lam W.H.K., Miller M.A. A simulation-based reliability assessment approach for congested transit network. Journal of Advanced Transportation 2004, 38(1):27-44.
77. Yu B., Yang Z.Z., Jin P.H., Wu S.H., Yao B.Z. Transit route network design-maximizing direct and transfer demand density. Transportation Research Part C 2012, 22:58-75.
78. Zhao, F., Gan, F., 2003. Optimization of transit network to minimize transfers, Final Report, Contract No. BD015-02. Research Office, Florida Department of Transportation. [access on 4 Feb 2014]. http://www.dot.state.fl.us/research-center/Completed_Proj/Summary_PTO/FDOT_BD015_02rpt.pdf.
79. Zhao F., Ubaka I., Gan A. Transit network optimization: Minimizing transfers and maximizing services coverage with an integrated simulated annealing and tabu search method. Transportation Research Record 2005, 1923:180-188.
80. Zhao F., Zeng X. Simulated annealing-genetic algorithm for transit network optimization. Journal of Computing in Civil Engineering 2006, 20(1):57-68.
81. Zubieta L. A network equilibrium model for oligopolistic competition in city bus services. Transportation Research Part B 1998, 32(6):413-422.