Abstract
According to benchmark learning theory in business management, a kind of competitive learning mechanism based on dynamic niche was set up. First, by right of imitation and learning, all the individuals within population were able to approach to the high yielding regions in the solution space, and seek out the optimal solutions quickly. Secondly, the premature convergence problem got completely overcame through new optimal solution policy. Finally, the algorithm proposed here is naturally adaptable for the dynamic optimization problems. The unique search model was analyzed and revealed in detail.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dong-long, Y.: Benchmarking: How to learn from benchmark enterprises. China Social Sciences Press, Beijing (2004) (in Chinese)
Yang, S.: Non-stationary problem optimization using the primal-dual genetic algorithm. Evolutionary Computation 3, 2246–2253 (2003)
Kennedy, J., Eberhart, R.C.: A discrete binary of the particle swarm optimization. In: Proc. IEEE International Conference on Systems, Man and Cybernetic, pp. 4104–4209. IEEE Service Center, Piscataway (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Xie, A.S. (2014). A Unique Search Model for Optimization. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-11857-4_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11856-7
Online ISBN: 978-3-319-11857-4
eBook Packages: Computer ScienceComputer Science (R0)