2008 | OriginalPaper | Chapter
Self-adaptive Mutation Only Genetic Algorithm: An Application on the Optimization of Airport Capacity Utilization
Authors : King Loong Shiu, K. Y. Szeto
Published in: Intelligent Data Engineering and Automated Learning – IDEAL 2008
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.