메뉴 건너뛰기




Volumn 36, Issue 8, 2009, Pages 2440-2449

A route set construction algorithm for the transit network design problem

Author keywords

Constructive algorithm; Demand covering constraints; Heuristic; Transit network design problem

Indexed keywords

ALGORITHMS; BUS TRANSPORTATION; DESIGN; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MASS TRANSPORTATION; MULTIOBJECTIVE OPTIMIZATION; PLANNING; STRATEGIC PLANNING; TRANSPORTATION ROUTES;

EID: 58549112577     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.09.014     Document Type: Article
Times cited : (112)

References (33)
  • 3
    • 0026174743 scopus 로고
    • An AI-based approach for transit route system planning and design
    • Baaj M.H., and Mahmassani H. An AI-based approach for transit route system planning and design. Journal of Advanced Transportation 25 2 (1991) 187-210
    • (1991) Journal of Advanced Transportation , vol.25 , Issue.2 , pp. 187-210
    • Baaj, M.H.1    Mahmassani, H.2
  • 4
    • 58549116841 scopus 로고    scopus 로고
    • Fan W, Machemehl R. A Tabu search based heuristic method for the transit route network design problem. In: 9th international conference on computer aided scheduling of public transport, San Diego, United States, 2004.
    • Fan W, Machemehl R. A Tabu search based heuristic method for the transit route network design problem. In: 9th international conference on computer aided scheduling of public transport, San Diego, United States, 2004.
  • 6
    • 0141566265 scopus 로고    scopus 로고
    • Optimal time transfer in bus transit route network design using a genetic algorithm
    • Ngamchai S., and Lovell D. Optimal time transfer in bus transit route network design using a genetic algorithm. Journal of Transportation Engineering 129 5 (2003) 510-521
    • (2003) Journal of Transportation Engineering , vol.129 , Issue.5 , pp. 510-521
    • Ngamchai, S.1    Lovell, D.2
  • 7
    • 58549108351 scopus 로고    scopus 로고
    • Fan W, Machemehl R. Optimal transit route network design problem: algorithms, implementations, and numerical results. Technical Report 167244-1, University of Texas at Austin, United States; 2004.
    • Fan W, Machemehl R. Optimal transit route network design problem: algorithms, implementations, and numerical results. Technical Report 167244-1, University of Texas at Austin, United States; 2004.
  • 8
    • 58549086902 scopus 로고    scopus 로고
    • Hasselström D. Public transportation planning-a mathematical programming approach. Doctoral dissertation, University of Göteborg, Sweden; 1981.
    • Hasselström D. Public transportation planning-a mathematical programming approach. Doctoral dissertation, University of Göteborg, Sweden; 1981.
  • 10
    • 34247521369 scopus 로고    scopus 로고
    • A column-generation approach to line planning in public transport
    • Borndörfer R., Grötschel M., and Pfetsch M. A column-generation approach to line planning in public transport. Transportation Science 41 1 (2007) 123-132
    • (2007) Transportation Science , vol.41 , Issue.1 , pp. 123-132
    • Borndörfer, R.1    Grötschel, M.2    Pfetsch, M.3
  • 11
    • 0032154374 scopus 로고    scopus 로고
    • Planning and design model for transit route networks with coordinated operations
    • Shih M.C., Mahmassani H., and Baaj M.H. Planning and design model for transit route networks with coordinated operations. Transportation Research Record 1623 (1998) 16-23
    • (1998) Transportation Research Record , vol.1623 , pp. 16-23
    • Shih, M.C.1    Mahmassani, H.2    Baaj, M.H.3
  • 12
    • 33645517858 scopus 로고    scopus 로고
    • Optimization of transit network to minimize transfers and optimize route directness
    • Zhao F., and Ubaka I. Optimization of transit network to minimize transfers and optimize route directness. Journal of Public Transportation 7 1 (2004) 63-82
    • (2004) Journal of Public Transportation , vol.7 , Issue.1 , pp. 63-82
    • Zhao, F.1    Ubaka, I.2
  • 14
    • 0028866030 scopus 로고
    • Hybrid route generation heuristic algorithm for the design of transit networks
    • Baaj M.H., and Mahmassani H. Hybrid route generation heuristic algorithm for the design of transit networks. Transportation Research C 3 1 (1995) 31-50
    • (1995) Transportation Research C , vol.3 , Issue.1 , pp. 31-50
    • Baaj, M.H.1    Mahmassani, H.2
  • 15
    • 58549100205 scopus 로고    scopus 로고
    • Mauttone A, Urquhart ME. A multi-objective metaheuristic approach for the transit network design problem. In: 10th international conference on computer aided scheduling of public transport, Leeds, United Kingdom, 2006.
    • Mauttone A, Urquhart ME. A multi-objective metaheuristic approach for the transit network design problem. In: 10th international conference on computer aided scheduling of public transport, Leeds, United Kingdom, 2006.
  • 17
    • 0037334662 scopus 로고    scopus 로고
    • Transit route network design using frequency coded Genetic Algorithm
    • Tom V.M., and Mohan S. Transit route network design using frequency coded Genetic Algorithm. Journal of Transportation Engineering 129 2 (2003) 186-195
    • (2003) Journal of Transportation Engineering , vol.129 , Issue.2 , pp. 186-195
    • Tom, V.M.1    Mohan, S.2
  • 19
    • 34249987921 scopus 로고    scopus 로고
    • A mixed integer formulation for multiple-route transit network design
    • Wan Q., and Lo H. A mixed integer formulation for multiple-route transit network design. Journal of Mathematical Modelling and Algorithms 2 4 (2003) 299-308
    • (2003) Journal of Mathematical Modelling and Algorithms , vol.2 , Issue.4 , pp. 299-308
    • Wan, Q.1    Lo, H.2
  • 20
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, Dordrecht
    • Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Dordrecht
    • (1997) Tabu search
    • Glover, F.1    Laguna, M.2
  • 22
  • 23
    • 58549086681 scopus 로고    scopus 로고
    • Krishna Rao KV, Muralidhar S, Dhingra SL. Public transport routing and scheduling using Genetic Algorithms. In: 8th international conference on computer aided scheduling of public transport, Berlin, Germany, 2000.
    • Krishna Rao KV, Muralidhar S, Dhingra SL. Public transport routing and scheduling using Genetic Algorithms. In: 8th international conference on computer aided scheduling of public transport, Berlin, Germany, 2000.
  • 24
    • 31044433064 scopus 로고    scopus 로고
    • Using a simulated annealing algorithm to solve the transit route network design problem
    • Fan W., and Machemehl R. Using a simulated annealing algorithm to solve the transit route network design problem. Journal of Transportation Engineering 132 2 (2006) 122-132
    • (2006) Journal of Transportation Engineering , vol.132 , Issue.2 , pp. 122-132
    • Fan, W.1    Machemehl, R.2
  • 26
    • 0000049494 scopus 로고
    • Greedy randomized adaptive search procedures
    • Feo T., and Resende M. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
    • (1995) Journal of Global Optimization , vol.6 , pp. 109-133
    • Feo, T.1    Resende, M.2
  • 27
    • 0000663732 scopus 로고
    • Finding the k shortest loopless paths in a network
    • Yen J.Y. Finding the k shortest loopless paths in a network. Management Science 17 (1971) 712-716
    • (1971) Management Science , vol.17 , pp. 712-716
    • Yen, J.Y.1
  • 28
    • 0012587086 scopus 로고    scopus 로고
    • Greedy randomized adaptive search procedures
    • Glover F., and Kochenberger G. (Eds), Kluwer Academic Publishers, Dordrecht
    • Resende M., and Ribeiro C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G. (Eds). Handbook of metaheuristics (2003), Kluwer Academic Publishers, Dordrecht 219-249
    • (2003) Handbook of metaheuristics , pp. 219-249
    • Resende, M.1    Ribeiro, C.2
  • 31
    • 58549104495 scopus 로고    scopus 로고
    • Mauttone A, Urquhart ME. Una heurística basada en memoria para el problema del diseño de recorridos en transporte público urbano. In: XIII Congreso Latino Iberoamericano de Investigación Operativa, Montevideo, Uruguay, 2006.
    • Mauttone A, Urquhart ME. Una heurística basada en memoria para el problema del diseño de recorridos en transporte público urbano. In: XIII Congreso Latino Iberoamericano de Investigación Operativa, Montevideo, Uruguay, 2006.
  • 32
    • 58549107114 scopus 로고    scopus 로고
    • Mauttone A. Optimización de recorridos y frecuencias en sistemas de transporte público urbano colectivo. Master thesis in computer science, Universidad de la República, Uruguay; 2005.
    • Mauttone A. Optimización de recorridos y frecuencias en sistemas de transporte público urbano colectivo. Master thesis in computer science, Universidad de la República, Uruguay; 2005.


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