메뉴 건너뛰기




Volumn , Issue , 2007, Pages 3929-3934

Urban transit route network design problem using tabu search algorithm

Author keywords

Operator; Tabu search; Transit route network

Indexed keywords

ROUTE BREAK OPERATORS; TRANSIT ROUTE NETWORKS;

EID: 37749052712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1061/40932(246)644     Document Type: Conference Paper
Times cited : (4)

References (7)
  • 1
    • 0026174743 scopus 로고
    • An Al-based approach for transit route system planning and design
    • Baaj, M. H., and Mahmassani, H. S. (1991). "An Al-based approach for transit route system planning and design." J. Adv. Transp., 25 (2), 187-210.
    • (1991) J. Adv. Transp , vol.25 , Issue.2 , pp. 187-210
    • Baaj, M.H.1    Mahmassani, H.S.2
  • 2
    • 0032126986 scopus 로고    scopus 로고
    • Urban bus transit route network design using genetic algorithm
    • Pattnaik, S. B., Mohan, S., and Tom, V. M. (1998). "Urban bus transit route network design using genetic algorithm." J. Transp. Eng., 124 (4), 368-375.
    • (1998) J. Transp. Eng , vol.124 , Issue.4 , pp. 368-375
    • Pattnaik, S.B.1    Mohan, S.2    Tom, V.M.3
  • 3
    • 0037334662 scopus 로고    scopus 로고
    • Transit route network design using frequency coded genetic algorithm
    • Tom, V.M., and Mohan, S. (2003), "Transit route network design using frequency coded genetic algorithm." J Transp. Eng., 129 (2), 186-195
    • (2003) J Transp. Eng , vol.129 , Issue.2 , pp. 186-195
    • Tom, V.M.1    Mohan, S.2
  • 4
    • 31044433064 scopus 로고    scopus 로고
    • Using a simulated annealing algorithm to solve the transit route network design problem
    • Fan, W., and Machemehl, R.B. (2006), "Using a simulated annealing algorithm to solve the transit route network design problem." J. Transp. Eng., 132 (2), 122-132
    • (2006) J. Transp. Eng , vol.132 , Issue.2 , pp. 122-132
    • Fan, W.1    Machemehl, R.B.2
  • 5
    • 0141566265 scopus 로고    scopus 로고
    • Optimal time transfer in bus transit route network design using a genetic algorithm
    • Ngamchai, S., and Lovell, D.J. (2003), "Optimal time transfer in bus transit route network design using a genetic algorithm." J. Transp. Eng., 129 (5), 510-521
    • (2003) J. Transp. Eng , vol.129 , Issue.5 , pp. 510-521
    • Ngamchai, S.1    Lovell, D.J.2
  • 6
    • 16444380029 scopus 로고    scopus 로고
    • Transit route network design using parallel genetic algorithm
    • Agrawal, J., and Mathew, T.V. (2004), "Transit route network design using parallel genetic algorithm." J. Comput. Civ. Eng., 18 (3), 248-256
    • (2004) J. Comput. Civ. Eng , vol.18 , Issue.3 , pp. 248-256
    • Agrawal, J.1    Mathew, T.V.2
  • 7
    • 31144461825 scopus 로고    scopus 로고
    • Optimal transit route network design problem with variable demand: Genetic algorithm approach
    • Fan, W., and Machemehl, R.B. (2006), "Optimal transit route network design problem with variable demand: genetic algorithm approach." J. Transp. Eng., 132(1), 40-51
    • (2006) J. Transp. Eng , vol.132 , Issue.1 , pp. 40-51
    • Fan, W.1    Machemehl, R.B.2


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