메뉴 건너뛰기




Volumn 16, Issue 3, 2010, Pages 353-372

A metaheuristic approach to the urban transit routing problem

Author keywords

Hill climbing; Simulated annealing; Urban transit routing

Indexed keywords

BENCH-MARK PROBLEMS; CHOSEN REPRESENTATION; CONSTRAINED PROBLEM; HILL-CLIMBING; META HEURISTIC ALGORITHM; META-HEURISTIC APPROACH; NEIGHBOURHOOD; NP-HARD; POTENTIAL SOLUTIONS; PROBLEM DIFFICULTY; PROBLEM INSTANCES; PUBLIC TRANSPORT SYSTEMS; SIMPLE METHOD; SIMPLE MODEL; SIMULATED ANNEALING ALGORITHMS; URBAN TRANSIT;

EID: 77952241315     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-008-9089-8     Document Type: Conference Paper
Times cited : (89)

References (24)
  • 1
    • 16444380029 scopus 로고    scopus 로고
    • Transit route network design using parallel genetic algorithm
    • Agrawal, J., Mathew, T.V.: Transit route network design using parallel genetic algorithm. J. Comput. Civil Eng., 248-256 (2004)
    • (2004) J. Comput. Civil Eng. , pp. 248-256
    • Agrawal, J.1    Mathew, T.V.2
  • 2
    • 0026174743 scopus 로고
    • An AI-based approach for transit route system planning and design
    • 10.1002/atr.5670250205
    • M.H. Baaj H. Mahmassani 1991 An AI-based approach for transit route system planning and design J. Adv. Transp. 25 2 187 210 10.1002/atr.5670250205
    • (1991) J. Adv. Transp. , vol.25 , Issue.2 , pp. 187-210
    • Baaj, M.H.1    Mahmassani, H.2
  • 3
    • 0028866030 scopus 로고
    • Hybrid route generation heuristic algorithm for the design of transit networks
    • 10.1016/0968-090X(94)00011-S
    • M.H. Baaj H.S. Mahmassani 1995 Hybrid route generation heuristic algorithm for the design of transit networks Transp. Res. 3 1 31 50 10.1016/0968-090X(94)00011-S
    • (1995) Transp. Res. , vol.3 , Issue.1 , pp. 31-50
    • Baaj, M.H.1    Mahmassani, H.S.2
  • 4
    • 7744221127 scopus 로고    scopus 로고
    • The demand for public transport: A practical guide
    • TRL Limited, UK
    • Balcombe, R.: The demand for public transport: a practical guide. TRL Report, TRL Limited, UK (2004)
    • (2004) TRL Report
    • Balcombe, R.1
  • 6
    • 0036034152 scopus 로고    scopus 로고
    • Optimal route network design for transit systems using genetic algorithms
    • DOI 10.1080/03052150210909
    • P. Chakroborty T. Dwivedi 2002 Optimal route network design for transit systems using genetic algorithms Eng. Optim. 34 1 83 100 10.1080/03052150210909 (Pubitemid 35262618)
    • (2002) Engineering Optimization , vol.34 , Issue.1 , pp. 83-100
    • Chakroborty, P.1    Dwivedi, T.2
  • 7
    • 0038710810 scopus 로고    scopus 로고
    • Genetic algorithms for optimal urban transit network design
    • 10.1111/1467-8667.00309
    • P. Chakroborty 2003 Genetic algorithms for optimal urban transit network design Comput. Aided Civil Infrastruct. Eng. 18 184 200 10.1111/1467-8667.00309
    • (2003) Comput. Aided Civil Infrastruct. Eng. , vol.18 , pp. 184-200
    • Chakroborty, P.1
  • 8
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • 0092.16002 10.1007/BF01386390 107609
    • E.W. Dijkstra 1959 A note on two problems in connexion with graphs Numer. Math. 1 269 271 0092.16002 10.1007/BF01386390 107609
    • (1959) Numer. Math. , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 9
    • 84871630672 scopus 로고    scopus 로고
    • Design and planning guidelines for public transport infrastructure-bus route planning and transit streets
    • Auth.
    • Emerson, B.: Design and planning guidelines for public transport infrastructure-bus route planning and transit streets. Public Transp. Auth. (2003)
    • (2003) Public Transp
    • Emerson, B.1
  • 12
    • 31044433064 scopus 로고    scopus 로고
    • Using a simulated annealing algorithm to solve the transit route network design problem
    • DOI 10.1061/(ASCE)0733-947X(2006)132:2(122)
    • Fan, W., Machemehl, R.B.: Using a simulated annealing algorithm to solve the transit route network design problem. J. Transp. Eng. 122-132 (2006) (Pubitemid 43119042)
    • (2006) Journal of Transportation Engineering , vol.132 , Issue.2 , pp. 122-132
    • Fan, W.1    Machemehl, R.B.2
  • 13
    • 84945709831 scopus 로고
    • Algorithm 97: Shortest path
    • 10.1145/367766.368168
    • R.W. Floyd 1962 Algorithm 97: shortest path Commun. ACM 5 6 345 10.1145/367766.368168
    • (1962) Commun. ACM , vol.5 , Issue.6 , pp. 345
    • Floyd, R.W.1
  • 16
    • 0000838264 scopus 로고
    • The design of routes, service frequencies and schedules for a municipal bus undertaking: A case study
    • 10.2307/3007688
    • W. Lampkin P.D. Saalmans 1967 The design of routes, service frequencies and schedules for a municipal bus undertaking: a case study OR Quarterly 18 375 397 10.2307/3007688
    • (1967) OR Quarterly , vol.18 , pp. 375-397
    • Lampkin, W.1    Saalmans, P.D.2
  • 18
    • 0037930074 scopus 로고
    • Evaluation and optimization of urban public transport networks
    • Amsterdam, Netherlands
    • Mandl, C.E.: Evaluation and optimization of urban public transport networks. In: Third Congress on Operations Research, Amsterdam, Netherlands (1979)
    • (1979) Third Congress on Operations Research
    • Mandl, C.E.1
  • 19
    • 0019172125 scopus 로고
    • Evaluation and optimization of urban public transportation networks
    • DOI 10.1016/0377-2217(80)90126-5
    • C.E. Mandl 1980 Evaluation and optimization of urban public transport networks Eur. J. Oper. Res. 5 396 404 0441.90030 10.1016/0377-2217(80)90126-5 592511 (Pubitemid 11454509)
    • (1980) European Journal of Operational Research , vol.5 , Issue.6 , pp. 396-404
    • Mandl, C.E.1
  • 20
    • 0032126986 scopus 로고    scopus 로고
    • Urban bus transit route network design using genetic algorithm
    • Pattnaik, S.B., Mohan, S., Tom, V.M.: Urban bus transit route network design using genetic algorithm. J. Transp. Eng. 368-375 (1998)
    • (1998) J. Transp. Eng. , pp. 368-375
    • Pattnaik, S.B.1    Mohan, S.2    Tom, V.M.3
  • 21
    • 0000463992 scopus 로고
    • Planning the route system for urban buses
    • 10.1016/0305-0548(74)90046-X
    • L. Simman Z. Barzily U. Passy 1974 Planning the route system for urban buses Comput. Oper. Res. 1 201 211 10.1016/0305-0548(74)90046-X
    • (1974) Comput. Oper. Res. , vol.1 , pp. 201-211
    • Simman, L.1    Barzily, Z.2    Passy, U.3
  • 22
    • 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. J. Transp. Eng. 186-195 (2003)
    • (2003) J. Transp. Eng. , pp. 186-195
    • Tom, V.M.1    Mohan, S.2
  • 24
    • 33645524746 scopus 로고    scopus 로고
    • Optimization of transit network to minimize transfers
    • Lehman Center for Transportation Research, Florida International University
    • Zhao, F., Gan, A.: Optimization of transit network to minimize transfers. Final Report, Lehman Center for Transportation Research, Florida International University (2003)
    • (2003) Final Report
    • Zhao, F.1    Gan, A.2


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