메뉴 건너뛰기




Volumn 19, Issue 6, 2011, Pages 1276-1305

The transit network design problem with elastic demand and internalisation of external costs: An application to rail frequency optimisation

Author keywords

Elastic demand; Optimisation models; Scatter search; Transit network design

Indexed keywords

HEURISTIC ALGORITHMS;

EID: 80052727480     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2011.02.008     Document Type: Article
Times cited : (112)

References (62)
  • 1
    • 0026174743 scopus 로고
    • An AI-based approach for transit route system planning and design
    • Baaj M.H., Mahmassani H.S. An AI-based approach for transit route system planning and design. Journal of Advanced Transportation 1991, 25(2):187-210.
    • (1991) Journal of Advanced Transportation , vol.25 , Issue.2 , pp. 187-210
    • Baaj, M.H.1    Mahmassani, H.S.2
  • 3
    • 0024159073 scopus 로고
    • A general bilevel linear programming formulation of the network design problem
    • Ben-Ayed O., Boyce D.E., Blair C.E. A general bilevel linear programming formulation of the network design problem. Transportation Research Part B 1988, 22(4):311-318.
    • (1988) Transportation Research Part B , vol.22 , Issue.4 , pp. 311-318
    • Ben-Ayed, O.1    Boyce, D.E.2    Blair, C.E.3
  • 4
    • 85029846238 scopus 로고    scopus 로고
    • Bureau of Public Roads, 1964. Traffic Assignment Manual. US Dept. of Commerce, Urban Planning Division, Washington DC.
    • Bureau of Public Roads, 1964. Traffic Assignment Manual. US Dept. of Commerce, Urban Planning Division, Washington DC.
  • 5
    • 34247521369 scopus 로고    scopus 로고
    • A column-generation approach to line planning in public transport
    • Borndorfer R., Grotschel M., Pfetsch M.E. A column-generation approach to line planning in public transport. Transportation Science 2007, 41:123-132.
    • (2007) Transportation Science , vol.41 , pp. 123-132
    • Borndorfer, R.1    Grotschel, M.2    Pfetsch, M.E.3
  • 6
    • 0031139471 scopus 로고    scopus 로고
    • A general fixed-point approach to multimodal multi-user equilibrium assignment with elastic demand
    • Cantarella G.E. A general fixed-point approach to multimodal multi-user equilibrium assignment with elastic demand. Transportation Science 1997, 31:107-128.
    • (1997) Transportation Science , vol.31 , pp. 107-128
    • Cantarella, G.E.1
  • 7
    • 33750953978 scopus 로고    scopus 로고
    • The multi-criteria road network design problem in an urban area
    • Cantarella G.E., Vitetta A. The multi-criteria road network design problem in an urban area. Transportation 2006, 33(6):567-588.
    • (2006) Transportation , vol.33 , Issue.6 , pp. 567-588
    • Cantarella, G.E.1    Vitetta, A.2
  • 8
    • 54049117875 scopus 로고    scopus 로고
    • An urban bus network design procedure
    • Carrese S., Gori S. An urban bus network design procedure. Applied Optimization 2002, 64:177-196.
    • (2002) Applied Optimization , vol.64 , pp. 177-196
    • Carrese, S.1    Gori, S.2
  • 12
    • 0021194873 scopus 로고
    • The planning of urban bus routes and frequencies: a survey
    • Chua T.A. The planning of urban bus routes and frequencies: a survey. Transportation 1984, 12(2):147-172.
    • (1984) Transportation , vol.12 , Issue.2 , pp. 147-172
    • Chua, T.A.1
  • 15
    • 0344213257 scopus 로고
    • Optimizing frequencies in a transit network: a nonlinear bi-level programming approach
    • Constantin I., Florian M. Optimizing frequencies in a transit network: a nonlinear bi-level programming approach. International Transactions in Operational Research 1995, 2(2):149-164.
    • (1995) International Transactions in Operational Research , vol.2 , Issue.2 , pp. 149-164
    • Constantin, I.1    Florian, M.2
  • 18
    • 85029870277 scopus 로고    scopus 로고
    • Optimal transit route network design problem: algorithms, implementations, and numerical results. Tech. Rep. SWUTC/04/167244-1, Center for Transportation Research, University of Texas.
    • Fan, W., Machemehl, R.B., 2004. Optimal transit route network design problem: algorithms, implementations, and numerical results. Tech. Rep. SWUTC/04/167244-1, Center for Transportation Research, University of Texas.
    • (2004)
    • Fan, W.1    Machemehl, R.B.2
  • 19
    • 31144461825 scopus 로고    scopus 로고
    • Optimal transit route network design problem with variable transit demand: genetic algorithm approach
    • Fan W., Machemehl R.B. Optimal transit route network design problem with variable transit demand: genetic algorithm approach. Journal of Transportation Engineering 2006, 132(1):40-51.
    • (2006) Journal of Transportation Engineering , vol.132 , Issue.1 , pp. 40-51
    • Fan, W.1    Machemehl, R.B.2
  • 20
    • 50249137168 scopus 로고    scopus 로고
    • Tabu search strategies for the public transportation network optimisations with variable transit demand
    • Fan W., Machemehl R.B. Tabu search strategies for the public transportation network optimisations with variable transit demand. Computer-Aided Civil and Infrastructure Engineering 2008, 23:502-520.
    • (2008) Computer-Aided Civil and Infrastructure Engineering , vol.23 , pp. 502-520
    • Fan, W.1    Machemehl, R.B.2
  • 21
  • 22
    • 85029888555 scopus 로고    scopus 로고
    • Estimating External Costs of Transportation in Regional Areas using Available Statistical Data: The Case of the Region of Campania. TeMA.
    • Gallo, M., 2010. Estimating External Costs of Transportation in Regional Areas using Available Statistical Data: The Case of the Region of Campania. TeMA, vol. 2, pp. 59-70. http://www.tema.unina.it.
    • (2010) , vol.2 , pp. 59-70
    • Gallo, M.1
  • 24
    • 0346750595 scopus 로고    scopus 로고
    • A continuous equilibrium network design model and algorithm for transit systems
    • Gao Z., Sun H., Shan L. A continuous equilibrium network design model and algorithm for transit systems. Transportation Research Part B 2004, 38:235-250.
    • (2004) Transportation Research Part B , vol.38 , pp. 235-250
    • Gao, Z.1    Sun, H.2    Shan, L.3
  • 25
    • 11244341317 scopus 로고    scopus 로고
    • Solution algorithm for the bi-level discrete network design problem
    • Gao Z., Wu J., Sun H. Solution algorithm for the bi-level discrete network design problem. Transportation Research Part B 2005, 39(6):479-495.
    • (2005) Transportation Research Part B , vol.39 , Issue.6 , pp. 479-495
    • Gao, Z.1    Wu, J.2    Sun, H.3
  • 27
    • 4544336693 scopus 로고    scopus 로고
    • A branch-and-cut approach for solving railway line-planning problems
    • Goossens J.-W., van Hoesel S., Kroon L. A branch-and-cut approach for solving railway line-planning problems. Transportation Science 2004, 38:379-393.
    • (2004) Transportation Science , vol.38 , pp. 379-393
    • Goossens, J.-W.1    van Hoesel, S.2    Kroon, L.3
  • 29
    • 33745805849 scopus 로고    scopus 로고
    • Simultaneous optimization of transit line configuration and passenger line assignment
    • Guan J.F., Yang H., Wirasinghe S.C. Simultaneous optimization of transit line configuration and passenger line assignment. Transportation Research Part B 2006, 40:885-902.
    • (2006) Transportation Research Part B , vol.40 , pp. 885-902
    • Guan, J.F.1    Yang, H.2    Wirasinghe, S.C.3
  • 30
    • 54049135170 scopus 로고    scopus 로고
    • Transit network design and scheduling: a global review
    • Guihaire V., Hao J.-K. Transit network design and scheduling: a global review. Transportation Research Part A 2008, 42:1251-1273.
    • (2008) Transportation Research Part A , vol.42 , pp. 1251-1273
    • Guihaire, V.1    Hao, J.-K.2
  • 31
    • 0019909687 scopus 로고
    • The allocation of buses in heavily utilized networks with overlapping routes
    • Han A.F., Wilson N. The allocation of buses in heavily utilized networks with overlapping routes. Transportation Research Part B 1982, 16:221-232.
    • (1982) Transportation Research Part B , vol.16 , pp. 221-232
    • Han, A.F.1    Wilson, N.2
  • 34
    • 33644924645 scopus 로고    scopus 로고
    • Solving the feeder bus network design problem by genetic algorithms and ant colony optimization
    • Kuan S.N., Ong H.L., Ng K.M. Solving the feeder bus network design problem by genetic algorithms and ant colony optimization. Advances in Engineering Software 2006, 37:351-359.
    • (2006) Advances in Engineering Software , vol.37 , pp. 351-359
    • Kuan, S.N.1    Ong, H.L.2    Ng, K.M.3
  • 35
    • 77549085438 scopus 로고    scopus 로고
    • A game theoretic framework for the robust railway transit network design problem
    • 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:447-459.
    • (2010) Transportation Research Part B , vol.44 , pp. 447-459
    • Laporte, G.1    Mesa, J.A.2    Perea, F.3
  • 38
    • 73149118261 scopus 로고    scopus 로고
    • Exact and heuristic methods for public transit circulator design
    • Lownes N.E., Machemehl R.B. Exact and heuristic methods for public transit circulator design. Transportation Research Part B 2010, 44:309-318.
    • (2010) Transportation Research Part B , vol.44 , pp. 309-318
    • Lownes, N.E.1    Machemehl, R.B.2
  • 39
    • 0021376457 scopus 로고
    • Network design and transportation planning: models and algorithms
    • Magnanti T.L., Wong R.T. Network design and transportation planning: models and algorithms. Transportation Science 1984, 18:1-55.
    • (1984) Transportation Science , vol.18 , pp. 1-55
    • Magnanti, T.L.1    Wong, R.T.2
  • 42
    • 64149118033 scopus 로고    scopus 로고
    • Urban rapid transit network design: accelerated benders decomposition
    • Marín A.G., Jaramillo P. Urban rapid transit network design: accelerated benders decomposition. Annals of Operational Research 2009, 169:35-53.
    • (2009) Annals of Operational Research , vol.169 , pp. 35-53
    • Marín, A.G.1    Jaramillo, P.2
  • 44
    • 58549112577 scopus 로고    scopus 로고
    • A route set construction algorithm for the transit network design problem
    • Mauttone A., Urquhart M.E. A route set construction algorithm for the transit network design problem. Computers & Operations Research 2009, 36:2440-2449.
    • (2009) Computers & Operations Research , vol.36 , pp. 2440-2449
    • Mauttone, A.1    Urquhart, M.E.2
  • 45
    • 0018432957 scopus 로고
    • Some issue relating to the optimal design of bus lines
    • Newell G. Some issue relating to the optimal design of bus lines. Transportation Science 1979, 13(1):20-35.
    • (1979) Transportation Science , vol.13 , Issue.1 , pp. 20-35
    • Newell, G.1
  • 47
    • 0031998314 scopus 로고    scopus 로고
    • Implicit enumeration of hyperpaths in a logit model for transit network
    • Nguyen S., Pallottino S., Gendreau M. Implicit enumeration of hyperpaths in a logit model for transit network. Transportation Science 1998, 32(1):54-64.
    • (1998) Transportation Science , vol.32 , Issue.1 , pp. 54-64
    • Nguyen, S.1    Pallottino, S.2    Gendreau, M.3
  • 48
    • 85173151585 scopus 로고    scopus 로고
    • Boarding and alighting in frequency-based transit assignment
    • Paper Presented at the 88th Annual Transportation Research Board Meeting, Washington, DC, January 2009.
    • Nökel, K., Wekeck, S., 2009. Boarding and alighting in frequency-based transit assignment. Paper Presented at the 88th Annual Transportation Research Board Meeting, Washington, DC, January 2009.
    • (2009)
    • Nökel, K.1    Wekeck, S.2
  • 49
    • 84888775295 scopus 로고    scopus 로고
    • The schedule-based approach in dynamic transit modelling: a general overview
    • Kluwer Academic, Dordrecht, N.H.M. Wilson, A. Nuzzolo (Eds.)
    • Nuzzolo A., Crisalli U. The schedule-based approach in dynamic transit modelling: a general overview. Schedule-based Dynamic Transit Modeling. Theory and Applications 2004, 1-24. Kluwer Academic, Dordrecht. N.H.M. Wilson, A. Nuzzolo (Eds.).
    • (2004) Schedule-based Dynamic Transit Modeling. Theory and Applications , pp. 1-24
    • Nuzzolo, A.1    Crisalli, U.2
  • 51
    • 34548264104 scopus 로고    scopus 로고
    • A new computational model for the design of an urban inter-modal public transit network
    • Peng S., Fan H.S.L. A new computational model for the design of an urban inter-modal public transit network. Computer-Aided Civil and Infrastructure Engineering 2007, 22:499-510.
    • (2007) Computer-Aided Civil and Infrastructure Engineering , vol.22 , pp. 499-510
    • Peng, S.1    Fan, H.S.L.2
  • 52
  • 53
    • 0019045411 scopus 로고
    • Scheduling bus systems with interchanges
    • Salzborn F.J.M. Scheduling bus systems with interchanges. Transportation Science 1980, 14(3):211-220.
    • (1980) Transportation Science , vol.14 , Issue.3 , pp. 211-220
    • Salzborn, F.J.M.1
  • 54
    • 34247543285 scopus 로고    scopus 로고
    • Line planning with minimal traveling time
    • Proceedings of 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2005, Palma de Mallorca, Spain.
    • Schoebel, A., Scholl, S., 2005. Line planning with minimal traveling time. In: Proceedings of 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2005, Palma de Mallorca, Spain.
    • (2005)
    • Schoebel, A.1    Scholl, S.2
  • 55
    • 0028446271 scopus 로고
    • Genetic algorithms: a survey
    • Srinivas M., Patnaik L.M. Genetic algorithms: a survey. Computer 1994, 27(6):17-26.
    • (1994) Computer , vol.27 , Issue.6 , pp. 17-26
    • Srinivas, M.1    Patnaik, L.M.2
  • 56
    • 0037334662 scopus 로고    scopus 로고
    • Transit route network design using frequency coded genetic algorithm
    • Tom V.M., Mohan S. Transit route network design using frequency coded genetic algorithm. Journal of Transportation Engineering 2003, 129(2):186-195.
    • (2003) Journal of Transportation Engineering , vol.129 , Issue.2 , pp. 186-195
    • Tom, V.M.1    Mohan, S.2
  • 59
    • 77955602998 scopus 로고    scopus 로고
    • Genetic algorithm for bus frequency optimization
    • Yu B., Yang Z., Yao J. Genetic algorithm for bus frequency optimization. Journal of Transportation Engineering 2010, 136(6):576-583.
    • (2010) Journal of Transportation Engineering , vol.136 , Issue.6 , pp. 576-583
    • Yu, B.1    Yang, Z.2    Yao, J.3
  • 60
    • 34249987921 scopus 로고    scopus 로고
    • A mixed integer formulation for multiple-route transit network design
    • Wan Q.K., Lo H.K. A mixed integer formulation for multiple-route transit network design. Journal of Mathematical Modelling and Algorithms 2003, 2(4):299-308.
    • (2003) Journal of Mathematical Modelling and Algorithms , vol.2 , Issue.4 , pp. 299-308
    • Wan, Q.K.1    Lo, H.K.2
  • 61
    • 35349027617 scopus 로고    scopus 로고
    • Large-scale transit network optimization by minimizing user cost and transfers
    • Zhao F. Large-scale transit network optimization by minimizing user cost and transfers. Journal of Public Transportation 2006, 9(2):107-129.
    • (2006) Journal of Public Transportation , vol.9 , Issue.2 , pp. 107-129
    • Zhao, F.1
  • 62
    • 35348963536 scopus 로고    scopus 로고
    • Optimization of transit route network, vehicle headways and timetables for large-scale transit network
    • Zhao F., Zeng X. Optimization of transit route network, vehicle headways and timetables for large-scale transit network. European Journal of Operational Research 2008, 186:841-855.
    • (2008) European Journal of Operational Research , vol.186 , pp. 841-855
    • Zhao, F.1    Zeng, X.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.