Computer, Informatics, Cybernetics and Applications pp 1201-1207 | Cite as
Analysis of Convergence for Free Search Algorithm in Solving Complex Function Optimization Problems
Free Search (FS) algorithm is efficient in solving complex function optimization problems. Convergence of FS is analyzed in two different cases: continuous and discrete space. For continuous space, convergence of FS did not exist for all functions, such as functions containing singular points. However, taking advantage of measure theory, convergence of FS could be shown when functions satisfy continuous and Lipschitz conditions. For discrete space, making use of random process theory, convergence of FS was got in finite search space and FS was characterized by Markov property. Simulation of multi-model Shubert function is done. Compared with Genetic Algorithm (GA), FS is superior in convergence speed, accuracy and robustness. The analytic and experimental results on FS provide useful evidence for further understanding and properly tackling optimization problems of complex functions.
KeywordsFree search algorithm Convergence of algorithms Optimization problems of complex functions Markov chain Genetic algorithm
This paper was supported by Shanghai Leading Academic Discipline Project, No.B504 and Special Fund of Shanghai University of Engineering Science.
- 1.Holland JH (1992) Adaptation in natural and artificial systems. MIT Press, CambridgeGoogle Scholar
- 3.Kennedy J, Eberhart K (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948Google Scholar
- 5.Penev K (2006) Novel adaptive heuristic for search and optimisation. In: IEEE John Vincent Atanasoff 2006 international symposium on modern computing, pp 149–154Google Scholar
- 6.Zhou H (2007) A new swarm intelligence algorithm–free search. J Donghua Univ 33(5):558–579Google Scholar