메뉴 건너뛰기




Volumn 17, Issue 6, 2009, Pages 631-641

Reverse time-restricted shortest paths: Application to air traffic management

Author keywords

Air traffic management; Shortest path problems; Time dependent; Time restricted

Indexed keywords

AVIATION; DYNAMIC PROGRAMMING; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

EID: 69149093935     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2009.04.015     Document Type: Article
Times cited : (8)

References (26)
  • 1
    • 0026153311 scopus 로고
    • Vehicle routing with time windows and time-varying congestion
    • Ahn B., and Shin J. Vehicle routing with time windows and time-varying congestion. Journal of the Operational Research Society 42 (1991) 393-400
    • (1991) Journal of the Operational Research Society , vol.42 , pp. 393-400
    • Ahn, B.1    Shin, J.2
  • 4
    • 0001145228 scopus 로고    scopus 로고
    • Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time
    • Chabini I. Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transportation Research Record 1645 (1998) 170-175
    • (1998) Transportation Research Record , vol.1645 , pp. 170-175
    • Chabini, I.1
  • 5
    • 0009349631 scopus 로고
    • The shortest route through a network with time-dependent internodal transit times
    • Cooke K.L., and Halsey E. The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications 14 3 (1966) 493-498
    • (1966) Journal of Mathematical Analysis and Applications , vol.14 , Issue.3 , pp. 493-498
    • Cooke, K.L.1    Halsey, E.2
  • 6
    • 0036681086 scopus 로고    scopus 로고
    • Reversibility of the time-dependent shortest path problem
    • Daganzo C. Reversibility of the time-dependent shortest path problem. Transportation Research Part B 36 (2002) 665-668
    • (2002) Transportation Research Part B , vol.36 , pp. 665-668
    • Daganzo, C.1
  • 7
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • Dijkstra E. A note on two problems in connection with graphs. Numerische Mathematik 1 (1959) 269-271
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.1
  • 8
    • 0000418612 scopus 로고
    • An appraisal of some shortest path algorithms
    • Dreyfus S. An appraisal of some shortest path algorithms. Operations Research 17 (1969) 395-412
    • (1969) Operations Research , vol.17 , pp. 395-412
    • Dreyfus, S.1
  • 9
    • 85029890967 scopus 로고    scopus 로고
    • flightaware.com, 2008. Internet website.
    • flightaware.com, 2008. Internet website.
  • 11
    • 0022769799 scopus 로고
    • The fastest path through a network with random time-dependent travel times
    • Hall R. The fastest path through a network with random time-dependent travel times. Transportation Science 20 (1986) 182-188
    • (1986) Transportation Science , vol.20 , pp. 182-188
    • Hall, R.1
  • 12
    • 0000721546 scopus 로고
    • Shortest route with time dependent length of edges and limited delay possibilities in nodes
    • Halpern H. Shortest route with time dependent length of edges and limited delay possibilities in nodes. Mathematical Methods of Operations Research 21 3 (1977) 117-124
    • (1977) Mathematical Methods of Operations Research , vol.21 , Issue.3 , pp. 117-124
    • Halpern, H.1
  • 13
    • 33750354531 scopus 로고    scopus 로고
    • New models for shortest path problem with fuzzy arc lengths
    • Ji X., Iwamura K., and Shao Z. New models for shortest path problem with fuzzy arc lengths. Applied Mathematical Modelling 31 (2007) 259-269
    • (2007) Applied Mathematical Modelling , vol.31 , pp. 259-269
    • Ji, X.1    Iwamura, K.2    Shao, Z.3
  • 14
    • 0002607217 scopus 로고
    • Fastest paths in time-dependent networks for intelligent vehicle-highway systems application
    • Kaufman D., and Smith R. Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. Intelligent Vehicle-Highway Systems Journal 1 (1993) 1-11
    • (1993) Intelligent Vehicle-Highway Systems Journal , vol.1 , pp. 1-11
    • Kaufman, D.1    Smith, R.2
  • 15
    • 44449113204 scopus 로고    scopus 로고
    • A probabilistic framework for weather-based rerouting and delay estimations within an airspace planning model
    • McCrea M.V., Sherali H.D., and Trani A.A. A probabilistic framework for weather-based rerouting and delay estimations within an airspace planning model. Transportation Research Part C 16 4 (2008) 410-431
    • (2008) Transportation Research Part C , vol.16 , Issue.4 , pp. 410-431
    • McCrea, M.V.1    Sherali, H.D.2    Trani, A.A.3
  • 16
    • 0025464812 scopus 로고
    • Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
    • Orda A., and Rom R. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the Association for Computing Machinery 37 3 (1990) 607-625
    • (1990) Journal of the Association for Computing Machinery , vol.37 , Issue.3 , pp. 607-625
    • Orda, A.1    Rom, R.2
  • 17
    • 0022953574 scopus 로고
    • Shortest paths in Euclidean graphs
    • Sedgewick R., and Vitter J. Shortest paths in Euclidean graphs. Algorithmica 1 1 (1986) 31-48
    • (1986) Algorithmica , vol.1 , Issue.1 , pp. 31-48
    • Sedgewick, R.1    Vitter, J.2
  • 18
    • 0040757671 scopus 로고    scopus 로고
    • The time-dependent shortest pair of disjoint paths problem: complexity, models, and algorithms
    • Sherali H., Ozbay K., and Subramanian S. The time-dependent shortest pair of disjoint paths problem: complexity, models, and algorithms. Networks 31 (1998) 259-272
    • (1998) Networks , vol.31 , pp. 259-272
    • Sherali, H.1    Ozbay, K.2    Subramanian, S.3
  • 20
    • 0041438858 scopus 로고    scopus 로고
    • Time-dependent label-constrained shortest path problems with applications
    • Sherali H.D., Hobeika A.G., and Kangwalklai S. Time-dependent label-constrained shortest path problems with applications. Transportation Science 37 (2003) 278-293
    • (2003) Transportation Science , vol.37 , pp. 278-293
    • Sherali, H.D.1    Hobeika, A.G.2    Kangwalklai, S.3
  • 21
    • 33747820445 scopus 로고    scopus 로고
    • The approach-dependent, time-dependent, label-constrained shortest path problem
    • Sherali H.D., Jeenanunta C., and Hobeika A.G. The approach-dependent, time-dependent, label-constrained shortest path problem. Networks 48 2 (2006) 57-67
    • (2006) Networks , vol.48 , Issue.2 , pp. 57-67
    • Sherali, H.D.1    Jeenanunta, C.2    Hobeika, A.G.3
  • 22
    • 0346780466 scopus 로고    scopus 로고
    • An airspace planning and collaborative decision making model: Part I - probabilistic conflicts workload, and equity considerations
    • Sherali H.D., Staats R.W., and Trani A.A. An airspace planning and collaborative decision making model: Part I - probabilistic conflicts workload, and equity considerations. Transportation Science 37 4 (2003) 434-456
    • (2003) Transportation Science , vol.37 , Issue.4 , pp. 434-456
    • Sherali, H.D.1    Staats, R.W.2    Trani, A.A.3
  • 23
    • 33646745635 scopus 로고    scopus 로고
    • An airspace planning and collaborative decision making model: Part II - cost model data considerations, and computations
    • Sherali H.D., Staats R.W., and Trani A.A. An airspace planning and collaborative decision making model: Part II - cost model data considerations, and computations. Transportation Science 40 2 (2006) 147-164
    • (2006) Transportation Science , vol.40 , Issue.2 , pp. 147-164
    • Sherali, H.D.1    Staats, R.W.2    Trani, A.A.3
  • 26
    • 0001892803 scopus 로고
    • Time-dependent shortest path algorithm for real-time intelligent vehicle/highway system
    • Ziliaskopoulos A.K., and Mahmassani H. Time-dependent shortest path algorithm for real-time intelligent vehicle/highway system. Transportation Research Record 1408 (1993) 94-104
    • (1993) Transportation Research Record , vol.1408 , pp. 94-104
    • Ziliaskopoulos, A.K.1    Mahmassani, H.2


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