Abstract
A new type of adaptive evolutionary algorithm that combines two genetic algorithms using mutation matrix is developed based on an adaptive resource allocation of CPU time. Performance evaluations are made on the airport scheduling problem with constraint. The two genetic algorithms used are based on the construction of the mutation matrix M(t), which is problem independent as it uses the fitness distribution in the population and the statistical information of the locus only. The mutation matrix is parameter free and adaptive since the matrix elements are time dependent and inherits the information accumulated from past generations. A self-adaptive time sharing method is introduced to allocate resource to the two different strategies, which uses the theory of mean-variance analysis in portfolio management. The application to airport scheduling demonstrates that the self-adaptive mutation only genetic algorithm is able to provide quality solutions efficiently.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Holland, J.H.: Adaptive in natural and artificial system. University of Michigan, Ann Arbor (1975)
Goldberg, D.E.: Genetic algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Ma, C.W., Szeto, K.Y.: Locus Oriented Adaptive Genetic Algorithm: Application to the Zero/One Knapsack Problem. In: Proceeding of The 5th International Conference on Recent Advances in Soft Computing, RASC 2004, Nottingham, U.K, pp. 410–415 (2004)
Li, S.P., Szeto, K.Y.: Cryptoarithmetic problem using parallel Genetic Algorithms. In: 5th International Conference on Soft Computing, Mendl 1999, Brno University of Technology, Czech, June 9-12, 1999, pp. 82–87 (1999)
Zhao, S.Y., Szeto, K.Y.: preprint (2008)
Szeto, K.Y., Zhang, J.: Adaptive Genetic Algorithm and Quasi-parallel Genetic Algorithm: Application to Knapsack Problem. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds.) LSSC 2005. LNCS, vol. 3743, pp. 189–196. Springer, Heidelberg (2006)
Law, N.L., Szeto, K.Y.: Adaptive Genetic Algorithm with Mutation and Crossover Matrices. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI 2007) (Volume II) Theme: Al and Its Benefits to Society, International Joint Conferences on Artificial Intelligence, IJCAI-0, Hyderabad, India, January 6-12, 2007, pp. 2330–2333 (2007)
Markowitz, H.: Portfolio Selection. In: Journal of Finance, vol. 7(1), pp. 77–91. Blackwell Publishing, Oxford (1952)
Gilbo, E.P.: Optimizing Airport Capacity Utilization in Air Traffic Flow Management Subject to Constraints at Arrival and Departure Fixes. IEEE Transactions on Control Systems Technology, 490–503 (1997)
Vermorel, J., Mohri, M.: Multi-Armed Bandit Algorithms and Empirical Valuation. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 437–448. Springer, Heidelberg (2005)
Jinling, J., Ding, J., Wang, H.: Optimization of Airport Flight Arrival and Departure Based on Compromise Immune Algorithm. In: ICNC (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shiu, K.L., Szeto, K.Y. (2008). Self-adaptive Mutation Only Genetic Algorithm: An Application on the Optimization of Airport Capacity Utilization. In: Fyfe, C., Kim, D., Lee, SY., Yin, H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2008. IDEAL 2008. Lecture Notes in Computer Science, vol 5326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88906-9_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-88906-9_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88905-2
Online ISBN: 978-3-540-88906-9
eBook Packages: Computer ScienceComputer Science (R0)