{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T07:47:56Z","timestamp":1774079276177,"version":"3.50.1"},"reference-count":28,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T00:00:00Z","timestamp":1773878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"he Provincial Natural Science Foundation of Fujian, China","award":["2023J01349"],"award-info":[{"award-number":["2023J01349"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Flight Schedule Problem optimization is a typical NP-hard combinatorial optimization problem that is challenging to solve using traditional algorithms, so metaheuristic algorithms are commonly adopted for such problems. This paper proposes a Discrete Memory-Enhanced Restructured Particle Swarm Optimization algorithm (DMERPSO) to address Flight Scheduling Problem optimization. Firstly, this paper designs a hybrid particle encoding scheme capable of simultaneously handling flight time adjustments (integer variables) and route selections (categorical variables) for the Flight Schedule Problem. Secondly, a new update equation of particle positions is provided based on probability selection within the three terms of the Memory-Enhanced Restructured Particle Swarm Optimization (MERPSO) algorithm, and the calculation of the selection probability is designed. Thirdly, the two strategies and perturbation terms of MERPSO are improved in order to be adapted to optimize the discrete Flight Schedule Problem. Finally, simulation experiments are conducted using DMERPSO based on real flight data from multiple Chinese airports with the objective of minimizing total flight delays, leading to better solutions that are faster than various benchmark algorithms. The DMERPSO algorithm exhibits significant advantages in reducing total delays, improving solution stability, and enhancing robustness, which validates that DMERPSO provides an effective new approach for solving Flight Schedule Problem optimization problems.<\/jats:p>","DOI":"10.3390\/a19030233","type":"journal-article","created":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T15:38:01Z","timestamp":1773934681000},"page":"233","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Flight Schedule Problem Optimization Based on Discrete Memory-Enhanced Restructured Particle Swarm Optimization Algorithm"],"prefix":"10.3390","volume":"19","author":[{"given":"Wei","family":"Gao","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Fuzhou Technology and Business University, Fuzhou 350715, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingnan","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Mathematics, Fujian University of Technology, Fuzhou 350118, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Mathematics, Fujian University of Technology, Fuzhou 350118, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daoming","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Mathematics, Fujian University of Technology, Fuzhou 350118, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,3,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/opre.46.3.406","article-title":"The Air Traffic Flow Management Problem with Enroute Capacities","volume":"46","author":"Bertsimas","year":"1998","journal-title":"Oper. Res."},{"key":"ref_2","first-page":"433","article-title":"Air Traffic Management in Dense Airspace via Network Flow Optimization","volume":"22","author":"Hu","year":"2025","journal-title":"J. Aerosp. Inf. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1108\/IMDS-09-2016-0358","article-title":"Airline schedule planning: A review and future directions","volume":"117","author":"Eltoukhy","year":"2017","journal-title":"Ind. Manag. Data Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1940010","DOI":"10.1142\/S0217595919400104","article-title":"Flight schedule recovery: A simulation-based approach","volume":"36","author":"Wang","year":"2019","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0377-2217(96)00260-3","article-title":"Multifleet routing and multistop flight scheduling for schedule perturbation","volume":"103","author":"Yan","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","first-page":"37","article-title":"A branch-and-price algorithm for the robust airline crew pairing problem","volume":"13","author":"Soykan","year":"2014","journal-title":"Savun. Bilim. Derg."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1287\/trsc.37.4.368.23276","article-title":"Applications of operations research in the air transport industry","volume":"37","author":"Barnhart","year":"2003","journal-title":"Transp. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1016\/j.cor.2003.11.013","article-title":"A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem","volume":"32","author":"Mercier","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Reiners, T., Pahl, J., Maroszek, M., and Rettig, C. (2012). Integrated aircraft scheduling problem: An auto-adapting algorithm to find robust aircraft assignments for large flight plans. Proceedings of the 2012 45th Hawaii International Conference on System Sciences, Maui, HI, USA, 4\u20137 January 2012, IEEE.","DOI":"10.1109\/HICSS.2012.330"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1287\/trsc.2022.1174","article-title":"Passenger-centric integrated airline schedule and aircraft recovery","volume":"57","author":"Cadarso","year":"2023","journal-title":"Transp. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Delahaye, D., and Odoni, A.R. (1997). Airspace Congestion Smoothing by Stochastic Optimization. Evolutionary Programming VI, Proceedings of the 6th International Conference, Springer.","DOI":"10.1007\/BFb0014809"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"20377","DOI":"10.1038\/s41598-025-08375-7","article-title":"Optimizing the safety-efficiency trade-off on nationwide air traffic network flow using cooperative co-evolutionary paradigm","volume":"15","author":"Xiao","year":"2025","journal-title":"Sci. Rep."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Cecen, R.K., and Durmazkeser, Y. (2022). Meta-Heuristic Algorithms for Aircraft Sequencing and Scheduling Problem. Progress in Sustainable Aviation, Springer International Publishing.","DOI":"10.1007\/978-3-031-12296-5_6"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Kablan, A.A., Elberkawi, H.R.K., and Eldharif, E.A. (2024). Airline scheduling model using genetic algorithm. Proceedings of the 2024 IEEE 4th International Maghreb Meeting of the Conference on Sciences and Techniques of Automatic Control and Computer Engineering (MI-STA), Tripoli, Libya, 6\u20138 May 2024, IEEE.","DOI":"10.1109\/MI-STA61267.2024.10599636"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5787","DOI":"10.1016\/j.eswa.2010.10.053","article-title":"Ant colony optimization-based algorithm for airline crew scheduling problem","volume":"38","author":"Deng","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.ejor.2021.12.019","article-title":"Learning-driven feasible and infeasible tabu search for airport gate assignment","volume":"302","author":"Li","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Abualigah, L., Sheikhan, A., Ikotun, A.M., Zitar, R.A., Alsoud, A.R., Alshourbaji, I., Hussien, G., and Jia, H. (2024). Particle Swarm Optimization Algorithm: Review and Applications. Metaheuristic Optim. Algorithms, 1\u201314.","DOI":"10.1016\/B978-0-443-13925-3.00019-4"},{"key":"ref_18","first-page":"2697","article-title":"Dynamic Optimization of Flight Schedules Based on Deep Reinforcement Learning","volume":"27","author":"Ma","year":"2021","journal-title":"Comput. Integr. Manuf. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Zhu, J., Liu, J., Wang, Z., and Chen, Y. (2022). Restructuring Particle Swarm Optimization Algorithm Based on Linear System Theory. Proceedings of the 2022 IEEE Congress on Evolutionary Computation (CEC), Padua, Italy, 18\u201323 July 2022, IEEE.","DOI":"10.1109\/CEC55065.2022.9870261"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Zhu, J., Liu, J., Chen, Y., Xue, X., and Sun, S. (2023). Binary Restructuring Particle Swarm Optimization and Its Application. Biomimetics, 8.","DOI":"10.3390\/biomimetics8020266"},{"key":"ref_21","first-page":"116","article-title":"Memory-Enhanced Reconstructive Particle Swarm Optimization Algorithm","volume":"61","author":"Wu","year":"2025","journal-title":"Comput. Eng. Appl."},{"key":"ref_22","first-page":"1942","article-title":"Particle Swarm Optimization","volume":"Volume 4","author":"Kennedy","year":"1995","journal-title":"Proceedings of the ICNN\u201995-International Conference on Neural Networks, Perth, Australia, 27 November\u20131 December 1995"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.ins.2005.02.003","article-title":"A Study of Particle Swarm Optimization Particle Trajectories","volume":"176","author":"Engelbrecht","year":"2006","journal-title":"Inf. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1109\/TEVC.2023.3281810","article-title":"A Knee-guided Evolutionary Algorithm for Multi-objective Air Traffic Flow Management","volume":"28","author":"Guo","year":"2023","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ins.2022.07.067","article-title":"Adjustable Driving Force Based Particle Swarm Optimization Algorithm","volume":"609","author":"Yu","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"101222","DOI":"10.1016\/j.swevo.2022.101222","article-title":"Incorporating Surprisingly Popular Slgorithm and Euclidean Distance-based Adaptive Topology into PSO","volume":"76","author":"Wu","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Tanabe, R., and Fukunaga, A. (2014). Improving the search performance of SHADE using linear population size reduction. Proceedings of the 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China, 6\u201311 July 2014, IEEE.","DOI":"10.1109\/CEC.2014.6900380"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Brest, J., Mau\u010dec, M.S., and Bo\u0161kovi\u0107, B. (2017). Single objective real-parameter optimization: Algorithm jSO. Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia, Spain, 5\u20138 June 2017, IEEE.","DOI":"10.1109\/CEC.2017.7969456"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/3\/233\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T05:16:16Z","timestamp":1774070176000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/3\/233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,19]]},"references-count":28,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["a19030233"],"URL":"https:\/\/doi.org\/10.3390\/a19030233","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,19]]}}}