{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T12:29:22Z","timestamp":1776860962057,"version":"3.51.2"},"reference-count":41,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T00:00:00Z","timestamp":1679702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Shandong Shusheng technology company","award":["T22L00890"],"award-info":[{"award-number":["T22L00890"]}]},{"name":"Shandong Shusheng technology company","award":["KLAGIO20180801"],"award-info":[{"award-number":["KLAGIO20180801"]}]},{"name":"open fund of Key Laboratory of Airports Cluster Intelligent Operation","award":["T22L00890"],"award-info":[{"award-number":["T22L00890"]}]},{"name":"open fund of Key Laboratory of Airports Cluster Intelligent Operation","award":["KLAGIO20180801"],"award-info":[{"award-number":["KLAGIO20180801"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e25040565","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T03:31:48Z","timestamp":1679887908000},"page":"565","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Hybrid Genetic Algorithm Based on Imitation Learning for the Airport Gate Assignment Problem"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4335-1957","authenticated-orcid":false,"given":"Cong","family":"Ding","sequence":"first","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"},{"name":"Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Jun","family":"Bi","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Yongxing","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"102146","DOI":"10.1016\/j.omega.2019.102146","article-title":"A review on airport gate assignment problems: Single versus multi objective approaches","volume":"92","author":"Gzara","year":"2020","journal-title":"Omega"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.ejor.2015.04.040","article-title":"Exact and heuristic approaches to the airport stand allocation problem","volume":"246","author":"Briant","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.trpro.2015.01.013","article-title":"A Metaheuristic Approach to Solve the Flight Gate Assignment Problem","volume":"5","author":"Marinelli","year":"2015","journal-title":"Transp. Res. Procedia"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Fu, R., Wang, C., and Zhang, R. (2020). Modeling Car-Following Behaviors and Driving Styles with Generative Adversarial Imitation Learning. Sensors, 20.","DOI":"10.3390\/s20185034"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1177\/0278364917713116","article-title":"Learning movement primitive libraries through probabilistic segmentation","volume":"36","author":"Lioutikov","year":"2017","journal-title":"Int. J. Robot. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.trc.2019.12.005","article-title":"Optimal passenger-seeking policies on E-hailing platforms using Markov decision process and imitation learning","volume":"111","author":"Shou","year":"2020","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0360-8352(91)90071-D","article-title":"An expert system methodology for aircraft-gate assignment","volume":"21","author":"Srihari","year":"1991","journal-title":"Comput. Ind. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/S0360-8352(97)00001-6","article-title":"A knowledge-based airport gate assignment system integrated with mathematical programming","volume":"32","author":"Cheng","year":"1997","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0191-2607(90)90071-D","article-title":"Gosling. Design of an expert system for aircraft gate assignment","volume":"24","author":"Geoffrey","year":"1990","journal-title":"Transp. Res. Part A Gen."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1061\/(ASCE)0733-947X(1984)110:1(55)","article-title":"Aircraft Stand Assignment to Minimize Walking","volume":"110","author":"Babic","year":"1984","journal-title":"J. Transp. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.ejor.2006.05.002","article-title":"A heuristic approach for airport gate assignments for stochastic flight delays","volume":"180","author":"Yan","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"467","DOI":"10.2514\/1.57022","article-title":"Gate assignment to minimize passenger transit time and aircraft taxi time","volume":"36","author":"Kim","year":"2013","journal-title":"J. Guid. Control Dyn."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"8835201","DOI":"10.1155\/2020\/8835201","article-title":"A Tabu Search-Based Algorithm for Airport Gate Assignment: A Case Study in Kunming, China","volume":"2020","author":"Bi","year":"2020","journal-title":"J. Adv. Transp."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.7494\/csci.2017.18.1.41","article-title":"Multiobjective optimization in the Airport Gate Assignment Problem, exact versus evolutionary multiobjective optimization","volume":"18","author":"Kaliszewski","year":"2017","journal-title":"Comput. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1080\/19427867.2016.1252876","article-title":"Research on a robust multi-objective optimization model of gate assignment for hub airport","volume":"10","author":"Deng","year":"2018","journal-title":"Transp. Lett. Int. J. Transp. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"6693127","DOI":"10.1155\/2021\/6693127","article-title":"Robust Airport Gate Assignment Based on the Analysis of Flight Arrival Time","volume":"2021","author":"Tan","year":"2021","journal-title":"Math. Probl. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1016\/j.cie.2012.06.020","article-title":"Multi-commodity flow network model of the flight gate assignment problem","volume":"63","author":"Maharjan","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"101816","DOI":"10.1016\/j.jairtraman.2020.101816","article-title":"Optimizing flight equencing and gate assignment considering terminal configuration and walking time","volume":"86","author":"Xiao","year":"2020","journal-title":"J. Air Transp. Manag."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.trb.2016.11.006","article-title":"Optimization for gate re-assignment","volume":"95","author":"Zhang","year":"2017","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/j.trpro.2017.03.061","article-title":"The comparison of the metaheuristic algorithms performances on airport gate assignment problem","volume":"22","author":"Aktel","year":"2017","journal-title":"Transp. Res. Procedia"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cie.2016.10.004","article-title":"Aircraft Gate Assignment: Using a Deterministic Approach for Integrating Freight Movement and Aircraft Taxiing","volume":"102","author":"Behrends","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"107878","DOI":"10.1016\/j.cie.2021.107878","article-title":"The airport gate assignment problem: A Branch-and-Price Approach for improving utilization of jetways","volume":"164","author":"Bi","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.tre.2011.10.008","article-title":"Stochastic optimization models for the airport gate assignment problem","volume":"48","author":"Noyan","year":"2012","journal-title":"Transp. Res. Part E-Logist. Transp. Rev."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"25","DOI":"10.12720\/jtle.3.1.25-30","article-title":"Airport Gate Reassignment Based on the Optimization of Transfer Passenger Connections","volume":"3","author":"Yu","year":"2015","journal-title":"J. Traffic Logist. Eng."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.asoc.2017.06.004","article-title":"Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment","volume":"59","author":"Deng","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1108\/K-08-2017-0279","article-title":"Study on an airport gate assignment method based on improved ACO algorithm","volume":"47","author":"Deng","year":"2018","journal-title":"Kybernetes"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Stollenwerk, T., Lobe, E., and Jung, M. (2019). Flight Gate Assignment with a Quantum Annealer, Springer International Publishing.","DOI":"10.1007\/978-3-030-14082-3_9"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Aoun, O., and El Afia, A. (2014, January 5\u20137). Using Markov decision processes to solve stochastic gate assignment problem. Proceedings of the 2014 International Conference on Logistics Operations Management (GOL 2014), Rabat, Morocco.","DOI":"10.1109\/GOL.2014.6887445"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Aoun, O., and El Afia, A. (2014, January 20\u201322). Application of multi-agent Markov decision processes to gate assignment problem. Proceedings of the 2014 Third IEEE International Colloquium in Information Science and Technology, Tetouan, Morocco.","DOI":"10.1109\/CIST.2014.7016618"},{"key":"ref_30","first-page":"331","article-title":"Time-Dependence in Multi-Agent MDP Applied to Gate Assignment Problem","volume":"9","author":"Oussama","year":"2018","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"923859","DOI":"10.1155\/2014\/923859","article-title":"The airport gate assignment problem: A survey","volume":"2014","author":"Bouras","year":"2014","journal-title":"Sci. World J."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"646241","DOI":"10.1155\/2013\/646241","article-title":"Real-Time Gate Reassignment Based on Flight Delay Feature in Hub Airport","volume":"2013","author":"Wang","year":"2013","journal-title":"Math. Probl. Eng."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"343","DOI":"10.3758\/CABN.9.4.343","article-title":"Reinforcement learning, conditioning, and the brain: Successes and challenges","volume":"9","author":"Maia","year":"2009","journal-title":"Cogn. Affect. Behav. Neurosci."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Klimo, M., Luk\u00e1\u010d, P., and Tar\u00e1bek, P. (2021). Deep Neural Networks Classification via Binary Error-Detecting Output Codes. Appl. Sci., 11.","DOI":"10.3390\/app11083563"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/palgrave.jors.2601190","article-title":"Models and a Genetic Algorithm for Static Aircraft-Gate Assignment Problem","volume":"52","author":"Bolat","year":"2001","journal-title":"J. Oper. Res. Soc."},{"key":"ref_36","first-page":"5368","article-title":"A DRL based cooperative approach for parking space allocation in an automated valet parking system","volume":"53","author":"Xie","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"3806","DOI":"10.1109\/TITS.2019.2909109","article-title":"Online Vehicle Routing with Neural Combinatorial Optimization and Deep Reinforcement Learning","volume":"20","author":"James","year":"2019","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.trc.2011.05.018","article-title":"Signal optimisation using the cross entropy method","volume":"27","author":"Maher","year":"2013","journal-title":"Transp. Res. Part C"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"8880390","DOI":"10.1155\/2020\/8880390","article-title":"An Improved Adaptive Parallel Genetic Algorithm for the Airport Gate Assignment Problem","volume":"2020","author":"Liang","year":"2020","journal-title":"J. Adv. Transp."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Daftry, S., Bagnell, J.A., and Hebert, M. (2016, January 3\u20138). Learning Transferable Policies for Monocular Reactive MAV Control. Proceedings of the International Symposium on Experimental Robotics, Nagasaki, Japan.","DOI":"10.1007\/978-3-319-50115-4_1"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"149814","DOI":"10.1109\/ACCESS.2021.3124710","article-title":"Overview on Binary Optimization Using Swarm-Inspired Algorithms","volume":"9","author":"Macedo","year":"2021","journal-title":"IEEE Access"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/4\/565\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:03:05Z","timestamp":1760122985000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/4\/565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,25]]},"references-count":41,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["e25040565"],"URL":"https:\/\/doi.org\/10.3390\/e25040565","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,25]]}}}