Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Flood decision support system on agent grid: method and implementation
Enterprise Information Systems
A hybrid real-parameter genetic algorithm for function optimization
Advanced Engineering Informatics
Improving real-parameter genetic algorithm with simulated annealing for engineering problems
Advances in Engineering Software
Enterprise Information Systems
A survey of software adaptation in mobile and ubiquitous computing
Enterprise Information Systems
Healthcare information systems: data mining methods in the creation of a clinical recommender system
Enterprise Information Systems
Enterprise Information Systems
An Integrated Approach for Agricultural Ecosystem Management
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
An introduction to simulated evolutionary optimization
IEEE Transactions on Neural Networks
Notes on the simulation of evolution
IEEE Transactions on Neural Networks
Expert Systems with Applications: An International Journal
An inter-temporal resource emergency management model
Computers and Operations Research
Study on solution models and methods for the fuzzy assignment problems
Expert Systems with Applications: An International Journal
Random assignment method based on genetic algorithms and its application in resource allocation
Expert Systems with Applications: An International Journal
Hi-index | 12.06 |
As a new kind of intelligence optimization method, genetic algorithms, with the features of simple structure and strong adaptability, achieves great success in many real applications. However, it has many shortcomings such as a greater computation complexity and more chance of being trapped in local states. In this paper, through analyzing the deficiency of the existing genetic operation and the essential characteristics of creature evolution from the angle of improving evolution efficiency, we propose a compound mutation strategy based on mutation criteria function, a multi-reserved strategy based on intelligence evolution, and a weak arithmetic crossover strategy reflecting different evolution modes. Furthermore, we establish an intelligent bionic genetic algorithm with structural features (denoted by IB-GA, for short). Finally, we analyze the performances of IB-GA with the theory of Markov chains and simulation technology. The results indicate that IB-GA is essentially an extension of ordinary GA and obviously better than ordinary GA in terms of computation efficiency and convergence performance.