English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78728/78728 (100%)
Visitors : 34313878      Online Users : 1987
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/580

    Title: 最小化機場機門數量之研究;Minimizing the Number of Gates in an Airport
    Authors: 朱橋榮;Chayo-Rong Chu
    Contributors: 土木工程研究所
    Keywords: 機門;拉氏演算法;多重貨物網路流動問題;穩健最佳化;gate;Lagrangian algorithm;multiple commodity n
    Date: 2001-06-26
    Issue Date: 2009-09-18 17:08:08 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 機場的停機位數量的多寡和使用效率一直是影響機場服務水準的關鍵。在短期機場擁擠下,如何以最小機門數有效指派尖峰時段的航次?在長期規劃且在有限的經費下,如何估算最少的機門需求量?此等課題一直為機場營運當局所重視。傳統實務上,短期機門的指派,大都以人工經驗方式為之,缺乏系統性最佳化分析。學術界雖有提出部份最佳化機門指派模式,然並非以最小機門數為目標。至於長期機門數的規劃上,以往文獻大多以統計方法配合歷史資料估算預期機門數量。此方法缺乏系統最佳化指派考量,難以估算最少機門需求量。 有鑒於此,本研究利用網路流動技巧,發展數個機門指派模式,並透過穩健最佳化觀念,求解短期營運與長期規劃所需最少的機門數量問題。本研究先建立一基本模式,再參考一般營運中常見之多機型營運及航機地面等候策略,延伸基本模式,發展多型機門及配合等候策略的不同策略模式,以求解各策略下最少的機門數量。此等模式預期可定式為含額外限制網路流動問題或多重貨物網路流動問題,在數學上屬於NP-Hard問題。為有效求解實務上面臨的大規模問題,本研究利用拉氏鬆弛法暨次梯度法,並配合網路單體法或其他啟發解法,發展有效的拉氏演算法,求解各網路模式。至於在長期最少機門需求數量的估算上,本研究使用穩健最佳化方法,發展一模擬架構,融合各策略模式,有效的求解長期最佳機門數量。最後,為測試本研究模式及解法的績效,我們以國內一國際機場的營運資料為例,進行實例分析,並根據測試結果,提出結論與建議。 The number of gates and their usage efficiency are essential to an airport level of service. In short term operations under congestion, what is the minimum number of gates that can operate all flights in peak periods in an airport? In long-term planning under limited budget, what is the minimum number of gates in an airport? Such topics are always important to airport authorities. In traditional short-term practices, airport authorities usually assign flights to gates in a manual way, which lacks of systematic and optimal analysis. Although academic researchers have proposed some optimal gate assignment models, these models did not aim at minimizing the number of gates. In long-term planning, statistical methods, coupled with historical operating data and current/future operating conditions, were used to estimate an expected number of gates. These methods did not consider optimal assignment of flights to gates, making it difficult to estimate the minimum number of gates. In this research, we attempt to employ the network flow techniques to develop several gate assignment models, together with robust optimization, to solve the minimum number of gates for airport short-term and long-term operations. We will first construct a basic model. Referring to multiple aircraft types and ground holding strategies used in practices, we will then develop several strategic models based on the basic model, in order to solve the minimum number of gates. These models are expectedly formulated as network flow problems with side constraints or multiple commodity network problems, which are characterized as NP-hard problems. To efficiently solve large-scale problems in practices, we plan to develop a Lagrangian algorithm based on Lagargian relaxation, subgradient methods, network simplex and other heuristics. To estimate the number of gates in long-term planning, based on robust optimization we will develop a simulation framework, enclosing the strategic models, to effectively estimate the number of gates. Finally, to evaluate the models and the solution algorithms developed in the research, we will perform a case study using data from a Taiwan international airport.Conclusions and suggestions will be provided based on the test results.
    Appears in Collections:[土木工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明