在模式的求解上，由於規劃的時間長度、不同天同班機櫃檯指派擾亂之限制、可用的櫃檯組合、申請航班數等複雜因素，將使問題規模變得相當龐大，難以求解現實問題，因此，本研究發展一啟發式求解架構。具體的解法主要先將原模式分解成三個啟發模式，第一啟發模式，先以旅客總步行距離最小為目標分別求出各天之櫃檯指派；再以此指派結果作為擾亂標準，配合第二啟發模式求取各天最小之總擾亂值；而後以此最小總擾亂值為標準設定容許擾亂程度，並加入此限制於第一模式中，構成第三啟發模式，以分天求解最終之櫃檯指派。此啟發架構係將原模式中多天之指派問題，合理的分解成數個單天的指派問題，再利用單天之指派模式有效地求解。本研究利用單體法(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

參考文獻
1. 汪進財，「機門指派最佳化模式」，運輸計劃季刊，第二十一卷，第二期，頁247-260，民國八十一年。
2. 汪進財、張束珍，「動態機門指派績效評估」，運輸計畫季刊，第二十五卷，第一期，頁121-144，民國八十五年。
3. 汪進財，「機門指派最佳化模式」，運輸計劃季刊，第二十一卷，第二期，頁247-260，民國八十一年。
4. 汪進財、張束珍，「動態機門指派績效評估」，運輸計畫季刊，第二十五卷，第一期，頁121-144，民國八十五年。
5. 陳春益、李宇欣、盧華安，「時空網路應用於機門指派問題之研究」，運輸學刊，第十卷，第三期，頁1-20，民國八十六年。
6. 顏上堯、張家銘，「機門指派最佳化之研究」，中國土木水利工程學刊，第九卷，第三期，頁491-500，民國八十六年。
7. 顏上堯、韓復華、霍俊明，「大型機門指派問題最佳化」，中國工業工程學刊，第15卷，第三期，頁245-254，民國八十七年。
8. Babic, O., Teodorovic, D. and Tosic, V., “Aircraft Stand Assignment to Minimize Walking,” Transportation Engineering, Vol. 110, pp.55-66, 1984.
9. Balas, E. and Martin, C. H., “Pivot and Complement-a heuristic for 0-1 programming,”Management Science,Vol. 26, No. 1, January, pp.21-40, 1980.
10. Cheng Y., “A Knowledge-Based Airport Gate Assignment System Integrated With Mathematical Programming,” Computers Ind. Eng., Vol. 32, pp.837-852, 1997.
11. Hamzawi, S. G., “Management and Planning of Airport Gate Capacity: A Microcomputer-Based Gate Assignment Simulation Model,“ Transportation Planning and Technology, Vol. 11, pp.189-202, 1986.
12. Mangoubi, R. S. and Mathaisel, D. F. X., “Optimizing Gate Assignment at Airport Terminals,” Transportation Science, Vol. 19, pp. 173-188, 1985.
13. Su, Y. Y. and Srihari, K., “A knowledge Based Aircraft-Gate Assignment Advisor,” Comps and Ind. Eng., Vol. 25, pp. 123-126, 1993.
14. Vanderstraetan, G. and Bergeron, M., “Automatic Assignment of Aircraft to Gates at A Terminal,” Computers and Industrial Engineering, Vol. 14, pp.15-25, 1988.
15. Wirasinghe, S. C. and Bandara, S., “Airport Gate Position Estimation for Minimum Total Costs-Approximate Closed Form Solution,” Transportation Research, Vol. 24B, pp. 287-297, 1990.
16. Yan, S. and C. M. Huo, "Optimization of Multiple Objective Gate Assignments," Transportation Research, Part A, 2000. (in press)