Preference-based evolutionary algorithm for airport surface operations

Citations of this article
Mendeley users who have this article in their library.


In addition to time efficiency, minimisation of fuel consumption and related emissions has started to be considered by research on optimisation of airport surface operations as more airports face severe congestion and tightening environmental regulations. Objectives are related to economic cost which can be used as preferences to search for a region of cost efficient and Pareto optimal solutions. A multi-objective evolutionary optimisation framework with preferences is proposed in this paper to solve a complex optimisation problem integrating runway scheduling and airport ground movement problem. The evolutionary search algorithm uses modified crowding distance in the replacement procedure to take into account cost of delay and fuel price. Furthermore, uncertainty inherent in prices is reflected by expressing preferences as an interval. Preference information is used to control the extent of region of interest, which has a beneficial effect on algorithm performance. As a result, the search algorithm can achieve faster convergence and potentially better solutions. A filtering procedure is further proposed to select an evenly distributed subset of Pareto optimal solutions in order to reduce its size and help the decision maker. The computational results with data from major international hub airports show the efficiency of the proposed approach.




Weiszer, M., Chen, J., Stewart, P., & Zhang, X. (2018). Preference-based evolutionary algorithm for airport surface operations. Transportation Research Part C: Emerging Technologies, 91, 296–316.

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