Font Size: a A A

A Study Of The Flight-Gate Allocation Problem With Satellite Hall

Posted on:2021-01-15Degree:MasterType:Thesis
Country:ChinaCandidate:C C LiangFull Text:PDF
GTID:2392330611957412Subject:Mathematics
Abstract/Summary:PDF Full Text Request
With the continuous increase of passenger flow,the flow of the original terminal gradually reached the saturation state.For this reason,the airport has added a new satellite office to relieve the pressure of insufficient gates in the terminal,but this has caused a certain negative impact on the flight connection of transit passengers.In this paper,a mathematical optimization model is developed for the flight-gate allocation problem with satellite hall,and the corresponding feasible algorithm is given.Firstly,the flight-gate allocation problem is studied and solved as a vertex coloring problem.According to the principle of "first come,first served",a simple greedy algorithm strategy(selecting the gate with the longest idle time)is designed for gate allocation with satellite hall.This greatly increases the robustness of the assignment and helps to deal with the aircraft's inevitable short delays.The following heuristic rules are further combined to select the gate for the current flight,that is,the gate for only one type of flight is used first,then the gate for two types of flights is considered,and finally the gate for four types is used.This helps reduce the number of gates available for multiple types of flights and helps allocate those gates to more numerous types of flights.Then,the passenger transfer factor is further added,the shortest process time of the transit passenger is considered,more flights are allocated to the appropriate boarding gate,which is regarded as the "maximum cut" problem,the "minimum flow" model is established,and the flight-boarding gate problem considering the transit passenger is optimized.Owing to the strong regularity of transit passenger flow time,the difference between landing time and departure time S,terminal T and satellite building is 10 minutes,and the difference between the rest is 5 minutes.Therefore,landing for international flights,departure for international flights,if not arranged together,the opportunity to pay more.The cost.Therefore,we further add the corresponding heuristic rules,the current flight arrangement in the existing flight passengers pay the least cost in the terminal gate,and the gate further consideration to distinguish the terminal T and satellite building S,so as to effectively reduce the transitpassenger flow time.Finally,considering the transfer tightness of transit passengers,on the basis of the above two problems,we further refine the area where the terminal T and satellite hall S the boarding gate are located,and solve the flight-boarding gate problem.These algorithms are applied to the optimization of 303 flights at 69 gate in Shanghai Pudong International Airport to verify and analyze the effectiveness of the algorithm.
Keywords/Search Tags:flight-gate assignment, vertex coloring, greedy algorithm
PDF Full Text Request
Related items