This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To ...This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To solve GMP,an iterative heuristic algorithm is designed.Instead of separately investigating each problem,this model simultaneously coordinates and optimizes the aircraft routing and scheduling.A simulation test is conducted on Nanjing Lukou International Airport(NKG)and the results show that the bilevel programming model can clearly outperform the widely used first-come-first-service(FCFS)scheduling scheme in terms of aircraft operational time under the precondition of none conflict.The research effort demonstrates that with the reduced operating cost and the improved overall efficiency,the proposed model can assist operations of the airports that are facing increasing traffic demand and working at almost maximum capacity.展开更多
Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the ...Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the speed profile of the aircraft when turning,and the shortest taxi time does not necessarily bring the best taxi fuel consumption.In this paper,the number of turns is considered,and the improved A*algorithm is used to obtain the P static paths with the shortest sum of the straight-line distance and the turning distance of the aircraft as the feasible taxi paths.By balancing taxi time and fuel consumption,a set of Pareto optimal speed profiles are generated for each preselected path to predict the 4-D trajectory of the aircraft.Based on the 4-D trajectory prediction results,the conflict by the occupied time window in the taxiing area is detected.For the conflict aircraft,based on the priority comparison,the waiting or changing path is selected to solve the taxiing conflict.Finally,the conflict free aircraft taxiing path is generated and the area occupation time window on the path is updated.The experimental results show that the total taxi distance and turn time of the aircraft are reduced,and the fuel consumption is reduced.The proposed method has high practical application value and is expected to be applied in real-time air traffic control decision-making in the future.展开更多
基金supported by the National Natural Science Foundations of China(Nos.U1933118,U2033205)。
文摘This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To solve GMP,an iterative heuristic algorithm is designed.Instead of separately investigating each problem,this model simultaneously coordinates and optimizes the aircraft routing and scheduling.A simulation test is conducted on Nanjing Lukou International Airport(NKG)and the results show that the bilevel programming model can clearly outperform the widely used first-come-first-service(FCFS)scheduling scheme in terms of aircraft operational time under the precondition of none conflict.The research effort demonstrates that with the reduced operating cost and the improved overall efficiency,the proposed model can assist operations of the airports that are facing increasing traffic demand and working at almost maximum capacity.
基金supported by the National Key R&D Project(No.2020YFB1600101)National Natural Science Foundations of China(Nos.U1833103,71801215)Civil Aviation Flight Wide Area Surveillance and Safety Control Technology Key Laboratory Open Fund(No.202008)。
文摘Most of the traditional taxi path planning studies assume that the aircraft is in uniform speed,and the optimization goal is the shortest taxi time.Although it is easy to solve,it does not consider the changes in the speed profile of the aircraft when turning,and the shortest taxi time does not necessarily bring the best taxi fuel consumption.In this paper,the number of turns is considered,and the improved A*algorithm is used to obtain the P static paths with the shortest sum of the straight-line distance and the turning distance of the aircraft as the feasible taxi paths.By balancing taxi time and fuel consumption,a set of Pareto optimal speed profiles are generated for each preselected path to predict the 4-D trajectory of the aircraft.Based on the 4-D trajectory prediction results,the conflict by the occupied time window in the taxiing area is detected.For the conflict aircraft,based on the priority comparison,the waiting or changing path is selected to solve the taxiing conflict.Finally,the conflict free aircraft taxiing path is generated and the area occupation time window on the path is updated.The experimental results show that the total taxi distance and turn time of the aircraft are reduced,and the fuel consumption is reduced.The proposed method has high practical application value and is expected to be applied in real-time air traffic control decision-making in the future.
