(34.204.185.54) 您好!臺灣時間:2021/04/16 18:43
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:楊慧華
研究生(外文):Yang Huey Hwa
論文名稱:多機種飛航排程規劃
論文名稱(外文):A study on Multiple Fleet Routing and Flight Scheduling
指導教授:顏上堯顏上堯引用關係
指導教授(外文):Shangyao Yan
學位類別:碩士
校院名稱:國立中央大學
系所名稱:土木工程研究所
學門:工程學門
學類:土木工程學類
論文種類:學術論文
論文出版年:1994
畢業學年度:82
語文別:中文
論文頁數:82
中文關鍵詞:多重網路流動問題拉氏鬆弛法次梯度法拉氏啟發式解法
外文關鍵詞:multiple network flow problemLagrangian relaxationsubgradient ian heuristic
相關次數:
  • 被引用被引用:4
  • 點閱點閱:116
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:2
飛航班次表及機隊排程之優劣影響航空業者之服務品質及營運效益甚鉅,
不當的調整排程及班次表常會造成業者在盈收上可觀的損失。本研究鑒於
國內以往研究多侷限於單機種及直達航次的排程,難以符合實用上的需要
,玆發展一多機種飛航排程架構,以輔助航空業者在因應預期航空市場需
求變化下,有效評估並調整草擬之飛航班次表,同時,建議業者可採行之
飛航排程對策。此架構利用一多機種飛航時空網路建立基本飛航排程模式
,以定式多機種綜合直達及中途停靠航次之排程問題,並進而擴展基本模
式為多種策略模式,以研擬實用排程策略。此等模式在數學上可定式為含
額外限制多重網路流動問題( multiple network flow problem with
side constraints ),為 NP-Complete之整數規劃問題。本研究利用拉氏
鬆弛法暨次梯度法(Lagrangian Relaxation with subgradient methods)
,連同網路簡捷法(Network Simplex method)及一自行發展之拉式啟發式
解法以求解各模式。再利用流量分解法( flow decomposition
algorithm),求得每一飛機排程路線。為求實用,本研究以C電腦語言撰
寫程式並在HP735工作站上執行、求解,並以中華航空公司國際客運服務
航線之營運為例進行實證分析,最後證實本模式效果良好,應具實用價值

Flight timetables and fleet routing play a key role in
carriers'' levels of services and system profits. Unsuitable
adjustments of flight timetables and fleet routing will result
in substantial loss of profits. Unfortunately, the past
related researches in Taiwan were confined to the scheduling of
single fleet and non-stop flights and is difficult in the
application of current operations. The objective of this
research is to develop a framework to help carriers in both
adjusting their draft timetables and providing better fleet
routing under fluctuating market demand conditions. The
framework is based on a multi-fleet time-space network
representing a basic multi-fleet routing model, and from which
several perturbed network models are developed to help
carriers in researching practical scheduling/routing
strategies. These models are formulated as multiple network
flow problems with side constraints which are characterized as
NP-Complete problems. The Lagrangian Relaxation with
subgradient methods accompanied with the Network Simplex method
and a self-developed Lagrangian heuristic are suggested to
solve the problems. To show how to apply this framework in a
real world and to test the models'' characteristics, a case
study regarding the international operations of a major Taiwan
airline was performed using C computer language in a HP735
workstation. The results show that the framework could be
useful for actual operations.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔