機場共用櫃檯指派之研究

NCUIR > Engineering College > Graduate Institute of Civil Engineering > Electronic Thesis & Dissertation > Item 987654321/526

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/526

Title:	機場共用櫃檯指派之研究
Authors:	湯慶輝;Hsin-Huan Tung
Contributors:	土木工程研究所
Keywords:	共用櫃檯;櫃檯指派;單體法;擾亂度;分枝界限法;common use counter;counter assignment;simplex method;branch and bound;inconsistency
Date:	2000-06-27
Issue Date:	2009-09-18 17:07:05 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	隨著國人旅遊人數、新航線簽訂及航空公司的增加，機場旅客報到櫃檯（ Check-in Counters）的需求隨之增加。目前國內部分機場航站大廈在有限的櫃檯下，逐漸的無法滿足各航空公司專屬櫃檯的需求，因此共用櫃檯（Common Use Counters）的使用方式應運而出，亦逐漸為未來各機場櫃檯使用的一個走向。在共用櫃檯的指派方法上，目前在文獻上未有見到系統性的分析與研究。實務上，以國內中正機場為例，目前共用櫃檯的指派係以人工指派的方式處理。此方法缺乏系統最佳化的考量，亦難以處理大型機場如空運中心等之櫃檯指派問題。因此，本研究由系統分析，以旅客最小步行距離為目標，考量業者的作業需要，針對不同天中同班機櫃檯指派之容許擾亂程度，及其他相關之限制條件，發展一整數規劃模式，以規劃適合的共用櫃檯指派組合。在模式的求解上，由於規劃的時間長度、不同天同班機櫃檯指派擾亂之限制、可用的櫃檯組合、申請航班數等複雜因素，將使問題規模變得相當龐大，難以求解現實問題，因此，本研究發展一啟發式求解架構。具體的解法主要先將原模式分解成三個啟發模式，第一啟發模式，先以旅客總步行距離最小為目標分別求出各天之櫃檯指派；再以此指派結果作為擾亂標準，配合第二啟發模式求取各天最小之總擾亂值；而後以此最小總擾亂值為標準設定容許擾亂程度，並加入此限制於第一模式中，構成第三啟發模式，以分天求解最終之櫃檯指派。此啟發架構係將原模式中多天之指派問題，合理的分解成數個單天的指派問題，再利用單天之指派模式有效地求解。本研究利用單體法(Simplex Method)配合分枝界限法（Branch-and-Bound）求解此三種啟發模式。為測試本研究模式與解法的績效，本研究參考國內一國際機場之現有設施及營運狀況，進行測試研究與敏感度分析。並以FORTRAN電腦語言撰寫電腦演算法，在個人電腦上執行求解，測試效果良好。 Because of increased passenger demand, flights and airlines, the demand of checking counters required in Taiwan’s airports increases momentarily. Due to constrained space in airports, existing checking counters are gradually not sufficient for airline uses. Thus, the application of common use counters becomes more popular than before. In literature, there has none systematic analysis or research to the assignment of common use counters to airlines. In practice, for example of the Taiwan CKS airport, the assignment of common use counters is handled in a manual way without optimization from a system perspective. This way is also difficult to resolve large-scale common use counter assignment problems that usually occur in a large airport, for example, an air hub. Hence, this research considers the objective of minimizing total passenger walking distance, coupled with the constraint of allowable inconsistency of flight-to-common-use-counter in different days, and other related operating constraints, to develop an integer programming model in order to help airport authorities solve common use counter assignments. Due to many complicated factors that have to be considered in the model, the problem size of the model is expected to be huge, which would be difficult to solve and, therefore, not applicable to real world. For this, we develop a heuristic solution framework to solve the model. The preliminary idea is to decompose the original model into three heuristic models. The first heuristic model assigns sharing counters to airlines for a single day with the objective of minimizing total passenger walking distance. The second model solves the minimum projected inconsistency of sharing counter assignments for a single day. Given the minimum inconsistency obtained from the second model, the third model solves the final common use counter assignment. This framework suitably decomposes the originally large-scale problem into several smaller single-day common use counter assignment problems that will be easy to solve in real world. The simplex method with the branch-and-bound technique is employed to solve the single-day common use counter assignment problems. Finally, to test how well the proposed models and the solution algorithms could be applied in real world, we perform a case study concerning the operations of a major airport in Taiwan. To enhance to applicability of the developed models and solution algorithms, we develop computer algorithms, using FORTRAN computer language, and perform tests on personal computers. The results were impressive
Appears in Collections:	[Graduate Institute of Civil Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...