Fitness inheritance in genetic algorithms
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Improving PSO-Based multi-objective optimization using crowding, mutation and ∈-dominance
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Evolutionary hidden information detection by granulation-based fitness approximation
Applied Soft Computing
Hi-index | 0.00 |
In this paper, we propose a dynamic mechanism to vary the probability by which fitness inheritance is applied throughout the run of a multi-objective particle swarm optimizer, in order to obtain a greater reduction in computational cost (than the obtained with a fixed probability), without dramatically affecting the quality of the results. The results obtained show that it is possible to reduce the computational cost by 32% without affecting the quality of the obtained Pareto front.