References
- Barabasz, B., Gajda-Zagórska, E., Migórski, S., Paszyński, M., Schaefer, R. and Smołka, M. (2014). A hybrid algorithm for solving inverse problems in elasticity, International Journal of Applied Mathematics and Computer Science 24(4): 865-886, DOI: 10.2478/amcs-2014-0064.
- Chen, T., He, J., Chen, G. and Yao, X. (2010). Choosing selection pressure for wide-gap problems, Theoretical Computer Science 411(6): 926-934.
- Chorazyczewski, A. and Galar, R. (1998). Visualization of evolutionary adaptation in Rn, in V. Porto et al. (Eds.), Evolutionary Programming VII, Springer-Verlag, London, pp. 657-668.
- DeJong, K. (1975). An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Ph.D. thesis, University of Michigan, Ann Arbour, MI.
- Dick, G. and Whigham, P.A. (2006). Spatially-structured evolutionary algorithms and sharing: Do they mix?, in Wang et al. (Eds.), SEAL 2006, Lecture Notes in Computer Science, Vol. 4247, Springer-Verlag, Berlin/Heidelberg, pp. 457-464.
- Galar, R. (1989). Evolutionary search with soft selection, Biological Cybernetics 60(5): 357-364.
- Galar, R. and Chorazyczewski, A. (2001). Evolutionary dynamics in space of states, Congress on Evolutionary Computation, Seoul, Korea, pp. 1366-1373.
- Galar, R. and Kopciuch, P. (1999). Impatience and polarization in evolutionary processes, Proceedings of the KAEiOG Conference, Potok Złoty, Poland, pp. 115-122, (in Polish).
- Goldberg, D. and Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms, in G. Rawlins (Ed.), Foundations of Genetic Algorithms,Morgan Kaufmann, San Mateo, CA, pp. 69-93.
- Goldberg, D. and Richardson, J. (1987). Genetic algorithms with sharing for multi-modal function optimisation, Proceedings of the 2nd International Conference on Genetic Algorithms and Their Applications, Hillsdale, NJ, USA, pp. 41-49.
- Grosan, C. and Abraham, A. (2007). Hybrid evolutionary algorithms: Methodologies, architectures, and reviews, in A. Abraham et al. (Eds.), Hybrid Evolutionary Algorithms, Studies in Computational Intelligence, Vol. 75, Springer, Berlin/Heidelberg, pp. 1-17.
- Hansen, N. (2005). Compilation of results on the 2005 CEC benchmark function set, http:www.lri.fr/~hansen/cec2005compareresults.pdf.
- Karcz-Dul˛eba, I. (2004). Asymptotic behavior of discrete dynamical system generated by simple evolutionary process, International Journal of AppliedMathematics and Computer Science 14(1): 79-90.
- Karcz-Duleba, I. (2006). Dynamics of two-element populations in the space of population states, IEEE Transactions on Evolutionary Computation 10(2): 199-209.
- Karcz-Duleba, I. (2014). Impatience mechanism in saddles’ crossing, Proceedings of the 6th International Conference ECTA, Rome, Italy, Vol. 75 pp. 174-184.
- Kowalczuk, Z. and Białaszewski, T. (2006). Niching mechanisms in evolutionary computations, International Journal of Applied Mathematics and Computer Science 16(1): 59-84.
- Mengshoel, O. and Goldberg, D. (2008). The crowding approach to niching in genetic algorithms, Evolutionary Computation 16(3): 315-354.
- Obuchowicz, A. (1997). The evolutionary search with soft selection and deterioration of the objective function, Proceedings of the 6th International Conference on Intelligent Information Systems, Zakopane, Poland, pp. 288-295.
- Obuchowicz, A. and Pr˛etki, P. (2004). Phenotypic evolution with a mutation based on symmetric α-stable distributions, International Journal of Applied Mathematics and Computer Science 14(3): 289-316.
- Rogers, A. and Prügel-Bennett, A. (1999). Genetic drift in genetic algorithm selection schemes, IEEE Transactions on Evolutionary Computation 3(4): 298-303.
- Sareni, B. and Krähenbühl, L. (1998). Fitness sharing and niching methods revisited, IEEE Transactions on Evolutionary Computation 2(3): 97-106.
- Tomassini, M. (2005). Spatially Structured Evolutionary Algorithms, Springer-Verlag New York, Inc., Secaucus, NJ.
- Torn, A. and Zilinskas, A. (1989). Global Optimization, Springer-Verlag, New York, NY.