Algorithm of DNA Computing Model for Gate Assignment Problem
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 air
- PDF / 1,705,482 Bytes
- 7 Pages / 439.37 x 666.142 pts Page_size
- 70 Downloads / 173 Views
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. Keywords Gate assignment
Vertex coloring DNA computing
1 Introduction Airport gate assignment [1] is an important decision making problem which involves multiple and conflict objectives in airport. In certain extent, command center of airport assign boarding gate to scheduled flight, confirm flights are operating normally, serve passengers boarding gate. Airport gate assignment problem mainly solves two problems: time and the space of flights occupy. It has relationship with the kinds of scheduled flights, arrival and departure intensive degree, equipment of airport, and flight distribution method. The main purpose is assigning flights or aircraft to appropriate terminal and ramp positions (gates) and maintaining safety, security, cost efficiency and conveniences to passengers.
Z. Yin (&) M. Chen Q. Li Anhui University Of Science and Technology, Huainan, Anhui, People’s Republic of China e-mail: [email protected] M. Chen e-mail: [email protected] Q. Li e-mail: [email protected]
Z. Yin et al. (eds.), Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013, Advances in Intelligent Systems and Computing 212, DOI: 10.1007/978-3-642-37502-6_37, Ó Springer-Verlag Berlin Heidelberg 2013
299
300
Z. Yin et al.
The key to solve this question is to establish apportion model of airport gate assignment and optimize. The task is a real-world decision problem which involves multiple and conflicting objective while respecting various constraints, and a number of mathematical models and analytical tools have been developed by researchers in recent years. There are two main optimization objectives, one is expert system [2, 3], allocation principle based on establishing knowledge base system, consider more non-quantitative criterion; the other is mathematical programming, minimizing the total walking distance, using 0–1 integer programming to discuss the feasibility of assignment and how to assign. Flight delays are quite universal in real-life, and the initial assignments would be disrupted easily even with unexpected changes of flight schedules [4–8]. Models have been proposed to achieve the even distributions of gate idle times by minimizing dispersion of idle time periods for static aircraft-gate assignment problem. Xu created mathematical model based on minimum time of passenger to transfer, adopted tabu search (TS) algorithm [9]. Ding considering the limit resource of airport, improve Xu’s algorithm [10]. Li [11] solve the question by the matching between time and space, establish mathematics model, use tabu search (TS) algorithm to optimize. Tian Ch
Data Loading...
