메뉴 건너뛰기




Volumn 600, Issue , 2008, Pages 387-408

A tabu search based heuristic method for the transit route network design problem

Author keywords

[No Author keywords available]

Indexed keywords


EID: 53749097202     PISSN: 00758442     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-73312-6_20     Document Type: Conference Paper
Times cited : (28)

References (15)
  • 2
    • 0343288297 scopus 로고
    • Artificial intelligence-based system representation and search procedures for transit route network design. Transportation Research Record 1358
    • Baaj, M. H. and Mahmassani, H. S. (1992). Artificial intelligence-based system representation and search procedures for transit route network design. Transportation Research Record 1358, Transportation Research Board, pages 67-70.
    • (1992) Transportation Research Board , pp. 67-70
    • Baaj, M.H.1    Mahmassani, H.S.2
  • 4
    • 0035340928 scopus 로고    scopus 로고
    • A genetic algorithm approach for transit route planning and design
    • Chien, S., Yang, Z., and Hou, E. (2001). A genetic algorithm approach for transit route planning and design. Journal of Transportation Engineering, ASCE, 127(3), 200-207.
    • (2001) Journal of Transportation Engineering, ASCE , vol.127 , Issue.3 , pp. 200-207
    • Chien, S.1    Yang, Z.2    Hou, E.3
  • 6
    • 84989487658 scopus 로고
    • Heuristics for integer programming using surrogate constraints
    • Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156-166.
    • (1977) Decision Sciences , vol.8 , Issue.1 , pp. 156-166
    • Glover, F.1
  • 7
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 5, 533-549.
    • (1986) Computers & Operations Research , vol.5 , pp. 533-549
    • Glover, F.1
  • 11
    • 0019909687 scopus 로고
    • The allocation of buses in heavily utilized networks with overlapping routes
    • Han, A. F. and Wilson, N. (1982). The allocation of buses in heavily utilized networks with overlapping routes. Transportation Research, 16B, 221-232.
    • (1982) Transportation Research , vol.16 B , pp. 221-232
    • Han, A.F.1    Wilson, N.2
  • 12
    • 53749098606 scopus 로고    scopus 로고
    • NCHRP Synthesis of Highway Practice 69 (1980). Bus route and schedule planning guidelines. Technical report, Transportation Research Board, National Research Council, Washington, D.C.
    • NCHRP Synthesis of Highway Practice 69 (1980). Bus route and schedule planning guidelines. Technical report, Transportation Research Board, National Research Council, Washington, D.C.
  • 14
    • 3843138429 scopus 로고    scopus 로고
    • Trip assignment model for timedtransfer transit systems
    • Shih, M., Mahmassani, H. S., and Baaj, M. (1998). Trip assignment model for timedtransfer transit systems. Transportation Research Record 1571, pages 24-30.
    • (1998) Transportation Research Record , vol.1571 , pp. 24-30
    • Shih, M.1    Mahmassani, H.S.2    Baaj, M.3
  • 15
    • 0000663732 scopus 로고
    • Finding the k shortest loopless paths in a network
    • Yen, J. Y (1971). Finding the k shortest loopless paths in a network. Management Science, 17(11), 712-716.
    • (1971) Management Science , vol.17 , Issue.11 , pp. 712-716
    • Yen, J.Y.1


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