메뉴 건너뛰기




Volumn 76, Issue 762, 2010, Pages 397-406

Rolling stock planning for passenger trains based on ant colony optimization

Author keywords

Ant colony optimization; Maintenance scheduling; Operational planning; Rolling stock planning; Swarm intelligence

Indexed keywords

ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; NUMERICAL METHODS; PASSENGER CARS; RAILROAD ROLLING STOCK; RAILROADS; SCHEDULING; SWARM INTELLIGENCE; TRANSPORTATION; TRUCK TRANSPORTATION;

EID: 77952273516     PISSN: 03875024     EISSN: None     Source Type: Journal    
DOI: 10.1299/kikaic.76.397     Document Type: Article
Times cited : (4)

References (17)
  • 1
    • 77952263181 scopus 로고
    • Rolling stock planning in railway
    • (in Japanese)
    • Ida, O., Rolling stock planning in railway. Operations research as a management science research, Vol.38, No.8, (1993), pp.404-408 (in Japanese).
    • (1993) Operations Research As A Management Science Research , vol.38 , Issue.8 , pp. 404-408
    • Ida, O.1
  • 6
    • 77649278016 scopus 로고    scopus 로고
    • Planning Systems Laboratory, Railway Technical Research Institute, NTS Inc.
    • Planning Systems Laboratory, Railway Technical Research Institute, Scheduling Algorithms in Railways, (2005), NTS Inc.
    • (2005) Scheduling Algorithms in Railways
  • 7
    • 77952247191 scopus 로고
    • Automation for train-set scheduling
    • (in Japanese)
    • lida, Y. and Okawa, M., Automation for Train-set Scheduling, Railway Technical Research Report, Vol.36, No.8, (1978). pp.311-318 (in Japanese).
    • (1978) Railway Technical Research Report , vol.36 , Issue.8 , pp. 311-318
    • Lida, Y.1    Okawa, M.2
  • 8
    • 77952270115 scopus 로고
    • A planning method for usage of vehicles using the optimal assignment algorithm
    • Abe, K. and Komaya, K., A Planning Method for Usage of Vehicles using the Optimal Assignment Algorithm, Transactions of IEE Japan, Series C, Vol.107, No.10, (1987),pp.939-946.
    • (1987) Transactions of IEE Japan, Series C , vol.107 , Issue.10 , pp. 939-946
    • Abe, K.1    Komaya, K.2
  • 9
    • 77952283447 scopus 로고
    • Solving train assignment problem by simulated annealing
    • Tsuchiya, R. and Osada, H., Solving Train Assignment Problem by Simulated Annealing, Information Processing Society of Japan (IPSJ), Vol.93, No.69, (1993), pp.125132.
    • (1993) Information Processing Society of Japan (IPSJ) , vol.93 , Issue.69 , pp. 125132
    • Tsuchiya, R.1    Osada, H.2
  • 10
    • 77952264728 scopus 로고    scopus 로고
    • Genetic algorithm based on neighborhood operation of hamilton cycle and it's application to train scheduling problems
    • Satou, T. and Sasaki, T., Genetic Algorithm based on Neighborhood Operation of Hamilton Cycle and It's Application to Train Scheduling Problems, Proc. of the . 59th National Meeting of Information Processing Society of Japan, Vol.2, (1999-9), pp.165-166.
    • (1999) Proc. of The. 59th National Meeting of Information Processing Society of Japan , vol.2 , pp. 165-166
    • Satou, T.1    Sasaki, T.2
  • 12
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • PII S1089778X97033031
    • Dorigo, M. and Gambardella, L. M., Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, Vol.1, No.1, (1997), pp.53-66. (Pubitemid 127771018)
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 15
  • 16


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