機場出境行李卸載轉盤指派最佳化模式與演算法

Taoyuan International Airport is actively preparing to be a transit hub in East Asia by expanding new routes. In addition to the activation of the airport MRT and the construction of the third terminal, there are significant upgrades to the existing second terminal, including hardware and software integration and runway construction projects. Among those, the linear baggage conveyor in the departure section had also been replaced by the baggage loading carousel in 2015, in order to improve the operational efficiency. The travel demand at Taoyuan International Airport grows significantly and there are more than 100,000 pieces of luggage transported every day. However, the current practice of assigning baggage carousels to departure flights relies on the operator's experience, which lacks a systematic approach and hence may result in inefficient use of carousel resources. To address this issue, this study constructs a baggage carousel assignment model that takes into account outbound luggage demand forecasts and complex practical constraints on assigning baggage carousels to departure flights. The objective of the model is to minimize the overlapping time of luggage loading operations among departure flights. The proposed model is characterized as NP-hard. To solve large scale instances of the problem efficiently, a genetic algorithm, coupled with a 2-OPT local search, is developed. A case study using real data from Taoyuan International Airport is performed to evaluate the model and the heuristic. The results show that the model and the solution algorithm are useful for assigning luggage carousels to departure flights.