GENITOR II.: a distributed genetic algorithm
Journal of Experimental & Theoretical Artificial Intelligence
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Efficient reinforcement learning through symbiotic evolution
Machine Learning - Special issue on reinforcement learning
Artficial Immune Systems and Their Applications
Artficial Immune Systems and Their Applications
Journal of Global Optimization
Evolutionary Optimization of Yagi-Uda Antennas
ICES '01 Proceedings of the 4th International Conference on Evolvable Systems: From Biology to Hardware
Distributed Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Co-evolutionary Constraint Satisfaction
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
Evolutionary Computation
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
Comparing a coevolutionary genetic algorithm for multiobjective optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Search-intensive concept induction
Evolutionary Computation
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Hi-index | 12.05 |
This paper presents a new individual based optimization algorithm, which is inspired from asexual reproduction known as a remarkable biological phenomenon, called as asexual reproduction optimization (ARO). ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem; this leads to the fitter individual. ARO adaptive search ability along with its strength and weakness points are fully described in the paper. Furthermore, the ARO convergence to the global optimum is mathematically analyzed. To approve the effectiveness of the ARO performance, it is tested with several benchmark functions frequently used in the area of optimization. Finally, the ARO performance is statistically compared with that of an improved genetic algorithm (GA). Results of simulation illustrate that ARO remarkably outperforms GA.