| dc.description.abstract | 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 general, there are two categories of assignment approaches to common-use counters, those are fixed and varied counter number. For utilization ratio of counters, the varied counter number approach is higher than the other.
In literature, there have only four researches to the assignment of common-use counters, particularly none applying systematic analysis by varied counter number approach to airports. Hence, this research considers the objective of minimizing total passenger walking distance and total inconsistency, coupled with the constraint of allowable inconsistency of flight-to-common-use-counter in different time windows, and other related operating constraints, to develop an integer programming model by varied counter number approach, 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. For this, we develop two heuristic solution framework to solve the model. 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, the optimization software, CPLEX will be employed to perform tests on personal computers. The results show the model could be useful. | en_US |