Algorithm of DNA computing model for gate assignment problem

Abstract

In the core of airport operation, aircraft stands assignment (ASA) is a typical kind of combinatorial optimization. In this paper, by analyzing the ASA problem, gate assignment problem is transferred to vertex coloring model. A DNA computing model for airport gate assignment is proposed. The simulation results show that the algorithm compared with other optimization is very easy and feasible. © Springer-Verlag Berlin Heidelberg 2013.