English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22967370      Online Users : 154
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/957


    Title: 整合航空客運與貨運之飛航排程暨班次表建立之研究;An Integrated Model Combine Passengers and Freight for Airline Fleet Routing and Timetable Planning
    Authors: 陳宇軒;Yu-Hsuan Chen
    Contributors: 土木工程研究所
    Keywords: 拉氏演算法;多重貨物網路流動問題;時空網路;客貨機;飛航排程;Lagrangian relaxation-based algorithm;fleet routing;combi flight;time-space network;multiple commodity network flow problem
    Date: 2004-07-02
    Issue Date: 2009-09-18 17:16:30 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 飛航排程對航空業者營運影響甚鉅,其排程之結果不但攸關設備之使用效率、左右班次表之擬訂與人員之調度,更重要的,將進而直接影響及業者之獲利能力、服務水準與市場之競爭能力等。近年來,航空公司在機型上除使用客、貨機以外,開始有使用客貨兩用的機型,其可同時支援客機與貨機的排程規劃。然目前國內業者在實務作業上,主要仍以人工及試誤的方式,規劃客機、貨機及客貨機之排程。做法上首先擬定出客機與客貨機的飛航排程,再根據初擬的客貨機排程,考量市場潛在的貨物需求,進行貨機的排程規劃。繼而修正原先初擬之客貨機排程,以此反覆試誤方式,求得客機、貨機與客貨機三者最終可行之班次表與飛航排程。由於此方法不具系統性分析,以致無法有效掌握客機、貨機與客貨機排程間之相關性,因此其排程之效率常易隨系統規模之增大而降低,進而導致營運績效之不佳。 緣此,本研究以航空業者立場,在給定的營運資料下,包括機隊規模、航權、可用時間帶、相關飛航成本等,以營運利潤最大化為目標,並考量相關營運限制,構建一整合客機、貨機與客貨機的飛航排程模式。此模式能於未來實務的應用上,提供航空業一短期排程暨班次表建立之輔助規劃工具。本研究利用網路動技巧構建模式,模式中含有多個人流、物流與機流時空網路,以定式旅客、貨物與飛機在時空中的流動情況。此模式可定式為一整數多重貨物網路流動問題,屬NP-hard問題,尤其是應用於實際問題時,規模甚為龐大,在求解上更難於以往傳統之飛航排程規劃問題。為有效求解大規模問題,本研究利用拉氏鬆弛法暨次梯度法、網路單體法、及自行發展之啟發式解法,配合數學規劃軟體CPLEX求解模式。最後,為測試模式及求解演算法之績效,本研究以一國籍航空公司之營運資料為例,進行測試與分析,進而提出結論及建議。 Fleet routing and flight scheduling are important in airline operations. They always affect the usage efficiency of facilities and crew scheduling. Furthermore, they are essential to carriers’ profitability, level of service and competitive capability in the market. Recently, besides passenger flights and cargo flights, some airlines introduced combi flights in their flight scheduling. The combi flights combine passengers and cargos in one flight and can supple passenger flights and cargo flights during a carrier’s regular operation. However, the carriers in Taiwan currently adopt a try-and-error method to determine the schedules of passenger flights, cargo flight and combi flights. The method starts by manually determining the passenger and combi flight schedules together. Based on the passenger and combi flight schedules and the projected cargo demand, the cargo flight schedule is then determined. Thereafter, the combi flight schedule is modified by considering the cargo flight schedule and the passenger flight schedule is revised in accordance with the combi flight schedule. The process is repeated until the final fleet routing and timetables are obtained. Since such a method without systemic analyses cannot effectively manage the interrelationship among the passenger, cargo and combi flight schedules, the performance of the obtained schedules would easily decrease as the system scale is enlarged. As a result, the operating performance could possibly be inferior. Therefore, given the operating data, including fleet size, airport flight quota and available time slots, related flight cost, on the basis of the carrier’s perspective, this research tries to develop a scheduling model by integrating passenger, cargo and combi flight schedules, with the objective of maximizing the operating profit, subject to the related operating constraints. The model is a useful planning tool for airlines to determine a suitable fleet routing and timetables in their short-term operations. We employ network flow techniques to construct the model, which include passenger-flow, cargo-flow and fleet-flow networks in order to formulate the flows of passengers, cargos and fleet in the dimensions of time and space. The model is formulated as an integer multiple commodity network flow problem that is characterized as an NP-hard problem. Since the real problem size is huge, this model is harder to solve than the conventional passenger flight scheduling problems in the past. A Lagrangian relaxation-based algorithm, coupled with a subgradient method, the network simplex method and a heuristic for upper bound solution, is suggested to solve the problem. Finally, to evaluate the model and the solution algorithm, we perform a case study by using the real operating data from a major Taiwan airline.
    Appears in Collections:[土木工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat
    0KbUnknown481View/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  - 隱私權政策聲明