Cong Ding
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Cong Ding has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Jun Bi
Beijing Jiaotong University
5 shared publications - Dong-Fan Xie
School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
2 shared publications - Xiao-Mei Zhao
Beijing Jiaotong University
2 shared publications - Bingjie Liang
College of General Aviation and Flight, Nanjing University of Aeronautics and Astronautics, Nanjing 213300, China
1 shared publication - Shuai Sun
Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
1 shared publication Yanhua Li
School of Traffic and Transportation
1 shared publication
Latest Publications
- Open Access
A Hybrid Genetic Algorithm Based on Imitation Learning for the Airport Gate Assignment Problem
Airport gates are the main places for aircraft to receive ground services. With the increased number of flights, limited gate resources near to the terminal make the gate assignment work more complex. Traditional solution methods based on mathematical programming models and iterative algorithms are usually used to solve these static situations, lacking learning and real-time decision-making abilities. In this paper, a two-stage hybrid algorithm based on imitation learning and genetic algorithm (IL-GA) is proposed to solve the gate assignment problem. First of all, the problem is defined from a mathematical model to a Markov decision process (MDP), with the goal of maximizing the number of flights assigned to contact gates and the total gate preferences. In the first stage of the algorithm, a deep policy network is created to obtain the gate selection probability of each flight. This policy network is trained by imitating and learning the assignment trajectory data of human experts, and this process is offline. In the second stage of the algorithm, the policy network is used to generate a good initial population for the genetic algorithm to calculate the optimal solution for an online instance. The experimental results show that the genetic algorithm combined with imitation learning can greatly shorten the iterations and improve the population convergence speed. The flight rate allocated to the contact gates is 14.9% higher than the manual allocation result and 4% higher than the traditional genetic algorithm. Learning the expert assignment data also makes the allocation scheme more consistent with the preference of the airport, which is helpful for the practical application of the algorithm.
Open AccessA Hybrid Genetic Algorithm Based on Imitation Learning for the Airport Gate Assignment Problem
Airport gates are the main places for aircraft to receive ground services. With the increased number of flights, limited gate resources near to the terminal make the gate assignment work more complex. Traditional solution methods based on mathematical programming models and iterative algorithms are usually used to solve these static situations, lacking learning and real-time decision-making abilities. In this paper, a two-stage hybrid algorithm based on imitation learning and genetic algorithm (IL-GA) is proposed to solve the gate assignment problem. First of all, the problem is defined from a mathematical model to a Markov decision process (MDP), with the goal of maximizing the number of flights assigned to contact gates and the total gate preferences. In the first stage of the algorithm, a deep policy network is created to obtain the gate selection probability of each flight. This policy network is trained by imitating and learning the assignment trajectory data of human experts, and this process is offline. In the second stage of the algorithm, the policy network is used to generate a good initial population for the genetic algorithm to calculate the optimal solution for an online instance. The experimental results show that the genetic algorithm combined with imitation learning can greatly shorten the iterations and improve the population convergence speed. The flight rate allocated to the contact gates is 14.9% higher than the manual allocation result and 4% higher than the traditional genetic algorithm. Learning the expert assignment data also makes the allocation scheme more consistent with the preference of the airport, which is helpful for the practical application of the algorithm.
- RetractedOpen Access
- 30 July 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-12
Multiobjective Optimization of Airport Ferry Vehicle Scheduling during Peak Hours Based on NSGA-II
Airport ferry vehicles are used to transport passengers between the far apron and terminals. During the peak hours of flight arrival or departure, the demand for ferry vehicles will increase, and improper scheduling will result in significant delays. In this study, we construct a 0–1 integer programming scheduling model for ferry vehicles with multiple objectives: minimize flight delays and vehicle travel distances and balance vehicle workloads when there is an insufficient number of ferry vehicles. To solve the multiobjective model, this study selects the second version of the nondominated sorting genetic algorithm-II as the main framework and designs a modified coding and decoding scheme to solve the constraint problem in the model. The proposed model and algorithm are verified using actual data from Kunming Changshui International Airport, China. Compared with the scheduling method of manual first come first serve, the total delay time of the proposed model is reduced by 24.52%, the transit distance by 6.63%, and the balance index by 24.05%, which helps the airport solve the problem of insufficient ferry vehicles during peak hours. Comparison results show that the proposed model has a shorter calculation time and better distribution of solution sets than three state-of-the-art multiobjective optimization algorithms: MOPSO, MOACO, and SPEA-II. This research can help airports reduce flight delays, vehicle purchases, and operation costs.
- 30 July 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-12
RetractedOpen AccessMultiobjective Optimization of Airport Ferry Vehicle Scheduling during Peak Hours Based on NSGA-II
Airport ferry vehicles are used to transport passengers between the far apron and terminals. During the peak hours of flight arrival or departure, the demand for ferry vehicles will increase, and improper scheduling will result in significant delays. In this study, we construct a 0–1 integer programming scheduling model for ferry vehicles with multiple objectives: minimize flight delays and vehicle travel distances and balance vehicle workloads when there is an insufficient number of ferry vehicles. To solve the multiobjective model, this study selects the second version of the nondominated sorting genetic algorithm-II as the main framework and designs a modified coding and decoding scheme to solve the constraint problem in the model. The proposed model and algorithm are verified using actual data from Kunming Changshui International Airport, China. Compared with the scheduling method of manual first come first serve, the total delay time of the proposed model is reduced by 24.52%, the transit distance by 6.63%, and the balance index by 24.05%, which helps the airport solve the problem of insufficient ferry vehicles during peak hours. Comparison results show that the proposed model has a shorter calculation time and better distribution of solution sets than three state-of-the-art multiobjective optimization algorithms: MOPSO, MOACO, and SPEA-II. This research can help airports reduce flight delays, vehicle purchases, and operation costs.
- Open Access
- 31 October 2021
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2021, 1-11
Mining Travel Time of Airport Ferry Network Based on Historical Trajectory Data
An airport ferry vehicle is a ground service vehicle used to transfer passengers between the far apron and the terminal. The travel time of ferry tasks in the airport ferry network is an important decision-making basis for ferry vehicle scheduling. This paper presents a graph-based method to mine the travel time between nodes in the airport ferry network. Firstly, combined with map and trajectory information, the method takes the terminal boarding gates, parking lots, and remote stands as road network nodes to build a complete airport ferry road network. Then, this paper uses big data processing technology to identify the travel time between regional connection nodes by data fusion through the temporal and spatial relationship between flight schedule and ferry vehicle GPS travel trajectory. Finally, the Floyd shortest path algorithm in graph theory is used to obtain the shortest path and travel time of all OD points. The experimental results show that all the ferry times calculated by the method proposed in this paper can better reflect the actual driving situation. This method saves the manpower, material resources, and time cost of on-site investigation and lays a foundation for the scheduling of ferry vehicles.
- 31 October 2021
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2021, 1-11
Open AccessMining Travel Time of Airport Ferry Network Based on Historical Trajectory Data
An airport ferry vehicle is a ground service vehicle used to transfer passengers between the far apron and the terminal. The travel time of ferry tasks in the airport ferry network is an important decision-making basis for ferry vehicle scheduling. This paper presents a graph-based method to mine the travel time between nodes in the airport ferry network. Firstly, combined with map and trajectory information, the method takes the terminal boarding gates, parking lots, and remote stands as road network nodes to build a complete airport ferry road network. Then, this paper uses big data processing technology to identify the travel time between regional connection nodes by data fusion through the temporal and spatial relationship between flight schedule and ferry vehicle GPS travel trajectory. Finally, the Floyd shortest path algorithm in graph theory is used to obtain the shortest path and travel time of all OD points. The experimental results show that all the ferry times calculated by the method proposed in this paper can better reflect the actual driving situation. This method saves the manpower, material resources, and time cost of on-site investigation and lays a foundation for the scheduling of ferry vehicles.
- Open Access
- 17 December 2020
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2020, 1-17
An Improved Adaptive Parallel Genetic Algorithm for the Airport Gate Assignment Problem
Gate assignment problem (GAP) is the core issue of airport operation management. However, the limited resources of airport gates and the increase of flight scale result in serious problems for gate allocation. In this paper, to provide decision-making support for large-scale GAPs, a model based on gate assignment rules (e.g., flight type constraints, safe time interval constraints, and adjacency conflict constraints) is built to formulate the problem. An improved adaptive parallel genetic algorithm (APGA) is then designed to solve the model. The algorithm is effective because it introduces the idea of elite strategy and parallel design and can adaptively adjust the crossover probability. Moreover, different instances are presented to demonstrate the proposed algorithm. The calculation results of this algorithm are compared with those of standard genetic algorithm and CPLEX, which show that the proposed algorithm has better performance and takes a shorter computational time. In addition, we verify the stability and practicability of the algorithm by repeated experiments on large-scale flight data.
- 17 December 2020
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2020, 1-17
Open AccessAn Improved Adaptive Parallel Genetic Algorithm for the Airport Gate Assignment Problem
Gate assignment problem (GAP) is the core issue of airport operation management. However, the limited resources of airport gates and the increase of flight scale result in serious problems for gate allocation. In this paper, to provide decision-making support for large-scale GAPs, a model based on gate assignment rules (e.g., flight type constraints, safe time interval constraints, and adjacency conflict constraints) is built to formulate the problem. An improved adaptive parallel genetic algorithm (APGA) is then designed to solve the model. The algorithm is effective because it introduces the idea of elite strategy and parallel design and can adaptively adjust the crossover probability. Moreover, different instances are presented to demonstrate the proposed algorithm. The calculation results of this algorithm are compared with those of standard genetic algorithm and CPLEX, which show that the proposed algorithm has better performance and takes a shorter computational time. In addition, we verify the stability and practicability of the algorithm by repeated experiments on large-scale flight data.
- 26 November 2019
- Published by Springer Nature
- p. 1-6
Cleaning and Processing on the Electric Vehicle Telematics Data
- 26 November 2019
- Published by Springer Nature
- p. 1-6
Cleaning and Processing on the Electric Vehicle Telematics Data