English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 64191/96979 (66%)
造訪人次 : 8153829      線上人數 : 7701
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/126973


    題名: Optimal aircraft stands assignment for close proximity parking demands
    作者: Chen, Chun-ying;Jiang, Shu-rong
    關鍵詞: Stand assignment;Close proximity parking;Aircraft blocking;Optimization;Time-space network
    日期: 2024-09-30
    上傳時間: 2025-03-20 09:33:25 (UTC+8)
    摘要: Major events like COVID-19 can lead to a sudden decline in passenger demand for airlines globally, resulting in the grounding of aircraft by carriers worldwide. To ensure ample parking space, carriers have implemented a close proximity parking strategy for aircraft, ensuring efficient use of available space. When multiple aircraft can park in a single space, inadequate planning may lead to various blockages. This not only raises airline costs but also reduces the operational efficiency of the airport. At present, the problem of assigning airplanes to airplanes in such a close proximity parking situation is planned manually, which is inefficient and may not be the optimal solution for the system. In this study, we employed time-space network flow techniques and mathematical programming to develop an optimal stand assignment model from the perspective of a planner. Then, based on the real flight data of Taoyuan International Airport, we conducted a case study and different scenarios. The results show that the proposed model is an effective auxiliary tool to assist the planners in optimizing the aircraft stand assignments under a close proximity parking strategy.
    關聯: Networks and Spatial Economics
    DOI: 10.1007/s11067-024-09649-9
    顯示於類別:[運輸管理學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML12檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋