Niching methods for genetic algorithms
Niching methods for genetic algorithms
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Niching for Population-Based Ant Colony Optimization
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
Alternative solution representations for the job shop scheduling problem in ant colony optimisation
ACAL'07 Proceedings of the 3rd Australian conference on Progress in artificial life
Population-based ant colony optimisation for multi-objective function optimisation
ACAL'07 Proceedings of the 3rd Australian conference on Progress in artificial life
Hi-index | 0.00 |
In this paper a number of popular Computational Intelligence (CI) algorithms are used to tune Geodesy models, a radio astronomy problem. Several single and multiple objective variations of the Geodesy problem are examined with good results obtained using state-of-the-art CI algorithms. These novel applications are used to develop insights into methods for applying CI algorithms to unknown problem domains and to provide interesting solutions to the Geodesy models used.