dc.description.abstract | In this research, we attempt to employ the network flow techniques to develop several gate assignment models, together with robust optimization, to solve the minimum number of gates for airport short-term and long-term operations. We will first construct a basic model. Referring to multiple aircraft types and ground holding strategies used in practices, we will then develop several strategic models based on the basic model, in order to solve the minimum number of gates. These models are expectedly formulated as network flow problems with side constraints or multiple commodity network problems, which are characterized as NP-hard problems. To efficiently solve large-scale problems in practices, we plan to develop a Lagrangian algorithm based on Lagargian relaxation, subgradient methods, network simplex and other heuristics. To estimate the number of gates in long-term planning, based on robust optimization we will develop a simulation framework, enclosing the strategic models, to effectively estimate the number of gates. Finally, to evaluate the models and the solution algorithms developed in the research, we will perform a case study using data from a Taiwan international airport.Conclusions and suggestions will be provided based on the test results. | en_US |