메뉴 건너뛰기




Volumn 11, Issue 2, 2010, Pages 359-373

Optimal arrival flight sequencing and scheduling using discrete airborne delays

Author keywords

Air traffic management; Combinatorial optimization; Mixed integer linear programming (MILP); Optimal sequencing

Indexed keywords

ARRIVAL FLIGHTS; BEST FIRST SEARCH; BRANCH-AND-BOUND ALGORITHMS; COMPUTATION TIME; DECISION SUPPORT TOOLS; DECOMPOSITION METHODS; DISCRETE DELAY; LAGRANGIAN DUAL; LOWER BOUNDS; MIXED-INTEGER LINEAR PROGRAMMING; OPERATIONAL CONSTRAINTS; OPTIMAL SEQUENCING; OPTIMIZATION PROBLEMS; OPTIMIZATION VARIABLES; SEQUENCING AND SCHEDULING; SIMULATION RESULT; TERMINAL AREA; TRAFFIC MANAGEMENT;

EID: 77953123216     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2010.2044791     Document Type: Article
Times cited : (64)

References (33)
  • 1
    • 79961020031 scopus 로고    scopus 로고
    • Network characteristics of air traffic in the continental united states
    • Seoul, Korea, Jul.
    • B. Sridhar and K. Sheth, "Network characteristics of air traffic in the continental united states," in Proc. 17th IFAC World Congr., Seoul, Korea, Jul. 2008.
    • (2008) Proc. 17th IFAC World Congr.
    • Sridhar, B.1    Sheth, K.2
  • 3
    • 35348824741 scopus 로고    scopus 로고
    • Joint Planning Development Office, Washington, DC, Tech. Rep. Feb. [Online]. Available
    • Concept of Operations for the Next Generation Air Transportation System, Joint Planning Development Office, Washington, DC, Tech. Rep., Feb. 2007. [Online]. Available: http://www.jpdo.gov/library/NextGen- v2.0.pdf
    • (2007) Concept of Operations for the Next Generation Air Transportation System
  • 4
    • 2442474092 scopus 로고    scopus 로고
    • Dynamic network flow model for shortterm air traffic flow management
    • May
    • Z. Ma, D. Cui, and P. Cheng, "Dynamic network flow model for shortterm air traffic flow management," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol.34, no.3, pp. 351-358, May 2004.
    • (2004) IEEE Trans. Syst., Man, Cybern. A, Syst., Humans , vol.34 , Issue.3 , pp. 351-358
    • Ma, Z.1    Cui, D.2    Cheng, P.3
  • 5
    • 43649090332 scopus 로고    scopus 로고
    • Optimal dynamic scheduling of aircraft arrivals at congested airports
    • A. P. Saraf and G. L. Slater, "Optimal dynamic scheduling of aircraft arrivals at congested airports," J. Guid. Control Dyn., vol.31, no.1, pp. 53-65, 2008.
    • (2008) J. Guid. Control Dyn. , vol.31 , Issue.1 , pp. 53-65
    • Saraf, A.P.1    Slater, G.L.2
  • 6
    • 34047177043 scopus 로고    scopus 로고
    • An efficient combinatorial optimization algorithm for optimal scheduling of aircraft arrivals at congested airport
    • Big Sky, MT, Mar.
    • A. P. Saraf and G. L. Slater, "An efficient combinatorial optimization algorithm for optimal scheduling of aircraft arrivals at congested airport," in Proc. IEEE Aerosp. Conf., Big Sky, MT, Mar. 2006.
    • (2006) Proc. IEEE Aerosp. Conf.
    • Saraf, A.P.1    Slater, G.L.2
  • 7
    • 85052311254 scopus 로고
    • An implicit enumeration algorithm for arrival aircraft scheduling
    • Seattle, WA, Oct.
    • C. R. Brinton, "An implicit enumeration algorithm for arrival aircraft scheduling," in Proc. IEEE/AIAA 11th Digital Avionics Syst. Conf., Seattle, WA, Oct. 1992, pp. 268-274.
    • (1992) Proc. IEEE/AIAA 11th Digital Avionics Syst. Conf. , pp. 268-274
    • Brinton, C.R.1
  • 8
    • 49249117057 scopus 로고    scopus 로고
    • Optimization of sequencing for aircraft arrival based on approach routes
    • Seattle, WA, Sep./Oct.
    • X. Zhang, X. Zhang, J. Zhang, and B. Liu, "Optimization of sequencing for aircraft arrival based on approach routes," in Proc. IEEE Intell. Transp. Syst. Conf., Seattle, WA, Sep./Oct. 2007, pp. 592-596.
    • (2007) Proc. IEEE Intell. Transp. Syst. Conf. , pp. 592-596
    • Zhang, X.1    Zhang, X.2    Zhang, J.3    Liu, B.4
  • 9
    • 0033321235 scopus 로고    scopus 로고
    • Air traffic control using genetic search techniques
    • Kohala Coast, HI, Aug.
    • V. H. L. Cheng, L. S. Crawford, and P. K. Menon, "Air traffic control using genetic search techniques," in Proc. IEEE Int. Conf. Control Appl., Kohala Coast, HI, Aug. 1999, pp. 249-254.
    • (1999) Proc. IEEE Int. Conf. Control Appl. , pp. 249-254
    • Cheng, V.H.L.1    Crawford, L.S.2    Menon, P.K.3
  • 10
    • 0346461743 scopus 로고    scopus 로고
    • Genetic search methods in air traffic control
    • Mar.
    • J. V. Hansen, "Genetic search methods in air traffic control," Comput. Oper. Res., vol.31, no.3, pp. 445-459, Mar. 2004.
    • (2004) Comput. Oper. Res. , vol.31 , Issue.3 , pp. 445-459
    • Hansen, J.V.1
  • 11
    • 21644434939 scopus 로고    scopus 로고
    • Receding horizon control for aircraft arrival sequencing and scheduling
    • Jun.
    • X. B. Hu and W. H. Chen, "Receding horizon control for aircraft arrival sequencing and scheduling," IEEE Trans. Intell. Transp. Syst., vol.6, no.2, pp. 189-197, Jun. 2005.
    • (2005) IEEE Trans. Intell. Transp. Syst. , vol.6 , Issue.2 , pp. 189-197
    • Hu, X.B.1    Chen, W.H.2
  • 12
    • 46449104940 scopus 로고    scopus 로고
    • A dynamic programming algorithm for robust runway scheduling
    • New York, Jul.
    • B. Chandran and H. Balakrishnan, "A dynamic programming algorithm for robust runway scheduling," in Proc. Amer. Control Conf., New York, Jul. 2007, pp. 1611-11166
    • (2007) Proc. Amer. Control Conf. , pp. 1611-11166
    • Chandran, B.1    Balakrishnan, H.2
  • 14
    • 19944378813 scopus 로고    scopus 로고
    • Dynamic optimization of delay distribution in an uncertain environment
    • Paper AIAA-2004-5229, presented at the, Providence, RI, Aug.
    • G. L. Slater and D. Yang, "Dynamic optimization of delay distribution in an uncertain environment," presented at the AIAA Guidance, Navigation, Control Conf. Exhib., Providence, RI, Aug. 2004, Paper AIAA-2004-5229.
    • (2004) AIAA Guidance, Navigation, Control Conf. Exhib.
    • Slater, G.L.1    Yang, D.2
  • 16
    • 0142199966 scopus 로고    scopus 로고
    • Real-time discrete control law synthesis for hybrid systems using MILP: Application to congested airspace
    • Denver, CO, Jun.
    • A. M. Bayen and C. J. Tomlin, "Real-time discrete control law synthesis for hybrid systems using MILP: Application to congested airspace," in Proc. Amer. Control Conf., Denver, CO, Jun. 2003, pp. 4620-4626.
    • (2003) Proc. Amer. Control Conf. , pp. 4620-4626
    • Bayen, A.M.1    Tomlin, C.J.2
  • 17
    • 14244253369 scopus 로고    scopus 로고
    • An approximation algorithm for scheduling aircraft with holding time
    • Dec.
    • A. M. Bayen, C. J. Tomlin, Y. Ye, and J. Zhang, "An approximation algorithm for scheduling aircraft with holding time," in Proc. IEEE Conf. Decision Control, Dec. 2004, pp. 2760-2767.
    • (2004) Proc. IEEE Conf. Decision Control , pp. 2760-2767
    • Bayen, A.M.1    Tomlin, C.J.2    Ye, Y.3    Zhang, J.4
  • 18
    • 29744439064 scopus 로고    scopus 로고
    • Polynomial time algorithms for scheduling of arrival aircraft
    • Paper AIAA-2005-6044, presented at the, San Francisco, CA, Aug.
    • K. Roy, A. M. Bayen, and C. J. Tomlin, "Polynomial time algorithms for scheduling of arrival aircraft," presented at the AIAA Guidance, Navigation, Control Conf. Exhib., San Francisco, CA, Aug. 2005, Paper AIAA-2005-6044.
    • (2005) AIAA Guidance, Navigation, Control Conf. Exhib.
    • Roy, K.1    Bayen, A.M.2    Tomlin, C.J.3
  • 21
    • 2442440988 scopus 로고    scopus 로고
    • Displacement problem and dynamically scheduling aircraft landings
    • Jan.
    • J. E. Beasley, M. Krishnammorthy, Y. M. Sharaiha, and D. Abramson, "Displacement problem and dynamically scheduling aircraft landings," J. Oper. Res. Soc., vol.55, no.1, pp. 54-64, Jan. 2004.
    • (2004) J. Oper. Res. Soc. , vol.55 , Issue.1 , pp. 54-64
    • Beasley, J.E.1    Krishnammorthy, M.2    Sharaiha, Y.M.3    Abramson, D.4
  • 22
    • 0036641286 scopus 로고    scopus 로고
    • Spacecraft trajectory planning with avoidance constraints using mixed-integer linear programming
    • A. Richards, T. Schouwennars, J. P. How, and E. Feron, "Spacecraft trajectory planning with avoidance constraints using mixed-integer linear programming," AIAA J. Guid., Control, Dyn., vol.25, no.4, pp. 755-764, 2002.
    • (2002) AIAA J. Guid., Control, Dyn. , vol.25 , Issue.4 , pp. 755-764
    • Richards, A.1    Schouwennars, T.2    How, J.P.3    Feron, E.4
  • 23
    • 0023451776 scopus 로고
    • Lagrangian decomposition: A model yielding stronger Lagrangian bounds
    • Jun.
    • M. Guignard and S. Kim, "Lagrangian decomposition: A model yielding stronger Lagrangian bounds," Math. Program., vol.39, no.2, pp. 215- 228, Jun. 1987.
    • (1987) Math. Program. , vol.39 , Issue.2 , pp. 215-228
    • Guignard, M.1    Kim, S.2
  • 24
    • 34249921509 scopus 로고
    • Lagrangian decomposition for integer nonlinear programming with linear constraints
    • May
    • P. MiChelon and N. Maculan, "Lagrangian decomposition for integer nonlinear programming with linear constraints," Math. Program., vol.52, no.1-3, pp. 303-313, May 1991.
    • (1991) Math. Program. , vol.52 , Issue.1-3 , pp. 303-313
    • Michelon, P.1    MacUlan, N.2
  • 25
    • 21144437113 scopus 로고    scopus 로고
    • Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
    • Mar.
    • I. Nowak, "Lagrangian decomposition of block-separable mixed-integer all-quadratic programs," Math. Program.: Ser. A, B, vol.102, no.2, pp. 295-312, Mar. 2005.
    • (2005) Math. Program.: Ser. A, B , vol.102 , Issue.2 , pp. 295-312
    • Nowak, I.1
  • 26
    • 0025699771 scopus 로고
    • Improved Lagrangian decomposition: An application to the generalized assignment problem
    • May
    • P. Barcia and K. Jornsten, "Improved Lagrangian decomposition: An application to the generalized assignment problem," Eur. J. Oper. Res., vol.46, no.1, pp. 84-92, May 1990.
    • (1990) Eur. J. Oper. Res. , vol.46 , Issue.1 , pp. 84-92
    • Barcia, P.1    Jornsten, K.2
  • 27
    • 0028539615 scopus 로고
    • A Lagrangian decomposition solution to a single line multiproduct scheduling problem
    • Nov.
    • R. de Matta, "A Lagrangian decomposition solution to a single line multiproduct scheduling problem," Eur. J. Oper. Res., vol.79, no.1, pp. 25-37, Nov. 1994.
    • (1994) Eur. J. Oper. Res. , vol.79 , Issue.1 , pp. 25-37
    • De Matta, R.1
  • 28
    • 38249007379 scopus 로고
    • Solving makespan minimization problems with Lagrangian decomposition
    • Feb.
    • M. Guignard, "Solving makespan minimization problems with Lagrangian decomposition," Discrete Appl. Math., vol.42, no.1, pp. 17-29, Feb. 1993.
    • (1993) Discrete Appl. Math. , vol.42 , Issue.1 , pp. 17-29
    • Guignard, M.1
  • 30
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • Jan.
    • M. L. Fisher, "The Lagrangian relaxation method for solving integer programming problems," Manage. Sci., vol.27, no.1, pp. 1-18, Jan. 1981.
    • (1981) Manage. Sci. , vol.27 , Issue.1 , pp. 1-18
    • Fisher, M.L.1
  • 31
    • 52449148785 scopus 로고    scopus 로고
    • Lagrangian relaxation
    • M. Guignard, "Lagrangian relaxation," Top, vol.11, no.2, pp. 151-228, 2003.
    • (2003) Top , vol.11 , Issue.2 , pp. 151-228
    • Guignard, M.1
  • 33
    • 77953120284 scopus 로고    scopus 로고
    • Ph.D. dissertation, School Mech., Aerosp. Syst. Eng., Korea Adv. Inst. Sci. Technol., Daejeon, Korea
    • Y. Eun, "Optimal scheduling of arrival flights in a terminal airspace," Ph.D. dissertation, School Mech., Aerosp. Syst. Eng., Korea Adv. Inst. Sci. Technol., Daejeon, Korea, 2010.
    • (2010) Optimal Scheduling of Arrival Flights in A Terminal Airspace
    • Eun, Y.1


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