English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65275/65275 (100%)
Visitors : 20910716      Online Users : 262
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/64758


    Title: 考量時間帶變動下航空公司飛航排程暨班次表建立之研究
    Authors: 吳忠霖;Wu,Chung-lin
    Contributors: 土木工程學系
    Keywords: 時間帶;飛航排程;變動需求;旅客選擇模式;非線性混合整數規劃問題;次要市場交易;time slot;fleet routing;variable demand;passenger choice model;nonlinear mixed integer program;secondary trading
    Date: 2014-07-11
    Issue Date: 2014-10-15 14:22:48 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 飛航排程對航空業者營運影響甚鉅,而良好的飛航排程,除考量航空公司本身的機隊供給、相關作業措施、實務上的限制及旅客的反應,更重要的是航空公司是否取得理想之時間帶。本研究以航空業者立場,在給定的營運資料下,包括機隊規模、機場額度、相關飛航成本等,以營運利潤最大化為目標,構建一考量時間帶分配及變動需求之短期飛航排程模式。若航空公司希望透過次要時間帶交易改善現有之飛航排程表,該模式將會分析其租用時間帶及交換的時間帶是否會為航空公司帶來利潤,並輸出新的飛航排程表及航空公司之利潤,提供航空業者一短期排程暨班次表建立之輔助規劃工具。
    本研究利用網路流動技巧構建模式,此模式包含機流網路與多重人流網路。在機流網路的設計上,假設時間帶分佈位置為已知,並以整數流動方式定式機隊於時空中的排程。在人流網路中,為考量等待旅客在實務中的流失情況,本研究加入旅客選擇模式以定式此一旅客流動問題,並於二網路流動間加上實務限制,以符合實際的飛航作業。該模式為一非線性混合整數規劃問題,其屬於NP-hard性質的問題,在求解上更難於以往傳統之飛航排程規劃問題。為有效求解大規模問題,因而本研究發展一反覆求解架構,以重複修正該航空公司的市場分配需求,並配合求解固定性需求之短期飛航排程問題,以求解模式。最後本研究參考某國各機場與該國各航空公司之國內線相關營運資料為例,進行測試分析,結果顯示本研究所提出考量時間帶變動下之短期飛航排程模式及求解演算法的效果甚佳。
    ;Fleet routing and flight scheduling are important in the field of airline operations. In order to create a brilliant flight schedule for an airline, the fleet and its supply, related operating requirements, restrictions on practice, and customers’ response on its service should be taken into account. Last but not least, the most important part is that airline could acquire the ideal slots in the airport or not. In this paper, based on the airline’s perspective, given the operating data, including fleet size, airport flight quota, and related flight cost, the objective is to maximize the operating profit and build a short-term flight scheduling model with slot allocation and variable demands. If the airline wants to improve the flight schedule with secondary slot trading, this model would analyze whether the rented slots or the swapped slots would be profitable for airlines. New flight schedule and the profit for the airline would be displayed within this model. The model will also provide assistance in planning to construct their short-term flight schedules and timetables for airlines.
    This paper employed network flow techniques to construct the model which includes fleet flow network and multiple passengers network. For fleet flow network design, it is assumed that time slot location has been known, and we applied integer flow networks to formulate the aircraft routes in terms of time and space. In the passenger flow networks, considering the loss of waiting passengers in real case, this paper introduced a passenger choice model to formulate passenger flows. Constraints between the fleet flow and passenger flow network were considered to fulfill the real operating requirements. The model is a mixed integer non-linear programming problem that is characterized as a NP-hard problem and is more difficult to be solved than traditional flight scheduling problems that are often formulated as integer linear programs. To solve the model with practical size problems efficiently, we developed an iterative solution framework which will repeatedly modify the target airline market share in iteration and solve a fixed-demand flight scheduling problem. We used certain country of airports data and related operating data of domestic passenger transportation from some airlines to analyze. The test results show this model that to be effective and that the solution method could be useful in practice.
    Appears in Collections:[土木工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML328View/Open


    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 ©   - Feedback  - 隱私權政策聲明