DC 欄位 |
值 |
語言 |
DC.contributor | 土木工程學系 | zh_TW |
DC.creator | 曾志煌 | zh_TW |
DC.creator | Jyh-Hwang Tseng | en_US |
dc.date.accessioned | 2000-7-10T07:39:07Z | |
dc.date.available | 2000-7-10T07:39:07Z | |
dc.date.issued | 2000 | |
dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=82342015 | |
dc.contributor.department | 土木工程學系 | zh_TW |
DC.description | 國立中央大學 | zh_TW |
DC.description | National Central University | en_US |
dc.description.abstract | 本研究因而以數學規劃方法構建一直截整合旅次需求與航次供給之多機種多停靠飛航排程模式,並進一步發展其求解演算法,以幫助業者求得最佳的機隊排程與班次表。本研究模式係以多重時空網路來定式人旅次流動與飛機流動,是為一較特殊之整數多重貨物網路流動問題;數學上係屬於NP-hard 性質之問題。研究中係利用拉氏鬆弛法、次梯度法、網路單體法、流量分解法與最小成本流量推擠法等綜合發展一拉氏演算法(Lagrangian relaxation-based algorithm)求解;另本研究以一本國航空公司之國內客運營運資料進行模式之實證,並以C語言撰寫電腦演算法與實證架構。模式實證之收斂效果尚稱理想,期能於未來實務應用上提供航空業者作為有效改善營運績效之輔助規劃工具。 | zh_TW |
dc.description.abstract | This research therefore developed an integrated model and a solution algorithm to help carriers simultaneously solve for better fleet routes and proper timetables. In order to directly manage the interrelationships between trip demand and flight supply, a time-space network technique was applied to modeling the movements of aircraft and passenger flows. Mathematically, the model was formulated as a special integer multiple commodity network flow problem which was categorized as an NP-hard problem. A Lagrangian relaxation-based algorithm was developed to efficiently solve the problem on the basis of Lagrangian relaxation, the sub-gradient method, the network simplex method, the least cost flow augmenting algorithm and the flow decomposition algorithm. To show how well the model and the solution algorithm could be applied in the real world, a case study regarding the domestic operations of a major Taiwan airline was performed by using the C computer language. The admirable outcome has shown the model’s good performance. Presumably, the results are practically helpful for airlines in Taiwan to improve their operations. | en_US |
DC.subject | 時空網路 | zh_TW |
DC.subject | 整數多重貨物網路流動問題 | zh_TW |
DC.subject | 拉氏鬆弛法 | zh_TW |
DC.subject | 最小成本流量推擠法 | zh_TW |
DC.subject | time-space network | en_US |
DC.subject | integer multiple commodity network flow problem | en_US |
DC.subject | Lagrangian relaxation | en_US |
DC.subject | the least cost flow augmenting algorithm | en_US |
DC.title | 整合供需面飛航排程暨班次表規劃之研究 | zh_TW |
dc.language.iso | zh-TW | zh-TW |
DC.title | An Integrated Model for Airline Fleet Routing and Timetable Planning | en_US |
DC.type | 博碩士論文 | zh_TW |
DC.type | thesis | en_US |
DC.publisher | National Central University | en_US |