메뉴 건너뛰기




Volumn 6, Issue 2, 2012, Pages 124-131

Implications of the computational complexity of transit route network redesign for metaheuristic optimisation systems

Author keywords

[No Author keywords available]

Indexed keywords

BUS ROUTE; CURRENT LEVELS; HEURISTIC TECHNIQUES; LOWER FREQUENCIES; META-HEURISTIC OPTIMISATION; METAHEURISTIC; MUMBAI , INDIA; OPTIMISATIONS; ROUTE NETWORKS; TRANSIT NETWORKS; TRANSIT ROUTE NETWORKS; TRANSIT USERS;

EID: 84866863844     PISSN: 1751956X     EISSN: None     Source Type: Journal    
DOI: 10.1049/iet-its.2011.0021     Document Type: Article
Times cited : (11)

References (20)
  • 1
    • 0022925141 scopus 로고
    • Bus network design
    • 10.1016/0191-2615(86)90047-0
    • Ceder, A., and Wilson, N.H.M.: ' Bus network design ', Transp. Res. B, 1986, 20, p. 331-344 10.1016/0191-2615(86)90047-0
    • (1986) Transp. Res. B , vol.20 , pp. 331-344
    • Ceder, A.1    Wilson, N.H.M.2
  • 2
    • 16444380029 scopus 로고    scopus 로고
    • Transit route network design using a parallel genetic algorithm
    • 10.1061/(ASCE)0887-3801(2004)18:3(248)
    • Agrawal, J., and Mathew, T.: ' Transit route network design using a parallel genetic algorithm ', J. Comput. Civil Eng., 2004, 18, p. 248-256 10.1061/(ASCE)0887-3801(2004)18:3(248)
    • (2004) J. Comput. Civil Eng. , vol.18 , pp. 248-256
    • Agrawal, J.1    Mathew, T.2
  • 3
    • 37749027566 scopus 로고    scopus 로고
    • Bus transit route network design using genetic algorithm
    • Lui, H., and Yang, X.: ' Bus transit route network design using genetic algorithm ', Int. Conf. on Transportation Engineering, 2007, p. 1135-1141
    • (2007) Int. Conf. on Transportation Engineering , pp. 1135-1141
    • Lui, H.1    Yang, X.2
  • 4
    • 33645530240 scopus 로고    scopus 로고
    • Simulated annealing-genetic algorithm for transit network optimization
    • 10.1061/(ASCE)0887-3801(2006)20:1(57)
    • Zhao, F., and Zeng, X.: ' Simulated annealing-genetic algorithm for transit network optimization ', J. Comput. Civil Eng., 2006, 20, (1), p. 57-68 10.1061/(ASCE)0887-3801(2006)20:1(57)
    • (2006) J. Comput. Civil Eng. , vol.20 , Issue.1 , pp. 57-68
    • Zhao, F.1    Zeng, X.2
  • 5
    • 31044433064 scopus 로고    scopus 로고
    • Using a simulated annealing algorithm to solve the transit route network design problem
    • 10.1061/(ASCE)0733-947X(2006)132:2(122) 0733-947X
    • Fan, W., and Machemehl, R.B.: ' Using a simulated annealing algorithm to solve the transit route network design problem ', J. Transp. Eng., 2006, 132, p. 122-132 10.1061/(ASCE)0733-947X(2006)132:2(122) 0733-947X
    • (2006) J. Transp. Eng. , vol.132 , pp. 122-132
    • Fan, W.1    MacHemehl, R.B.2
  • 6
    • 37749052712 scopus 로고    scopus 로고
    • Urban transit route network design problem using tabu search algorithm
    • Lei, D., and Yan, X.: ' Urban transit route network design problem using tabu search algorithm ', Int. Conf. on Transportation Engineering, 2007, p. 3929-3934
    • (2007) Int. Conf. on Transportation Engineering , pp. 3929-3934
    • Lei, D.1    Yan, X.2
  • 7
    • 80052805519 scopus 로고    scopus 로고
    • Intelligent agent optimization of urban bus transit system design
    • 10.1061/(ASCE)CP.1943-5487.0000095
    • Blum, J., and Mathew, T.: ' Intelligent agent optimization of urban bus transit system design ', J. Comput. Civil Eng., 2011, 25, (5), p. 357-369 10.1061/(ASCE)CP.1943-5487.0000095
    • (2011) J. Comput. Civil Eng. , vol.25 , Issue.5 , pp. 357-369
    • Blum, J.1    Mathew, T.2
  • 8
    • 0019172125 scopus 로고
    • Evaluation and optimization of urban public transportation networks
    • 10.1016/0377-2217(80)90126-5 0377-2217
    • Mandl, C.E.: ' Evaluation and optimization of urban public transportation networks ', Eur. J. Oper. Res., 1980, 5, p. 396-404 10.1016/0377-2217(80)90126- 5 0377-2217
    • (1980) Eur. J. Oper. Res. , vol.5 , pp. 396-404
    • Mandl, C.E.1
  • 9
    • 0028866030 scopus 로고
    • Hybrid route generation heuristic algorithm for the design of transit networks
    • 10.1016/0968-090X(94)00011-S
    • Baaj, M.H., and Mahmassani, H.S.: ' Hybrid route generation heuristic algorithm for the design of transit networks ', Transp. Res. C, 1995, 3, p. 31-50 10.1016/0968-090X(94)00011-S
    • (1995) Transp. Res. C , vol.3 , pp. 31-50
    • Baaj, M.H.1    Mahmassani, H.S.2
  • 10
    • 0032154374 scopus 로고    scopus 로고
    • Planning and design model for transit route networks with coordinated operations
    • 10.3141/1623-03
    • Shih, M.-C., Mahmassani, H.S., and Baaj, M.H.: ' Planning and design model for transit route networks with coordinated operations ', Transp. Res. Rec., 1998, 1623, p. 16-23 10.3141/1623-03
    • (1998) Transp. Res. Rec. , vol.1623 , pp. 16-23
    • Shih, M.-C.1    Mahmassani, H.S.2    Baaj, M.H.3
  • 12
    • 33645517858 scopus 로고    scopus 로고
    • Transit network optimization: Minimizing transfers and optimizing route directness
    • Zhao, F., and Ubaka, I.: ' Transit network optimization: minimizing transfers and optimizing route directness ', J. Publ. Transp., 2004, 7, (1), p. 63-81
    • (2004) J. Publ. Transp. , vol.7 , Issue.1 , pp. 63-81
    • Zhao, F.1    Ubaka, I.2
  • 13
    • 31144461825 scopus 로고    scopus 로고
    • Optimal transit route network design problem with variable transit demand: Genetic algorithm approach
    • 10.1061/(ASCE)0733-947X(2006)132:1(40) 0733-947X
    • Fan, W., and Machemehl, R.B.: ' Optimal transit route network design problem with variable transit demand: genetic algorithm approach ', J. Transp. Eng., 2006, 132, p. 40-51 10.1061/(ASCE)0733-947X(2006)132:1(40) 0733-947X
    • (2006) J. Transp. Eng. , vol.132 , pp. 40-51
    • Fan, W.1    MacHemehl, R.B.2
  • 14
    • 0032126986 scopus 로고    scopus 로고
    • Urban bus transit route network design using genetic algorithms
    • 10.1061/(ASCE)0733-947X(1998)124:4(368) 0733-947X
    • Pattnaik, S.B., Mohan, S., and Tom, V.M.: ' Urban bus transit route network design using genetic algorithms ', J. Transp. Eng., 1998, 124, p. 368-375 10.1061/(ASCE)0733-947X(1998)124:4(368) 0733-947X
    • (1998) J. Transp. Eng. , vol.124 , pp. 368-375
    • Pattnaik, S.B.1    Mohan, S.2    Tom, V.M.3
  • 15
    • 0036462728 scopus 로고    scopus 로고
    • Genetic algorithms in bus network optimization
    • 10.1016/S0968-090X(00)00048-6
    • Bielli, M., Caramia, M., and Carotenuto, P.: ' Genetic algorithms in bus network optimization ', Transp. Res. C, 2002, 10, p. 19-34 10.1016/S0968- 090X(00)00048-6
    • (2002) Transp. Res. C , vol.10 , pp. 19-34
    • Bielli, M.1    Caramia, M.2    Carotenuto, P.3
  • 18
    • 0035340928 scopus 로고    scopus 로고
    • A genetic algorithm approach for transit route planning and design
    • 10.1061/(ASCE)0733-947X(2001)127:3(200) 0733-947X
    • Chien, S., Yang, Z., and Hou, E.: ' A genetic algorithm approach for transit route planning and design ', J. Transp. Eng., 2001, 127, p. 200-207 10.1061/(ASCE)0733-947X(2001)127:3(200) 0733-947X
    • (2001) J. Transp. Eng. , vol.127 , pp. 200-207
    • Chien, S.1    Yang, Z.2    Hou, E.3
  • 19
    • 0141566265 scopus 로고    scopus 로고
    • Optimal time transfer in bus transit route network design using a genetic algorithm
    • 10.1061/(ASCE)0733-947X(2003)129:5(510) 0733-947X
    • Ngamchai, S., and Lovell, D.J.: ' Optimal time transfer in bus transit route network design using a genetic algorithm ', J. Transp. Eng., 2003, 129, p. 510-521 10.1061/(ASCE)0733-947X(2003)129:5(510) 0733-947X
    • (2003) J. Transp. Eng. , vol.129 , pp. 510-521
    • Ngamchai, S.1    Lovell, D.J.2
  • 20
    • 78751676472 scopus 로고    scopus 로고
    • Origin-destination matrix generation from boarding-alighting and household survey data, transportation research record
    • 10.3141/2183-01
    • Blum, J.J., Sridhar, A., and Mathew, T.V.: ' Origin-destination matrix generation from boarding-alighting and household survey data, transportation research record ', J. Transp. Res. Board, 2010, 2183, p. 1-8 10.3141/2183-01
    • (2010) J. Transp. Res. Board , vol.2183 , pp. 1-8
    • Blum, J.J.1    Sridhar, A.2    Mathew, T.V.3


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