메뉴 건너뛰기




Volumn 85, Issue , 2016, Pages 89-108

Ant colony optimization for the real-time train routing selection problem

Author keywords

Meta heuristics; Real time railway traffic management; Train scheduling and routing

Indexed keywords

ANT COLONY OPTIMIZATION; INTEGER PROGRAMMING; OPTIMIZATION; RAILROADS; SCHEDULING; TRANSPORTATION;

EID: 84956707742     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2016.01.005     Document Type: Article
Times cited : (142)

References (44)
  • 4
    • 79957501414 scopus 로고    scopus 로고
    • A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling
    • Caimi G., Chudak F., Fuchsberger M., Laumanns M., Zenklusen R. A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling. Transportation Science 2011, 45(2):212-227.
    • (2011) Transportation Science , vol.45 , Issue.2 , pp. 212-227
    • Caimi, G.1    Chudak, F.2    Fuchsberger, M.3    Laumanns, M.4    Zenklusen, R.5
  • 5
    • 84859705420 scopus 로고    scopus 로고
    • A model predictive control approach for discrete-time rescheduling in complex central railway station approach
    • Caimi G., Fuchsberger M., Laumanns M., Lüthi M. A model predictive control approach for discrete-time rescheduling in complex central railway station approach. Computers and Operations Research 2012, 39(11):2578-2593.
    • (2012) Computers and Operations Research , vol.39 , Issue.11 , pp. 2578-2593
    • Caimi, G.1    Fuchsberger, M.2    Laumanns, M.3    Lüthi, M.4
  • 6
    • 0037355373 scopus 로고    scopus 로고
    • Scheduling and platforming trains at busy complex stations
    • Carey M., Carville S. Scheduling and platforming trains at busy complex stations. Transportation Research Part A 2003, 37(3):195-224.
    • (2003) Transportation Research Part A , vol.37 , Issue.3 , pp. 195-224
    • Carey, M.1    Carville, S.2
  • 7
    • 33748683746 scopus 로고    scopus 로고
    • Scheduling trains on a network of busy complex stations
    • Carey M., Crawford I. Scheduling trains on a network of busy complex stations. Transportation Research Part B 2007, 41(2):159-178.
    • (2007) Transportation Research Part B , vol.41 , Issue.2 , pp. 159-178
    • Carey, M.1    Crawford, I.2
  • 11
    • 77956307098 scopus 로고    scopus 로고
    • Rescheduling Dense Train Traffic Over Complex Station Interlocking Areas
    • Springer Berlin Heidelberg
    • Corman F., Goverde R.M.P., D'Ariano A. Rescheduling Dense Train Traffic Over Complex Station Interlocking Areas. Lecture Notes in Computer Science 2009, vol. 5868:369-386. Springer Berlin Heidelberg.
    • (2009) Lecture Notes in Computer Science , vol.5868 , pp. 369-386
    • Corman, F.1    Goverde, R.M.P.2    D'Ariano, A.3
  • 12
    • 85027957658 scopus 로고    scopus 로고
    • A review of online dynamic models and algorithms for railway traffic management
    • Corman F., Meng L. A review of online dynamic models and algorithms for railway traffic management. IEEE Transaction on Intelligent Transportation Systems 2015, 16(3):1274-1284.
    • (2015) IEEE Transaction on Intelligent Transportation Systems , vol.16 , Issue.3 , pp. 1274-1284
    • Corman, F.1    Meng, L.2
  • 13
    • 70449635732 scopus 로고    scopus 로고
    • Reordering and local rerouting strategies to manage train traffic in real time
    • D'Ariano A., Corman C., Pacciarelli D., Pranzo M. Reordering and local rerouting strategies to manage train traffic in real time. Transportation Science 2008, 42(4):405-419.
    • (2008) Transportation Science , vol.42 , Issue.4 , pp. 405-419
    • D'Ariano, A.1    Corman, C.2    Pacciarelli, D.3    Pranzo, M.4
  • 15
    • 84942590300 scopus 로고    scopus 로고
    • Evaluating the applicability of advanced techniques for practical real-time train scheduling
    • D'Ariano A., Samà M., D'Ariano P., Pacciarelli D. Evaluating the applicability of advanced techniques for practical real-time train scheduling. Transportation Research Procedia 2014, 3:279-288.
    • (2014) Transportation Research Procedia , vol.3 , pp. 279-288
    • D'Ariano, A.1    Samà, M.2    D'Ariano, P.3    Pacciarelli, D.4
  • 16
    • 30544435688 scopus 로고    scopus 로고
    • An exact solution procedure to determine the optimal dispatching times for complex rail networks
    • Dessouky M., Lu Q., Zhao J., Leachman R. An exact solution procedure to determine the optimal dispatching times for complex rail networks. IIE Transactions 2006, 38(2):141-152.
    • (2006) IIE Transactions , vol.38 , Issue.2 , pp. 141-152
    • Dessouky, M.1    Lu, Q.2    Zhao, J.3    Leachman, R.4
  • 17
    • 1842611240 scopus 로고    scopus 로고
    • MIT Press, Massachusetts Institute of Technology, Cambridge
    • Dorigo M., Stützle T. Ant Colony Optimization 2004, MIT Press, Massachusetts Institute of Technology, Cambridge.
    • (2004) Ant Colony Optimization
    • Dorigo, M.1    Stützle, T.2
  • 18
    • 84870060742 scopus 로고    scopus 로고
    • A comparison of algorithms for minimising delay costs in disturbed railway traffic scenarios
    • Fan B., Roberts C., Weston P. A comparison of algorithms for minimising delay costs in disturbed railway traffic scenarios. Journal of Rail Transport Planning & Management 2012, 2(1-2):23-33.
    • (2012) Journal of Rail Transport Planning & Management , vol.2 , Issue.1-2 , pp. 23-33
    • Fan, B.1    Roberts, C.2    Weston, P.3
  • 19
    • 84956668751 scopus 로고    scopus 로고
    • A survey on problem models and solution approaches to rescheduling in railway networks
    • Fang W., Yang S., Yao X. A survey on problem models and solution approaches to rescheduling in railway networks. IEEE Transactions on Intelligent Transportation Systems 2015, vol. 16,. 10.1109/TITS.2015.2446985.
    • (2015) IEEE Transactions on Intelligent Transportation Systems , vol.16
    • Fang, W.1    Yang, S.2    Yao, X.3
  • 20
    • 51849167530 scopus 로고    scopus 로고
    • To wait or not to wait? The bi-criteria delay management problem in public transportation
    • Ginkel A., Schöbel A. To wait or not to wait? The bi-criteria delay management problem in public transportation. Transportation Science 2007, 41(4):527-538.
    • (2007) Transportation Science , vol.41 , Issue.4 , pp. 527-538
    • Ginkel, A.1    Schöbel, A.2
  • 24
    • 84925357763 scopus 로고    scopus 로고
    • An exact decomposition approach for the real-time train dispatching problem
    • Lamorgese L., Mannino C. An exact decomposition approach for the real-time train dispatching problem. Operations Research 2015, 63(1):48-64.
    • (2015) Operations Research , vol.63 , Issue.1 , pp. 48-64
    • Lamorgese, L.1    Mannino, C.2
  • 25
    • 62549158188 scopus 로고    scopus 로고
    • Scheduling trains as a blocking parallel-machine job shop scheduling problem
    • Liu S.Q., Kozan E. Scheduling trains as a blocking parallel-machine job shop scheduling problem. Computers and Operations Research 2009, 36(10):2840-2852.
    • (2009) Computers and Operations Research , vol.36 , Issue.10 , pp. 2840-2852
    • Liu, S.Q.1    Kozan, E.2
  • 27
    • 79960086387 scopus 로고    scopus 로고
    • Railway track allocation: models and methods
    • Lusby R.M., Larsen J., Ehrgott M., Ryan D. Railway track allocation: models and methods. OR Spectrum 2011, 33(4):843-883.
    • (2011) OR Spectrum , vol.33 , Issue.4 , pp. 843-883
    • Lusby, R.M.1    Larsen, J.2    Ehrgott, M.3    Ryan, D.4
  • 29
    • 79959808568 scopus 로고    scopus 로고
    • Robust single-track train dispatching model under a dynamic and stochastic environment: a scenario-based rolling horizon solution approach
    • Meng L., Zhou X. Robust single-track train dispatching model under a dynamic and stochastic environment: a scenario-based rolling horizon solution approach. Transportation Research Part B 2011, 45(7):1080-1102.
    • (2011) Transportation Research Part B , vol.45 , Issue.7 , pp. 1080-1102
    • Meng, L.1    Zhou, X.2
  • 30
    • 84902346437 scopus 로고    scopus 로고
    • Simultaneous train rerouting and rescheduling on an n-track network: a model reformulation with network-based cumulative flow variables
    • Meng L., Zhou X. Simultaneous train rerouting and rescheduling on an n-track network: a model reformulation with network-based cumulative flow variables. Transportation Research Part B 2014, 67(1):208-234.
    • (2014) Transportation Research Part B , vol.67 , Issue.1 , pp. 208-234
    • Meng, L.1    Zhou, X.2
  • 31
    • 79959786879 scopus 로고    scopus 로고
    • Scheduling freight trains traveling on complex networks
    • Mu S., Dessouky M. Scheduling freight trains traveling on complex networks. Transportation Research Part B 2011, 45(7):1103-1123.
    • (2011) Transportation Research Part B , vol.45 , Issue.7 , pp. 1103-1123
    • Mu, S.1    Dessouky, M.2
  • 33
    • 84889610071 scopus 로고    scopus 로고
    • Optimal train routing and scheduling for managing traffic perturbations in complex junctions
    • Pellegrini P., Marlière G., Rodriguez J. Optimal train routing and scheduling for managing traffic perturbations in complex junctions. Transportation Research Part B 2014, 59(1):58-80.
    • (2014) Transportation Research Part B , vol.59 , Issue.1 , pp. 58-80
    • Pellegrini, P.1    Marlière, G.2    Rodriguez, J.3
  • 34
    • 85029841528 scopus 로고    scopus 로고
    • SysML Open Source Specification Project, 2015. Sysml.org.
    • SysML Open Source Specification Project, 2015. Sysml.org.
  • 35
    • 33748695294 scopus 로고    scopus 로고
    • A constraint programming model for real-time train scheduling at junctions
    • Rodriguez J. A constraint programming model for real-time train scheduling at junctions. Transportation Research Part B 2007, 41(2):231-245.
    • (2007) Transportation Research Part B , vol.41 , Issue.2 , pp. 231-245
    • Rodriguez, J.1
  • 38
    • 33747339032 scopus 로고    scopus 로고
    • An ant colony optimization meta-heuristic for subset selection problems
    • Nova Science publisher
    • Solnon C., Bridge D. An ant colony optimization meta-heuristic for subset selection problems. System Engineering using Particle Swarm Optimization 2006, 7-29. Nova Science publisher.
    • (2006) System Engineering using Particle Swarm Optimization , pp. 7-29
    • Solnon, C.1    Bridge, D.2
  • 39
    • 33645681469 scopus 로고    scopus 로고
    • A study of ACO capabilities for solving the maximum clique problem
    • Solnon C., Bridge D. A study of ACO capabilities for solving the maximum clique problem. Journal of Heuristics 2006, 12(3):155-180.
    • (2006) Journal of Heuristics , vol.12 , Issue.3 , pp. 155-180
    • Solnon, C.1    Bridge, D.2
  • 41
    • 33845266135 scopus 로고    scopus 로고
    • N-tracked railway traffic re-scheduling during disturbances
    • Törnquist J., Persson J. N-tracked railway traffic re-scheduling during disturbances. Transportation Research Part B 2007, 41(3):342-362.
    • (2007) Transportation Research Part B , vol.41 , Issue.3 , pp. 342-362
    • Törnquist, J.1    Persson, J.2
  • 42
    • 80054777781 scopus 로고    scopus 로고
    • Design of an effective algorithm for fast response to re-scheduling of railway traffic during disturbances
    • Törnquist Krasemann J. Design of an effective algorithm for fast response to re-scheduling of railway traffic during disturbances. Transportation Research Part C 2012, 20(1):62-78.
    • (2012) Transportation Research Part C , vol.20 , Issue.1 , pp. 62-78
    • Törnquist Krasemann, J.1


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