Random search with species conservation for multimodal functions
Authors: 
J. P. Li, A. WoodAuthors Info & Claims
J. P. Li, A. WoodAuthors Info & ClaimsPages 3164 - 3171
Abstract
This paper is to investigate the influence of a minimum population size on the performance of the species conservation technique in searching multiple solutions. The species conservation technique is combined a random search technique, which is a special genetic algorithm with one individual, to present an algorithm, called species conservation random search (SCRS), for solving multimodal problems. Each species is built around a dominating point, called the species seed, with a given species radius, and the species are saved in the species set. The random search is used to explore a new point in the neighborhood area of an initial point randomly selected from the species set. A modified species conservation technique has been developed to update species seeds according to these new exploration points. Numerical experiments demonstrate that the proposed SCRS is very effective in dealing with multimodal problems and can also find all the global solutions of test functions.
References
[1]
Baba, N. and T. Shoman, "A modified convergence theorem for a random optimisation method", Information Science, 13, 159-166 (1997).
[2]
Balazs, M.E., Jian-Ping Li, Parks, G.T. and Clarkson, P.J., "The Effect of Distance Measure in a GA with Species Conservation", Proceeding of the The 2001 IEEE Congress on Evolutionary Computation, CEC2001, Seoul, Korea, May 27-30, 67-74 (2001).
[3]
Berg B. A., "Locating global minima in optimisation problems by a random approach", Nature 361, 708-710 (1993).
[4]
Beasley, D., D.R. Bull, and R.R. Martin, "A sequential Niche technique for multimodal function optimization", Evolutionary Computation, 1(2), 101-125 (1993).
[5]
Brooks, S.H., "A comparison of maximum seeking methods", Operations Research, 7, 430-457 (1959).
[6]
Cerny, V., "Thermodynamical approach to the traveling saleman problem: an efficient simulation algorithm", J. Opt. Theory Appl., 45(1), 41-51 (1985).
[7]
Corana, A., M. Marchesi, C. Martini, and S. Ridella, "Minimizing Multimodal Functions of Continuous Variables with the "Simulated Annealing" Algorithm, ACM Trans. on Math. Software, 13, 262-280 (1987).
[8]
Davidor, Y. "A naturally occurring niche and species phenomenon: the model and first results". In Belew, R.K. and Booker, L.B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 257-263, Morgan Kaufmann, San Mateo, California (1991).
[9]
Deb, K. and Goldberg, D.E., An investigation of niche and species formation in genetic function optimization. In Schaffer, J.D., editor, Proceedings of the Third International Conference on Genetic Algorithms, pp. 42-50, Morgan Kaufmann, San Mateo, California (1989).
[10]
Gen, M. and Cheng, R.W., Genetic Algorithms and Engineering Design. John Wiley & Sons, New York (1996).
[11]
Glover, F. "Tabu search - part I". ORSA Journal on Computing, 1(3), 190-206 (1989).
[12]
Goldberg, D.E. "Genetic Algorithms in Search, Optimization and Machine Learning". Addison-Wesley, Reading Massachusetts (1989).
[13]
Goldberg, D.E. and Richardson, J. "Genetic algorithms with sharing for multimodal function optimization". In Grefenstette, J.J., editor, Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pages 41-49, Lawrence Earlbaum, Hillsdale, New Jersey (1987).
[14]
Hillis, W.D., " Optimization problem", Nature 330, 27-28 (1987).
[15]
Holland, J.H., "Adaptation in Natural and Artificial System". The University of Michigan Press, Ann Arbor, Michigan (1975).
[16]
Kennedy J., and R. C. Eberhart., "Particle Swarm Optimization". In Proc. of the IEEE Int. Conf. Neural Networks, 1942-1948 (1995).
[17]
Kirkpatrick, S., C.D. Gelatt Jr., M.P. Vecchi, "Optimization by simulated annealing", Science, 220 (4598), 671-680 (1983).
[18]
Li, J.-P., Balazs, M.E., Parks, G.T. and Clarkson, P.J., "Complexity Analysis of Evaluating Distance in the Genetic Algorithm using Species Conservation", The 2001 Congress on Evolutionary Computation, CEC2001, Seoul, Korea, May 27-30, 52-59 (2001).
[19]
Li, J-P., Balazs, M.E., Parks, G.T. and Clarkson, P.J., "A Genetic Algorithm using Species Conservation for Multimodal Function Optimization", Journal of Evolutionary Computation, 10(3), 207-234 (2002).
[20]
Li, J-P., Balazs, M.E., and Parks, G.T. "Engineering design optimization using species-conserving genetic algorithms", Engineering Optimization, 39(2), 141-147, (2007).
[21]
Li, J.-Y. and R.R. Rhinehart, "Heuristic random optimization", Computers Chem. Eng., 22(3), 427-444 (1998).
[22]
Li, X.-D., "Adaptively Choosing Neighbourhood Bests Using Species in a Particle Swarm Optimizer for Multimodal Function Optimization", Lecture notes on Computer Science, 3102, 105-116 (2004).
[23]
Li, X.-D., "Efficient Differential Evolution using speciation for multimodal function optimization", GECCO'05, Jun 25-29, 2005, Washington DC, USA, 873-880 (2005).
[24]
Macready, W.G., A.G. Siapas and S.A. Kauffman, "Criticality and Parallelism in Combinatorial optimisation", Science, 271, 56-59 (1996).
[25]
Mahfoud, S.W., Niching methods for genetic algorithms. IlliGAL Technical Report 95001, Illinois Genetic Algorithms Laboratory, University of Illinois, Urbana, Illinois (1995).
[26]
Matyas J., "Random optimization", Automation and Remote Control, 26, 246-253 (1965).
[27]
Mengshoel, O.J. and Goldberg, D.E. "Probability crowding: deterministic crowding with probabilistic replacement". In Banzhaf, W., Daida, J. and Eiben, A.E., editors, Proceedings of the Genetic and Evolutionary Computation Conference 1999, pages 409-416, Morgan Kaufmann, San Francisco, California (1999).
[28]
Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag Berlin Heidelberg, New York (1996).
[29]
Ursem, R.K., "Multinational GAs: mulitimodal optimisation techniques in dynamic environments", Proceeding of the Genetic and Evolutionary Computation Conference, p. 19-26, Morgan Kaufmann (2000).
Recommendations
Large-Scale Orthology Predictions for Inferring Gene Functions across Multiple Species
HPCMP-UGC '10: Proceedings of the 2010 DoD High Performance Computing Modernization Program Users Group ConferenceAn effective approach to infer the functions of genes is to use the concept of gene orthology. Because orthologous genes are likely to share similar functions, the functions of genes in an unstudied species can be inferred through the functions of their ...
Comments
Information & Contributors
Information
Published In
May 2009
3356 pages
ISBN:9781424429585
Publisher
IEEE Press
Publication History
Published: 18 May 2009
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025