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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wen J, Li B, Wang QR, Du W (2005) Graph coloring model and algorithm of gate assignment airport. Syst Eng-Theor Methodol Appl 14(2):136–140
Gosling GD (1990) Design of an expert system for aircraft gate assignment. Transp Res A 24(1):59–69
Su YY, Srihari KA (1993) Knowledge based aircraft gate assignment advisor. Comput Ind Eng 25(2):123–126
Xu J, Bailey G (2001) The airport gate assignment problem: mathematical model and a tabu search algorithm. In: Proceeding of the 34th Hawaii international conference on system sciences IEEE, pp 102–111
Ding H, Lim A, Rodrigues B et al (2004) Aircraft and gate scheduling optimization at airports. In: Proceeding of the 37th international conference on system sciences IEEE, pp 74–81
Li W, Liu C, Tu F (2006) Optimized assignment of civil airport gate. J Nanjing Univ Acronautics and Astronautics 38(4):433–437
Chen T, Guixi X (2005) Airport parking-position assignments strategy based on GA. Comput Eng 31(3):186–188
Adleman LM (1994) Molecular computation of solution to combinational problem. Science 266(5187):1021–1024
Ouyang Q, Kaplan PD, Liu S et al (1997) DNA solution of the maximal clique problem. Science 278(5337):446–449
Liu Q, Wang L, Frutos AG et al (2000) DNA computing on surfaces. Nature 403(6766):175–179
Braich RS, Chelyapov N, Johnson C et al (2000) Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296:499–502
Yin ZX, Pan LQ, Shi XL (2006) DNA algorithm of minimal spanning tree. In: Proceedings of SPIE, vol 6358. pp 1–5
Braaksma JP, Shortreed JH (1971) Improving airport gate usage with critical path. Transp Eng ASCE 97(2):187–203
Babic O, Teddorovic D, Tosic V (1984) Aircraft stand assignment to minimize walking. J Transp Eng 110(1):55–66
Mangoubi DFX, Mathaisel RS (1985) Optimizing gate assignments at airport terminals. Transp Sci 19:173–188
Chang G, Wei SM (2006) Study of model based on combinatorial optimization for aircraft stands assignment. J Civ Aviat Univ China 24(3):28–31
Yan S, Huo C (2001) Optimization of multiple objective gate assignment. Transp Res 35A:413–432
Acknowledgments
The authors sincerely appreciate the encouraging comments of the Editor of the journal on this paper. They also wish to thank an anonymous referee of this paper who provided many useful and constructive suggestions for the improvement of this paper. Finally, thanks to all the authors that appear in the references. This paper supported by CNSF (Grant number: 60873144, 61170172, 61073102, 60973050).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, Z., Chen, M., Li, Q. (2013). Algorithm of DNA Computing Model for Gate Assignment Problem. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-37502-6_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37501-9
Online ISBN: 978-3-642-37502-6
eBook Packages: EngineeringEngineering (R0)