English  |  正體中文  |  简体中文  |  Items with full text/Total items : 72880/72880 (100%)
Visitors : 23131971      Online Users : 691
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/868

    Title: 多時效性貨物需求下貨機飛航排程暨班次表建立之研究;Fleet Routing and Timetable Setting with Multiple Timeliness Air Cargo’s Demand
    Authors: 陳世欽;Shin-Chin Chen
    Contributors: 土木工程研究所
    Keywords: 多重貨物網路流動;起迄時對;時空網路;班次表;機隊排程;航點選擇;貨物;Multiple commodity network flow problem;Cargo;Airport selecting;Fleet routing;Timetable;Time-space network;OD-time pair
    Date: 2003-06-28
    Issue Date: 2009-09-18 17:14:19 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 貨運機隊排程與班次表規劃對航空業者的貨運營運績效而言,甚為重要。其結果不但攸關航空業者設備之使用效率、左右班次表之擬訂與人員之調度,更重要的,將進而直接影響及業者之獲利能力、服務水準與市場之競爭能力等。然而,目前的航空公司對於航空貨運的排班與網路設計,大多利用人工以經驗法則進行,不僅廢時且難以得到最佳班次表,而降低營運績效。以往一般飛航排程研究多以客運為主,但航空客運與貨運在本質上並不相同。在客運方面,在航點的選擇上多屬於中長期之規劃;然在貨運部分,業者可就貨物之實際需求與經濟利益的考量下,在短期的排班上,選擇服務的航點,故在航點之選擇上可納入短期之規劃。另外,客運的旅次需求之時間敏感度高,若轉運次數過多,易使旅客流失。然而,對貨運而言,由於旅次需求之時間敏感度相對較低,故較不在乎被轉運多次。此外,對同一起迄對的貨運需求,各貨物的時間敏感度可能不完全相同,運送上可依各貨物之時效性,綜合機隊排程的系統考量,採取最有效的運送。 本研究以航空業者立場,在給定的營運資料下,包括機隊規模、起降額度、可用時間帶、航站貨物處理成本、飛航成本等,以營運利潤最大化為目標,考量貨物運送的相關營運限制,針對航點選擇、機隊規劃與班次表規劃等三大重要作業,建構一短期貨運之航點選擇、機隊排程及班次表建立的整合規劃模式。本研究模式能於實務的應用上,提供一有效的工具,以輔助航空貨運業者在短期營運中規劃合適的航點、排程與班次表。本研究利用網路流動技巧建立模式,此模式主要包含多重物流時空網路與機流時空網路,用以定式貨物與機隊在時空中的流動。其中在物流時空網路將有別於傳統之飛航網路設計,係依據不同時效性之貨物需求,構建多重起迄時對(OD-time pair)時空網路。機流時空網路則以整數流動方式定式機隊的週期排程。在物流時空網路與機流時空網路中及其間,再加上實務的營運限制,以符合實際的飛航作業。此模式可定式為一混合整數多重網路流動問題,屬NP-hard問題。本研究利用數學規劃軟體,自行發展有效的策略解與啟發解法進行求解。最後本研究以一國籍航空公司之國際貨運航線營運資料為例,進行範例測試與分析,進而提出結論及建議。 Cargo Fleet routing and flight scheduling are essential to airline cargo operations. In particular, they always affect the usage efficiency of facilities, the establishment of timetables and the crew scheduling. As a result, they are essential to carriers’ profitability, level of service and competitive capability in the market. However, most of the airlines in Taiwan currently adopt a trial-and-error process for cargo fleet routing and flight scheduling practices. Such an approach is considered to be less efficient when the flight network become larger, and can possibly result in an inferior feasible solution. In the past most research on airline scheduling was mainly focused on passenger transportation, which is fundamentally different from air cargo transportation. In particular, airport selecting in service network design is typically in the stage of long-term plan in passenger transportation, but in cargo transportation, due to possibly significant demand changes in short-term operations, carriers may perform their airport selecting, fleet routing and timetable setting together in the stage of short-term plan, according to considerations of demand and profit. Moreover, passengers are more sensitive to time than cargos. Too many transfers in a transport service may result in significant loss of passengers, but not much loss of cargos. Besides, cargos with the same OD may be sensitive to different times, which can be incorporated into fleet routing systematically in order to find the most effective transport plan. In this research, given the operating data, including fleet size, airport flight quota and available time slots, cargo handling cost at airports and flight cost, on the basis of the carrier’s perspective, we develop an integrated scheduling model by combining airport selecting, fleet routing and timetable setting, with the objective of maximizing the operating profit, subject to the related operating constraints. The model is a useful planning tool for cargo airlines to determine suitable service airports, fleet routes and timetables in their short-term operations. We employ network flow techniques to construct the model, which include multiple cargo- and fleet-flow networks in order to formulate the flows of cargos and fleet in the dimensions of time and space. In the cargo-flow networks, different from that in the past research, we construct multiple OD-time-pair time-space networks on the base of cargos’ timeliness. In the fleet-flow networks, we use an integer flow network to formulate the periodical fleet routes. Some side constraints set between the cargo- and fleet-flow networks according to the real operating requirements. The model formulated as a mixed integer program that is characterized as an NP-hard problem. We employ a mathematical programming solver and develop a heuristic to solve the problem. Finally, to evaluate the model and the solution algorithm, we perform a case study using real cargo operating data from a major Taiwan airline.
    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 ©   - Feedback  - 隱私權政策聲明