Skip to main content
SpringerLink
Log in

Modified imperialist competitive algorithm for aircraft landing scheduling problem

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In recent years, airport runways have become a more critical bottleneck in airports, and it is very unusual to use only one runway to solve the Aircraft Landing Problem (ALP). The ALP includes the aircraft's landing scheduling and assigning them to runways. In addition to certain limited time frames for aircraft while landing, to prevent accidents, the distance between aircraft should be restricted during the flight and in the landing phase. In this paper, to solve the problem in multi-runway mode, a solution is proposed that has considered all the limitations to create a trade-off between the runways to reduce the traffic in the runways. The present study considers the balance between bands and offers a new method of improving the Imperialist Competitive Algorithm (ICA) while reducing the cost due to the early and late landing of the aircraft. In other words, a novel approach for addressing the ALP with multiple criteria, employing a delay and early landing cost optimization technique and runway balance strategy, as well as using multi-runway, which will reflect the current realities of the aviation industry and provide a more accurate and relevant analysis, has been presented. Thirty-two benchmark instances were selected and compared with four famous algorithms: Particle Swarm Optimization (PSO), Immunoglobulin-Based Artificial Immune System (IAIS), Grey Wolf Optimizer (GWO), and flower pollination algorithm (FPA) as the results on a small-scale indicate, the ICA method performs superior outcomes, except for one case. Regarding the two objectives, the presented method, compared to other methods, managed to reduce the cost by 3.5% (on a small-scale). Furthermore, on a large scale (500 aircraft), improved ICA has been able to reduce the cost of the early or late arrival of the aircraft by 35%.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Data availability

No datasets were generated or analyzed during the current study.

References

  1. Sabar NR, Kendall G (2015) An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega 56:88–98

    Article  Google Scholar 

  2. Diamantis Z, Tsahalis D, Borchers I (2002) Optimization of an active noise control system inside an aircraft, based on the simultaneous optimal positioning of microphones and speakers, with the use of a genetic algorithm. Comput Optim Appl 23:65–76

    Article  MathSciNet  Google Scholar 

  3. Su J et al (2023) A large neighborhood search algorithm with simulated annealing and time decomposition strategy for the aircraft runway scheduling problem. Aerospace 10(2):177

    Article  Google Scholar 

  4. Câmara Á, et al (2016) A comparative study of meta-heuristics for the aircraft landing scheduling problem. In: 2016 11th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1–4

  5. Bertsimas D, Frankovich M (2016) Unified optimization of traffic flows through airports. Transp Sci 50:77–93

    Article  Google Scholar 

  6. Sun X et al (2023) Air transportation and COVID-19: a tale with three episodes. Transport Economics and Management 1:13–21

    Article  PubMed Central  Google Scholar 

  7. Ng KKH et al (2017) Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach. Transp Res Part E Log Transp Rev 106(1):115–136

    Article  MathSciNet  Google Scholar 

  8. Velilani K, Subramanya V, Chowdaiah P (2022) An algorithm for efficient real-time airplane landing scheduling. ECS Trans 107(1):69

    Article  CAS  ADS  Google Scholar 

  9. Fan Y, Kalaba RE, Moore JE (2005) Arriving on time. J Optim Theory Appl 127:497–513

    Article  MathSciNet  Google Scholar 

  10. Bojanowski L, Harikiopoulo D, Neogi NA (2011) Multi-runway aircraft sequencing at congested airports. In: Proceedings of the 2011 American Control Conference, pp 2752–2758

  11. Liang M, Delahaye D, Maréchal P (2017) Integrated sequencing and merging aircraft to parallel runways with automated conflict resolution and advanced avionics capabilities. Transp Res Part C—Emerging Technol 85:268–291

    Article  Google Scholar 

  12. Shambour MK, Abu-Hashem MA (2023) Optimizing airport slot scheduling problem using optimization algorithms. Soft Comput 27(12):7939–7955

    Article  PubMed  PubMed Central  Google Scholar 

  13. Visser HG (1991) Terminal area traffic management. Prog Aerosp Sci 28(4):323–368

    Article  Google Scholar 

  14. Mokhtarimousavi S, Rahami H, Kaveh A (2015) Multi-objective mathematical modeling of aircraft landing problem on a runway in static mode, scheduling and sequence determination using NSGA-II. Int J Optim Civil Eng 5(1):21–36

  15. Dönmez K, Çetek C, Kaya O (2022) Air traffic management in parallel-point merge systems under wind uncertainties. J Air Transp Manag 104:102268

    Article  Google Scholar 

  16. Dönmez K, Çetek C, Kaya O (2022) Aircraft sequencing and scheduling in parallel-point merge systems for multiple parallel runways. Transp Res Rec 2676(3):108–124

    Article  Google Scholar 

  17. Ng K, Lee C (2016) A modified variable neighborhood search for aircraft landing problem. In: 2016 IEEE International Conference on Management of Innovation and Technology (ICMIT). IEEE

  18. Haouari M et al (2011) Exact approaches for integrated aircraft fleeting and routing at TunisAir. Comput Optim Appl 49:213–239

    Article  MathSciNet  Google Scholar 

  19. Balakrishnan H, Chandran BG (2010) Algorithms for scheduling runway operations under constrained position shifting. Oper Res 58(6):1650–1665

    Article  MathSciNet  Google Scholar 

  20. Beasley JE et al (2000) Scheduling aircraft landings—the static case. Transp Sci 34(2):180–197

    Article  Google Scholar 

  21. Faye A (2015) Solving the aircraft landing problem with time discretization approach. Eur J Oper Res 242(3):1028–1038

    Article  MathSciNet  Google Scholar 

  22. Prakash R, Piplani R, Desai J (2018) An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput. Transp Res Part C: Emerging Technol 95:570–581

    Article  Google Scholar 

  23. Bartholomew-Biggs MC, Parkhurst SC, Wilson SP (2002) Using DIRECT to solve an aircraft routing problem. Comput Optim Appl 21:311–323

    Article  MathSciNet  Google Scholar 

  24. Zhang J, et al (2023) Dynamic optimal scheduling model of multi runway flight arrival and departure based on improved genetic algorithm. In: 2023 International Conference on Networking, Informatics and Computing (ICNETIC). IEEE.

  25. Kjenstad D, et al. (2013) Integrated surface and departure management at airports by optimization. In: 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), pp 1–5

  26. Ernst AT, Krishnamoorthy M, Storer RH (1999) Heuristic and exact algorithms for scheduling aircraft landings. Netw: Int J 34(3):229–241

    Article  Google Scholar 

  27. Anosri S, Panagant N, Champasak P et al (2023) A Comparative Study of State-of-the-art Metaheuristics for Solving Many-objective Optimization Problems of Fixed Wing Unmanned Aerial Vehicle Conceptual Design. Arch Computat Methods Eng 30(6):3657–3671

  28. Gao J, Zhu X, Zhang R (2023) Optimization of parallel test task scheduling with constraint satisfaction. J Supercomput 79(7):7206–7227

    Article  Google Scholar 

  29. Girish B (2016) An efficient hybrid particle swarm optimization algorithm in a rolling horizon framework for the aircraft landing problem. Appl Soft Comput 44:200–221

    Article  Google Scholar 

  30. Vincent FY et al (2021) An improved immunoglobulin-based artificial immune system for the aircraft scheduling problem with alternate aircrafts. IEEE Access 9:16532–16545

    Article  Google Scholar 

  31. Teimoori M et al (2021) A multi-objective grey wolf optimization algorithm for aircraft landing problem. J Appl Res Ind Eng 8(4):386–398

    Google Scholar 

  32. Zhou G, Wang R, Zhou Y (2018) Flower pollination algorithm with runway balance strategy for the aircraft landing scheduling problem. Clust Comput 21:1543–1560

    Article  Google Scholar 

  33. Cheng Y, Cao Z, Zhang X et al (2023) Multi objective dynamic task scheduling optimization algorithm based on deep reinforcement learning. J Supercomput. https://doi.org/10.1007/s11227-023-05714-1

  34. Tian Z et al (2023) Dynamic energy-efficient scheduling of multi-variety and small batch flexible job-shop: a case study for the aerospace industry. Comput Ind Eng 178:109111

    Article  Google Scholar 

  35. Tian Z, Jiang X, Tian G, Li Z, Liu W (2023) Knowledge-based lot-splitting optimization method for flexible job shops considering energy consumption. IEEE Trans Autom Sci Eng. https://doi.org/10.1109/TASE.2023.3303915

  36. Phirouzabadi AM, Aminnayeri M, Mahmoudian M (2013) Aircraft landing scheduling based on unavailability of runway constraint through a time segment heuristic method. Int J Informat Commun Technol 2:175–182

    Google Scholar 

  37. Zhang J et al (2020) Criteria selection and multi-objective optimization of aircraft landing problem. J Air Transp Manag 82:101734

    Article  Google Scholar 

  38. Chen H, Solak S (2015) Lower cost arrivals for airlines: Optimal policies for managing runway operations under optimized profile descent. Prod Oper Manag 24(3):402–420

    Article  Google Scholar 

  39. Rezaei H, et al. (2018) An iterative bidding approach applied to cost reduction in the context of aircraft landing problem. In: 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design (CSCWD). IEEE

  40. Vadlamani S, Hosseini S (2014) A novel heuristic approach for solving aircraft landing problem with single runway. J Air Transp Manag 40:144–148

    Article  Google Scholar 

  41. Ahmadian M.M, Salehipour A (2022) Heuristics for flights arrival scheduling at airports. Int Trans Oper Res 29(4):2316–2345

  42. Lieder A, Stolletz R (2016) Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways. Transp Res Part E: Log Transp Rev 88:167–188

    Article  Google Scholar 

  43. Awasthi A, Kramer O, Lässig J (2013) Aircraft landing problem: an efficient algorithm for a given landing sequence. In: 2013 IEEE 16th International Conference on Computational Science and Engineering. IEEE

  44. Pan Z, Lei D, Zhang Q (2018) A new imperialist competitive algorithm for multiobjective low carbon parallel machines scheduling. Math Probl Eng 2018:1–13

  45. Sedighizadeh M, Eisapour-Moarref A (2017) The imperialist competitive algorithm for optimal multi-objective location and sizing of DSTATCOM in distribution systems considering loads uncertainty. INAE Lett 2:83–95

    Article  Google Scholar 

  46. Hosseini S, Al Khaled A (2014) A survey on the imperialist competitive algorithm metaheuristic: implementation in engineering domain and directions for future research. Appl Soft Comput 24:1078–1094

    Article  Google Scholar 

  47. Daley A et al (2012) Measuring entanglement growth in quench dynamics of bosons in an optical lattice. Phys Rev Lett 109(2):020505

    Article  CAS  PubMed  ADS  Google Scholar 

  48. Perboli G et al (2015) Flights and their economic impact on the airport catchment area: an application to the Italian tourist market. J Optim Theory Appl 164:1109–1133

    Article  MathSciNet  Google Scholar 

  49. Pinol H, Beasley JE (2006) Scatter search and bionomic algorithms for the aircraft landing problem. Eur J Oper Res 171(2):439–462

    Article  Google Scholar 

  50. Salehipour A, Modarres M, Naeni LM (2013) An efficient hybrid meta-heuristic for aircraft landing problem. Comput Oper Res 40(1):207–213

    Article  MathSciNet  Google Scholar 

  51. Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE Congress on Evolutionary Computation. IEEE

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran

    Kimia Shirini & Hadi S. Aghdasi

  2. Department of Electrical Engineering, National Taiwan Normal University, Taipei, Taiwan

    Saeed Saeedvand

Authors
  1. Kimia Shirini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hadi S. Aghdasi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Saeed Saeedvand
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Kimia Shirini contributed to conceptualization, data curation, formal analysis, investigation, methodology, software, validation, visualization, and writing—original draft. Hadi S. Aghdasi contributed to conceptualization, data curation, formal analysis, investigation, methodology, project administration, supervision, software, validation, visualization, writing—review and editing. Saeed Saeedvand contributed to conceptualization, formal analysis, investigation, methodology, supervision, software, validation, writing—review and editing.

Corresponding author

Correspondence to Hadi S. Aghdasi.

Ethics declarations

Conflict of interest

The authors declare no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shirini, K., Aghdasi, H.S. & Saeedvand, S. Modified imperialist competitive algorithm for aircraft landing scheduling problem. J Supercomput (2024). https://doi.org/10.1007/s11227-024-05999-w

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11227-024-05999-w

Keywords

Search

Navigation