Skip to main content
Erschienen in: Cluster Computing 3/2018

23.02.2018

Flower pollination algorithm with runway balance strategy for the aircraft landing scheduling problem

verfasst von: Guo Zhou, Rui Wang, Yongquan Zhou

Erschienen in: Cluster Computing | Ausgabe 3/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Aircraft landing scheduling is a challenging problem in the field of air traffic, whose objective is to determine the best combination of assigning the sequence and corresponding landing time for a given set of aircraft to a runway, and then minimize the sum of the deviations of the actual and target landing times under the condition of safe landing. In this paper, a flower pollination algorithm embedded with runway balance is proposed to solve it. Context cognitive learning and runway balance strategy are devised here to enhance its searching ability. 36 scheduling instances are selected from OR-Library to validate its performance. The experimental results show that the proposed algorithm can get the optimal solutions for instances up to 100 aircrafts, and is also capable of obtaining better solutions compared with SS, BA and FCFS for instances up to 500 aircrafts in a shorter time.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
4.
Zurück zum Zitat Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., et al.: Scheduling aircraft landings—the static case. Transp. Sci. 34(2), 180–197 (2000)CrossRef Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., et al.: Scheduling aircraft landings—the static case. Transp. Sci. 34(2), 180–197 (2000)CrossRef
5.
Zurück zum Zitat Pinol, H., Beasley, J.E.: Scatter search and bionomic algorithms for the aircraft landing problem. Eur. J. Oper. Res. 171(2), 439–462 (2006)CrossRef Pinol, H., Beasley, J.E.: Scatter search and bionomic algorithms for the aircraft landing problem. Eur. J. Oper. Res. 171(2), 439–462 (2006)CrossRef
6.
Zurück zum Zitat Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29, 653–684 (2000)MathSciNetMATH Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29, 653–684 (2000)MathSciNetMATH
7.
Zurück zum Zitat Ernst, A.T., Krishnamoorthy, M., Storer, R.H.: Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3), 229–241 (1999)CrossRef Ernst, A.T., Krishnamoorthy, M., Storer, R.H.: Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3), 229–241 (1999)CrossRef
8.
9.
Zurück zum Zitat Bäuerle, N., Engelhardt-Funke, O., Kolonko, M.: On the waiting time of arriving aircrafts and the capacity of airports with one or two runways. Eur. J. Oper. Res. 177(2), 1180–1196 (2007)CrossRef Bäuerle, N., Engelhardt-Funke, O., Kolonko, M.: On the waiting time of arriving aircrafts and the capacity of airports with one or two runways. Eur. J. Oper. Res. 177(2), 1180–1196 (2007)CrossRef
10.
Zurück zum Zitat Hu, X.B., Di Paolo, E.: An efficient genetic algorithm with uniform crossover for air traffic control. Comput. Oper. Res. 36(1), 245–259 (2009)CrossRef Hu, X.B., Di Paolo, E.: An efficient genetic algorithm with uniform crossover for air traffic control. Comput. Oper. Res. 36(1), 245–259 (2009)CrossRef
11.
Zurück zum Zitat Bencheikh, G., Boukachour, J., Alaoui, A.E.H.: Improved ant colony algorithm to solve the aircraft landing problem. Int. J. Comput. Theory Eng. 3(2), 224–233 (2011)CrossRef Bencheikh, G., Boukachour, J., Alaoui, A.E.H.: Improved ant colony algorithm to solve the aircraft landing problem. Int. J. Comput. Theory Eng. 3(2), 224–233 (2011)CrossRef
12.
Zurück zum Zitat Salehipour, A., Modarres, M., Naeni, L.M.: An efficient hybrid meta-heuristic for aircraft landing problem. Comput. Oper. Res. 40(1), 207–213 (2013)MathSciNetCrossRef Salehipour, A., Modarres, M., Naeni, L.M.: An efficient hybrid meta-heuristic for aircraft landing problem. Comput. Oper. Res. 40(1), 207–213 (2013)MathSciNetCrossRef
13.
Zurück zum Zitat Yu, S.P., Cao, X.B., Zhang, J.: A real-time schedule method for Aircraft Landing Scheduling problem based on Cellular Automation. Appl. Soft Comput. 11(4), 3485–3493 (2011)CrossRef Yu, S.P., Cao, X.B., Zhang, J.: A real-time schedule method for Aircraft Landing Scheduling problem based on Cellular Automation. Appl. Soft Comput. 11(4), 3485–3493 (2011)CrossRef
14.
Zurück zum Zitat Yang, X.S.: Flower Pollination Algorithm for Global Optimization. Unconventional Computation and Natural Computation, pp. 240–249. Springer, Berlin (2012)CrossRef Yang, X.S.: Flower Pollination Algorithm for Global Optimization. Unconventional Computation and Natural Computation, pp. 240–249. Springer, Berlin (2012)CrossRef
15.
Zurück zum Zitat Yang, X.S., Karamanoglu, M., He, X.: Multi-objective flower algorithm for optimization. Procedia Comput. Sci. 18, 861–868 (2013)CrossRef Yang, X.S., Karamanoglu, M., He, X.: Multi-objective flower algorithm for optimization. Procedia Comput. Sci. 18, 861–868 (2013)CrossRef
16.
Zurück zum Zitat Yang, X.S., Karamanoglu, M., He, X.: Flower pollination algorithm: a novel approach for multiobjective optimization. Eng. Optim. 46(9), 1222–1237 (2014)MathSciNetCrossRef Yang, X.S., Karamanoglu, M., He, X.: Flower pollination algorithm: a novel approach for multiobjective optimization. Eng. Optim. 46(9), 1222–1237 (2014)MathSciNetCrossRef
17.
Zurück zum Zitat Sharawi, M., Emary, E., Saroit, I.A., et al.: Flower pollination optimization algorithm for wireless sensor network lifetime global optimization. Int. J. Soft Comput. Eng. 4(3), 54–59 (2014) Sharawi, M., Emary, E., Saroit, I.A., et al.: Flower pollination optimization algorithm for wireless sensor network lifetime global optimization. Int. J. Soft Comput. Eng. 4(3), 54–59 (2014)
18.
Zurück zum Zitat Prathiba, R., Moses, M.B., Sakthivel, S.: Flower pollination algorithm applied for different economic load dispatch problems. Int. J. Eng. Technol. 6(2), 1009–1016 (2014) Prathiba, R., Moses, M.B., Sakthivel, S.: Flower pollination algorithm applied for different economic load dispatch problems. Int. J. Eng. Technol. 6(2), 1009–1016 (2014)
19.
Zurück zum Zitat Abdel-Raouf, O., El-Henawy, I., Abdel-Baset, M.: A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles. J. Mod. Educ. Comput. Sci. 6, 38–44 (2014)CrossRef Abdel-Raouf, O., El-Henawy, I., Abdel-Baset, M.: A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles. J. Mod. Educ. Comput. Sci. 6, 38–44 (2014)CrossRef
20.
Zurück zum Zitat El-henawy, I., Ismail, M.: An improved chaotic flower pollination algorithm for solving large integer programming problems. Int. J. Digit. Content Technol. Appl. 8(3), 72 (2014) El-henawy, I., Ismail, M.: An improved chaotic flower pollination algorithm for solving large integer programming problems. Int. J. Digit. Content Technol. Appl. 8(3), 72 (2014)
21.
Zurück zum Zitat Abdel-Raouf, O., Abdel-Baset, M., El-henawy, I.: A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int. J. Appl. 4(2), 1–13 (2014) Abdel-Raouf, O., Abdel-Baset, M., El-henawy, I.: A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int. J. Appl. 4(2), 1–13 (2014)
22.
Zurück zum Zitat Abdel-Baset, M., Wu, H., Zhou, Y.: A complex encoding flower pollination algorithm for constrained engineering optimisation problems. IJMNO 8(2), 108–126 (2017)CrossRef Abdel-Baset, M., Wu, H., Zhou, Y.: A complex encoding flower pollination algorithm for constrained engineering optimisation problems. IJMNO 8(2), 108–126 (2017)CrossRef
23.
Zurück zum Zitat Zhou, Y., Wang, R., Luo, Q.: Elite opposition-based flower pollination algorithm. Neurocomputing 188, 294–310 (2016)CrossRef Zhou, Y., Wang, R., Luo, Q.: Elite opposition-based flower pollination algorithm. Neurocomputing 188, 294–310 (2016)CrossRef
24.
Zurück zum Zitat Zhou, Y., Wang, R.: An improved flower pollination algorithm for optimal unmanned undersea vehicle path planning problem. IJPRAI 30(4), 1659010 (2016) Zhou, Y., Wang, R.: An improved flower pollination algorithm for optimal unmanned undersea vehicle path planning problem. IJPRAI 30(4), 1659010 (2016)
25.
Zurück zum Zitat Wang, R., Zhou, Y., Qiao, S., Huang, K.: Flower pollination algorithm with bee pollinator for cluster analysis. Inf. Process. Lett. 116(1), 1–14 (2016)CrossRef Wang, R., Zhou, Y., Qiao, S., Huang, K.: Flower pollination algorithm with bee pollinator for cluster analysis. Inf. Process. Lett. 116(1), 1–14 (2016)CrossRef
28.
Zurück zum Zitat Levine, M.E.: Landing fees and the airport congestion problem. J. Law Econ. 12, 79–108 (1969)CrossRef Levine, M.E.: Landing fees and the airport congestion problem. J. Law Econ. 12, 79–108 (1969)CrossRef
29.
Zurück zum Zitat Vadlamani, S., Hosseini, S.: A novel heuristic approach for solving aircraft landing problem with single runway. J. Air Transp. Manag. 40, 144–148 (2014)CrossRef Vadlamani, S., Hosseini, S.: A novel heuristic approach for solving aircraft landing problem with single runway. J. Air Transp. Manag. 40, 144–148 (2014)CrossRef
30.
Zurück zum Zitat Mesgarpour, M., Potts, C.N., Bennell, J.A.: Models for aircraft landing optimization. In: Proceedings of the 4th International Conference on Research in Air Transportation (ICRAT2010) (2010) Mesgarpour, M., Potts, C.N., Bennell, J.A.: Models for aircraft landing optimization. In: Proceedings of the 4th International Conference on Research in Air Transportation (ICRAT2010) (2010)
31.
Zurück zum Zitat Abdul-Razaq, T.S., Ali, F.H.: Hybrid bees algorithm to solve aircraft landing problem. J. Zankoy Sulaimani. 17(1), 16–26 (2015) Abdul-Razaq, T.S., Ali, F.H.: Hybrid bees algorithm to solve aircraft landing problem. J. Zankoy Sulaimani. 17(1), 16–26 (2015)
32.
Zurück zum Zitat Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8(1), 687–697 (2008)CrossRef Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8(1), 687–697 (2008)CrossRef
33.
Zurück zum Zitat Karaboga, D., Gorkemli, B., Ozturk, C., et al.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21–57 (2014)CrossRef Karaboga, D., Gorkemli, B., Ozturk, C., et al.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21–57 (2014)CrossRef
34.
Zurück zum Zitat Deep, K., Thakur, M.: A new mutation operator for real coded genetic algorithms. Appl. Math. Comput. 193(1), 211–230 (2007)MathSciNetMATH Deep, K., Thakur, M.: A new mutation operator for real coded genetic algorithms. Appl. Math. Comput. 193(1), 211–230 (2007)MathSciNetMATH
35.
Zurück zum Zitat Das, S., Abraham, A., Chakraborty, U.K., et al.: Differential evolution using a neighborhood-based mutation operator. IEEE Trans. Evol. Comput. 13(3), 526–553 (2009)CrossRef Das, S., Abraham, A., Chakraborty, U.K., et al.: Differential evolution using a neighborhood-based mutation operator. IEEE Trans. Evol. Comput. 13(3), 526–553 (2009)CrossRef
36.
Zurück zum Zitat Daley, A.J., Pichler, H., Schachenmayer, J., et al.: Measuring entanglement growth in quench dynamics of bosons in an optical lattice. Phys. Rev. Lett. 109(2), 020505 (2012)CrossRef Daley, A.J., Pichler, H., Schachenmayer, J., et al.: Measuring entanglement growth in quench dynamics of bosons in an optical lattice. Phys. Rev. Lett. 109(2), 020505 (2012)CrossRef
37.
Zurück zum Zitat Da Rocha, J.M., Cerviño, S., Gutiérrez, M.J.: An endogenous bioeconomic optimization algorithm to evaluate recovery plans: an application to southern hake. ICES J. Mar. Sci. (Journal du Conseil) 67(9), 1957–1962 (2010)CrossRef Da Rocha, J.M., Cerviño, S., Gutiérrez, M.J.: An endogenous bioeconomic optimization algorithm to evaluate recovery plans: an application to southern hake. ICES J. Mar. Sci. (Journal du Conseil) 67(9), 1957–1962 (2010)CrossRef
38.
Zurück zum Zitat Ernst, R., Kueppers, P., Stindt, J., et al.: Multidrug efflux pumps: substrate selection in ATP-binding cassette multidrug efflux pumps–first come, first served. FEBS J. 277(3), 540–549 (2010)CrossRef Ernst, R., Kueppers, P., Stindt, J., et al.: Multidrug efflux pumps: substrate selection in ATP-binding cassette multidrug efflux pumps–first come, first served. FEBS J. 277(3), 540–549 (2010)CrossRef
Metadaten
Titel
Flower pollination algorithm with runway balance strategy for the aircraft landing scheduling problem
verfasst von
Guo Zhou
Rui Wang
Yongquan Zhou
Publikationsdatum
23.02.2018
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe 3/2018
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-2051-0

Weitere Artikel der Ausgabe 3/2018

Cluster Computing 3/2018 Zur Ausgabe