{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T13:39:58Z","timestamp":1773581998364,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Civil Aviation Education and Talent Project of China","award":["MHJY2023012"],"award-info":[{"award-number":["MHJY2023012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>To reduce airport operating costs and minimize environmental pollution, converting ground-handling vehicles from fuel-powered to electric ones is inevitable. However, this transformation introduces complexity in scheduling due to additional factors, such as battery capacities and charging requirements. This study models the electric ground-handling vehicle scheduling problem as a bi-objective integer programming model to address these challenges. The objectives of this model are to minimize the total travel distance of vehicles serving flights and the standard deviation of the total occupancy time for each vehicle. In order to solve this model and generate optimal scheduling solutions, this study combines the non-dominated sorting genetic algorithm 2 (NSGA2) with the large neighborhood search (LNS) algorithm, proposing a novel NSGA2-LNS algorithm. A dynamic priority method is used by the NSGA2-LNS to construct the initial population, thereby speeding up the convergence. The NSGA2-LNS employs the LNS algorithm to overcome the problem that metaheuristic algorithms often lack clear directions in the process of finding solutions. In addition, this study designs the correlation-based destruction operator and the priority-based repair operator in the NSGA2-LNS algorithm, thereby significantly enhancing its ability to find optimal solutions for the electric ground-handling vehicle scheduling problem. The algorithm is verified using flight data from Chengdu Shuangliu International Airport and is compared with manual scheduling methods and traditional multi-objective optimization algorithms. Experimental results demonstrate that the NSGA2-LNS can rapidly solve the scheduling problem of allocating electric ground-handling vehicles for hundreds of flights and produce high-quality scheduling solutions.<\/jats:p>","DOI":"10.1007\/s40747-025-01815-x","type":"journal-article","created":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T08:14:53Z","timestamp":1741853693000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A bi-objective optimization approach for scheduling electric ground-handling vehicles in an airport"],"prefix":"10.1007","volume":"11","author":[{"given":"Weigang","family":"Fu","sequence":"first","affiliation":[]},{"given":"Jiawei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Yaoming","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"1815_CR1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.cor.2015.12.010","volume":"71","author":"S Padr\u00f3n","year":"2016","unstructured":"Padr\u00f3n S, Guimarans D et al (2016) A bi-objective approach for scheduling ground-handling vehicles in airports. Comput Oper Res 71:34\u201353","journal-title":"Comput Oper Res"},{"issue":"24","key":"1815_CR2","doi-asserted-by":"crossref","first-page":"7400","DOI":"10.1080\/00207543.2020.1841317","volume":"59","author":"\u00d6 Nihat","year":"2021","unstructured":"Nihat \u00d6, Gultekin H, Ko\u00e7 \u00c7 (2021) The airport shuttle bus scheduling problem. Int J Prod Res 59(24):7400\u20137422","journal-title":"Int J Prod Res"},{"issue":"2","key":"1815_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.2507\/IJSIMM18(2)CO9","volume":"18","author":"PX Zhao","year":"2019","unstructured":"Zhao PX, Gao WQ et al (2019) Bi-objective collaborative scheduling optimization of airport ferry vehicle and tractor. Int J Simul Model 18(2):355\u2013365","journal-title":"Int J Simul Model"},{"key":"1815_CR4","doi-asserted-by":"crossref","unstructured":"Wu Y, Zhou J et al (2023) Neural airport ground handling. IEEE Trans Intell Transp Syst","DOI":"10.1109\/TITS.2023.3253552"},{"key":"1815_CR5","unstructured":"Norin A, Granberg TA, V\u00e4rbrand P, Yuan D (2009) Integrating optimization and simulation to gain more efficient airport logistics. In: Eighth USA\/Europe air traffic management research and development seminar, p 10"},{"issue":"8","key":"1815_CR6","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1057\/jors.2011.100","volume":"63","author":"A Norin","year":"2012","unstructured":"Norin A, Yuan D, Granberg TA, V\u00e4rbrand P (2012) Scheduling de-icing vehicles within airport logistics: a heuristic algorithm and performance evaluation. J Oper Res Soc 63(8):1116\u20131125","journal-title":"J Oper Res Soc"},{"key":"1815_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.tre.2014.07.008","volume":"70","author":"JY Du","year":"2014","unstructured":"Du JY, Brunner JO, Kolisch R (2014) Planning towing processes at airports more efficiently. Transp Res Part E Logist Transp Rev 70:293\u2013304","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"1815_CR8","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/j.apenergy.2015.04.039","volume":"157","author":"M Weiszer","year":"2015","unstructured":"Weiszer M, Chen J, Locatelli G (2015) An integrated optimisation approach to airport ground operations to foster sustainability in the aviation sector. Appl Energy 157:567\u2013582","journal-title":"Appl Energy"},{"key":"1815_CR9","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/s11047-018-9703-0","volume":"19","author":"W Guo","year":"2020","unstructured":"Guo W, Xu P, Zhao Z, Wang L, Zhu L, Wu Q (2020) Scheduling for airport baggage transport vehicles based on diversity enhancement genetic algorithm. Nat Comput 19:663\u2013672","journal-title":"Nat Comput"},{"issue":"1","key":"1815_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-020-03743-0","volume":"295","author":"X Han","year":"2020","unstructured":"Han X, Zhao P, Meng Q, Yin S, Wan D (2020) Optimal scheduling of airport ferry vehicles based on capacity network. Ann Oper Res 295(1):163\u2013182","journal-title":"Ann Oper Res"},{"key":"1815_CR11","doi-asserted-by":"crossref","unstructured":"Feng X, Zuo H, Sun Q (2021) Research on collaborative scheduling of aircraft ground service vehicles based on simple temporal network. In: 2021 IEEE 3rd international conference on civil aviation safety and information technology (ICCASIT). IEEE, pp 263\u2013269","DOI":"10.1109\/ICCASIT53235.2021.9633418"},{"key":"1815_CR12","doi-asserted-by":"crossref","unstructured":"Zampirolli KA, Amaral ARS (2021) Simulated annealing and iterated local search approaches to the aircraft refueling problem. In: Computational science and its applications-ICCSA 2021: 21st international conference, Cagliari, September 13\u201316, 2021, Proceedings, Part IV 21. Springer International Publishing, pp 422\u2013438","DOI":"10.1007\/978-3-030-86973-1_30"},{"issue":"4","key":"1815_CR13","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1109\/JSYST.2012.2196229","volume":"7","author":"WH Ip","year":"2012","unstructured":"Ip WH, Wang D, Cho V (2012) Aircraft ground service scheduling problems and their genetic algorithm with hybrid assignment and sequence encoding scheme. IEEE Syst J 7(4):649\u2013657","journal-title":"IEEE Syst J"},{"issue":"1","key":"1815_CR14","first-page":"954","volume":"10","author":"Y Liu","year":"2022","unstructured":"Liu Y, Wu J, Tang J, Wang W, Wang X (2022) Scheduling optimisation of multi-type special vehicles in an airport. Transp B Transp Dyn 10(1):954\u2013970","journal-title":"Transp B Transp Dyn"},{"issue":"04","key":"1815_CR15","doi-asserted-by":"crossref","first-page":"1950020","DOI":"10.1142\/S0217595919500209","volume":"36","author":"S Padr\u00f3n","year":"2019","unstructured":"Padr\u00f3n S, Guimarans D (2019) An improved method for scheduling aircraft ground handling operations from a global perspective. Asia-Pac J Oper Res 36(04):1950020","journal-title":"Asia-Pac J Oper Res"},{"issue":"2","key":"1815_CR16","first-page":"329","volume":"2","author":"AS Bhagade","year":"2012","unstructured":"Bhagade AS, Puranik PV (2012) Artificial bee colony (ABC) algorithm for vehicle routing optimization problem. Int J Soft Comput Eng 2(2):329\u2013333","journal-title":"Int J Soft Comput Eng"},{"key":"1815_CR17","doi-asserted-by":"crossref","first-page":"142977","DOI":"10.1109\/ACCESS.2020.3013951","volume":"8","author":"B Zhao","year":"2020","unstructured":"Zhao B, Gui H, Li H, Xue J (2020) Cold chain logistics path optimization via improved multi-objective ant colony algorithm. IEEE Access 8:142977\u2013142995","journal-title":"IEEE Access"},{"key":"1815_CR18","doi-asserted-by":"crossref","unstructured":"Xiao-jun L, Bin Z (2015) Study on optimization of logistics distribution routes based on opposition-based learning particle swarm optimization algorithm. Open Autom Control Syst J 7(1)","DOI":"10.2174\/1874444301507011318"},{"key":"1815_CR19","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2020.120824","volume":"259","author":"M Ganji","year":"2020","unstructured":"Ganji M et al (2020) A green multi-objective integrated scheduling of production and distribution with heterogeneous fleet vehicle routing and time windows. J Clean Prod 259:120824","journal-title":"J Clean Prod"},{"key":"1815_CR20","first-page":"1","volume":"2021","author":"Xiong","year":"2021","unstructured":"Xiong (2021) Research on cold chain logistics distribution route based on ant colony optimization algorithm. Discret Dyn Nat Soc 2021:1\u201310","journal-title":"Discret Dyn Nat Soc"},{"key":"1815_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.sbspro.2015.03.189","volume":"189","author":"E Jabir","year":"2015","unstructured":"Jabir E, Panicker VV, Sridharan R (2015) Multi-objective optimization model for a green vehicle routing problem. Proc Soc Behav Sci 189:33\u201339","journal-title":"Proc Soc Behav Sci"},{"key":"1815_CR22","doi-asserted-by":"crossref","unstructured":"Liu S et al (2018) Green vehicle routing optimization based on carbon emission and multiobjective hybrid quantum immune algorithm. Math Probl Eng 2018","DOI":"10.1155\/2018\/8961505"},{"issue":"2","key":"1815_CR23","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.ejor.2016.04.065","volume":"255","author":"V Fran\u00e7ois","year":"2016","unstructured":"Fran\u00e7ois V et al (2016) Large neighborhood search for multi-trip vehicle routing. Eur J Oper Res 255(2):422\u2013441","journal-title":"Eur J Oper Res"},{"key":"1815_CR24","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"J Nalepa","year":"2016","unstructured":"Nalepa J, Blocho M (2016) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput 20:2309\u20132327","journal-title":"Soft Comput"},{"key":"1815_CR25","first-page":"508","volume":"12","author":"J Lin","year":"2016","unstructured":"Lin J, Zhou W, Wolfson O (2016) Electric vehicle routing problem. Transp Res Proc 12:508\u2013521","journal-title":"Transp Res Proc"},{"key":"1815_CR26","volume":"204","author":"SF Attar","year":"2022","unstructured":"Attar SF et al (2022) Formulation and exact algorithms for electric vehicle production routing problem. Expert Syst Appl 204:117292","journal-title":"Expert Syst Appl"},{"key":"1815_CR27","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.cor.2018.11.005","volume":"103","author":"U Breunig","year":"2019","unstructured":"Breunig U et al (2019) The electric two-echelon vehicle routing problem. Comput Oper Res 103:198\u2013210","journal-title":"Comput Oper Res"},{"key":"1815_CR28","unstructured":"Bello I et al (2016) Neural combinatorial optimization with reinforcement learning. arXiv:1611.09940"},{"key":"1815_CR29","unstructured":"Nazari M et al (2018) Reinforcement learning for solving the vehicle routing problem. In: Advances in neural information processing systems, p 31"},{"key":"1815_CR30","unstructured":"Kool W, Van Hoof H, Welling M (2018) Attention, learn to solve routing problems! arXiv:1803.08475"},{"key":"1815_CR31","unstructured":"Khalil E et al (2017) Learning combinatorial optimization algorithms over graphs. In: Advances in neural information processing systems, p 30"},{"key":"1815_CR32","unstructured":"Joshi Chaitanya K, Laurent T, Bresson X (2019) An efficient graph convolutional network technique for the travelling salesman problem. arXiv:1906.01227"},{"key":"1815_CR33","unstructured":"Sundstr\u00f6m O, Binding C (2010) Optimization methods to plan the charging of electric vehicle fleets. In: Proceedings of the international conference on control, communication and power engineering. Citeseer, pp 28\u201329"},{"issue":"3","key":"1815_CR34","first-page":"193","volume":"9","author":"BL Miller","year":"1995","unstructured":"Miller BL, Goldberg DE (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Syst 9(3):193\u2013212","journal-title":"Complex Syst"},{"key":"1815_CR35","unstructured":"Deb K, Agrawal RB (1995) Simulated binary crossover for continuous search space. Complex Syst 9(2):115\u2013148"},{"key":"1815_CR36","first-page":"30","volume":"26","author":"K Deb","year":"1996","unstructured":"Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inform 26:30\u201345","journal-title":"Comput Sci Inform"},{"issue":"2","key":"1815_CR37","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"1815_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2020.02.066","volume":"522","author":"Y Zhang","year":"2020","unstructured":"Zhang Y et al (2020) Enhancing MOEA\/D with information feedback models for large-scale many-objective optimization. Inf Sci 522:1\u201316","journal-title":"Inf Sci"},{"issue":"2\u20134","key":"1815_CR39","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1504\/IJVD.2019.109869","volume":"80","author":"G Dhiman","year":"2019","unstructured":"Dhiman G, Kaur A (2019) HKn-RVEA: a novel many-objective evolutionary algorithm for car side impact bar crashworthiness problem. Int J Veh Design 80(2\u20134):257\u2013284","journal-title":"Int J Veh Design"},{"issue":"2","key":"1815_CR40","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1109\/TEVC.2023.3265347","volume":"28","author":"L Zhao","year":"2023","unstructured":"Zhao L, Zhang Q (2023) Hypervolume-guided decomposition for parallel expensive multiobjective optimization. IEEE Trans Evol Comput 28(2):432\u2013444","journal-title":"IEEE Trans Evol Comput"},{"key":"1815_CR41","doi-asserted-by":"crossref","first-page":"93882","DOI":"10.1109\/ACCESS.2020.2984660","volume":"8","author":"Y Shen","year":"2020","unstructured":"Shen Y, Liu M, Yang J, Shi Y, Middendorf M (2020) A hybrid swarm intelligence algorithm for vehicle routing problem with time windows. IEEE Access 8:93882\u201393893","journal-title":"IEEE Access"},{"key":"1815_CR42","volume":"84","author":"Q Wu","year":"2024","unstructured":"Wu Q, Xia X, Song H, Zeng H, Xu X, Zhang Y, Wu H (2024) A neighborhood comprehensive learning particle swarm optimization for the vehicle routing problem with time windows. Swarm Evol Comput 84:101425","journal-title":"Swarm Evol Comput"},{"key":"1815_CR43","unstructured":"Chiroma H, Abdulkareem S, Abubakar A, Zeki A, Gital AYU, Usman MJ (2013) Correlation study of genetic algorithm operators: crossover and mutation probabilities. In: Proceedings of the international symposium on mathematical sciences and computing research, pp 6\u20137"},{"key":"1815_CR44","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz R, Pan QK, Naderi B (2019) Iterated greedy methods for the distributed permutation flowshop scheduling problem. Omega 83:213\u2013222","journal-title":"Omega"},{"issue":"6","key":"1815_CR45","first-page":"2425","volume":"50","author":"JQ Li","year":"2019","unstructured":"Li JQ, Song MX, Wang L, Duan PY, Han YY, Sang HY, Pan QK (2019) Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs. IEEE Trans Cybern 50(6):2425\u20132439","journal-title":"IEEE Trans Cybern"},{"key":"1815_CR46","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101576","volume":"87","author":"P Duan","year":"2024","unstructured":"Duan P, Yu Z, Gao K, Meng L, Han Y, Ye F (2024) Solving the multi-objective path planning problem for mobile robot using an improved NSGA-II algorithm. Swarm Evol Comput 87:101576","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"1815_CR47","first-page":"954","volume":"10","author":"Y Liu","year":"2022","unstructured":"Liu Y, Wu J, Tang J, Wang W, Wang X (2022) Scheduling optimisation of multi-type special vehicles in an airport. Transp B Transp Dyn 10(1):954\u2013970","journal-title":"Transp B Transp Dyn"},{"issue":"4","key":"1815_CR48","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0169-7439(89)80095-4","volume":"6","author":"L St","year":"1989","unstructured":"St L, Wold S (1989) Analysis of variance (ANOVA). Chemom Intell Lab Syst 6(4):259\u2013272","journal-title":"Chemom Intell Lab Syst"},{"issue":"4","key":"1815_CR49","first-page":"840","volume":"218","author":"LJ Williams","year":"2010","unstructured":"Williams LJ, Abdi H (2010) Fisher\u2019s least significant difference (LSD) test. Encycl Res Design 218(4):840\u2013853","journal-title":"Encycl Res Design"},{"issue":"5","key":"1815_CR50","first-page":"22","volume":"2","author":"MC Shingala","year":"2015","unstructured":"Shingala MC, Rajyaguru A (2015) Comparison of post hoc tests for unequal variance. Int J New Technol Sci Eng 2(5):22\u201333","journal-title":"Int J New Technol Sci Eng"},{"issue":"5","key":"1815_CR51","doi-asserted-by":"crossref","first-page":"726","DOI":"10.2105\/AJPH.86.5.726","volume":"86","author":"M Aickin","year":"1996","unstructured":"Aickin M, Gensler H (1996) Adjusting for multiple testing when reporting research results: the Bonferroni vs Holm methods. Am J Public Health 86(5):726\u2013728","journal-title":"Am J Public Health"},{"issue":"1","key":"1815_CR52","first-page":"1","volume":"3","author":"H Abdi","year":"2010","unstructured":"Abdi H, Williams LJ (2010) Tukey\u2019s honestly significant difference (HSD) test. Encycl Res Design 3(1):1\u20135","journal-title":"Encycl Res Design"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01815-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01815-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01815-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T21:25:59Z","timestamp":1743369959000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01815-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,13]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1815"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01815-x","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,13]]},"assertion":[{"value":"26 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Conflict of interest on behalf of all authors, the corresponding author states that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"209"}}