Solving airport gate assignment problem using an improved genetic algorithm with dynamic topology

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The rapid growth of air transportation demand led to numerous studies on the airport gate assignment problem (AGAP). As the problem scale gets larger, mathematical programming is no longer available, and heuristic methods like genetic algorithm (GA) have been applied. Taking into account of adding soft constraint to the model and ameliorate objective value of the AGAP, this paper proposes an improved GA considering structural properties to avoid GA’s prematurity. A dynamic topology integrated in crossover operator contributes to a better tradeoff between convergence speed and quality of solutions. Finally, experimental results illustrate the effectiveness of the proposed improved GA to solve AGAP in comparison with traditional GA and a reliable commercial software CPLEX CP Optimizer.

Cite

CITATION STYLE

APA

Xu, R., & Cai, K. (2019). Solving airport gate assignment problem using an improved genetic algorithm with dynamic topology. In Advances in Intelligent Systems and Computing (Vol. 752, pp. 877–884). Springer Verlag. https://doi.org/10.1007/978-981-10-8944-2_102

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free