Abstract
Evolutionary Computing (EC) is becoming popular among researchers in multimodal function optimisation (MFO). One of the major issues in MFO is maintaining the ‘useful’ diversity in the population. The ‘useful’ diversity is utilised in search either to achieve the global optimum or to maintain multiple sub-optima in the final population. In case of multimodal functions these two goals can be dependent on each other. The paper discusses the principle issues involved in MFO. All major EC techniques suitable for MFO are categorised, and their strengths and weaknesses are discussed. Application of EC techniques to solve real life MFO problems are difficult. Real life problems can pose some additional challenge than test functions. Real life problems are difficult mainly because of lack of prior knowledge. The paper mentions the challenges posed by such real life problems, and discusses how Adaptive Restricted Tournament Selection (ARTS) can address some of the challenges. From the discussion, direction for future research in MFO is identified.
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
Parmee, I. C., 1994, The implementation of adaptive search tools to promote global search in engineering design, Proceedings of 3rd IFIP Working Conference on Optimisation-based Computer-aided Modelling and Design, 24–26 May, UTIA, Prague.
Parmee, I. C. and Denham, M. J., 1994, The integration of adaptive search techniques with current engineering design, Proceedings of ACEDC′94 Conference, 21–22 September, Plymouth (UK), pp. 1-13.
Roy, R., Parmee, I. C. and Purchase, G., 1996, Integrating the genetic algorithms with the preliminary design of gas turbine blade cooling systems, Proceedings of ACEDC′96 Conference, 26–28 March, Plymouth (UK), pp. 228-235.
Goldberg, D. E., 1989, Genetic Algorithms in search, optimization, and machine learning, Addison-Wesley, Reading, MA.
Roy, R., Parmee, I.C. and Purchase, G., 1996, Sensitivity analysis of engineering designs using Taguchi’s methodology, CD-Rom Proceedings of the ASME DETC-Design Automation Conference, 18–22 August, Irvine, CA, 96-DETC/DAC-1455.
Roy, R., Parmee, I. C. and Purchase, G., 1996, Qualitative evaluation of engineering designs using fuzzy logic, CD-Rom Proceedings of the ASME DETC-Design Automation Conference, 18–22 August, Irvine. CA, 96-DETC/DAC-1449.
Roy, R. and Parmee, I. C., 1996, Adaptive Restricted Tournament Selection for the Identification of Multiple Sub-Optima in a Multi-Modal Function’, Lecture Notes in Computer Science (Evolutionary Computing), 1143, Springer — Verlag, 236-256.
Goldberg, D. E. and Richardson, J. J., 1987, Genetic algorithms with sharing for multi-modal Junction optimization, Genetic algorithms and their applications: Proceedings of the Second International Conference on Genetic Algorithms, pp. 41-49.
Cavicchio, D. J., Jr., 1970, Adaptive search using simulated evolution, Unpublished doctoral dissertation, University of Michigan, Ann Arbor, USA.
Mahfoud, S. W., 1992, Crowding and preselection revisited, In R. Manner and B. Manderick (Eds.), Parallel Problem Solving from Nature, 2, Elsevier Science Publishers B. V., 27-36.
De Jong, K. A., 1975, An analysis of the behavior of a class of genetic adaptive systems, (Doctoral Dissertation, University of Michigan) Dissertation Abstracts International, 36(10), 5140B, University Microfilms No. 76-9381.
Mahfoud, S. W., 1995, Niching Methods for genetic Algorithms; Doctoral thesis, University of Illinois, Urbana-Champaign, USA.
Cedeno, W., Vemuri, V. R., and Slezak, T., 1995, Multiniche crowding in genetic algorithms and its application to the assembly of DNA restriction-fragments, Evolutionary Computation, 2, no. 4, MIT Press, Cambridge, 321–345.
Lin, C.-Y., Yang, Y.-J., and Liou, J.-Y., 1996, Genetic Search Based Hybrid Multimodal Optimization, Emergent Computing Methods in Engineering Design, NATO ASI Series, vol. 149, 74–81.
Parmee, I. C., 1996, The maintenance of search diversity for effective design space decomposition using cluster-oriented genetic algorithms (COGAs) and multi-agent strategies (GAANT), Proceedings of the ACEDC′96 Conference, University of Plymouth, UK, pp. 128-138.
Harik, G., 1995, Finding multimodal solutions using Restricted Tournament Selection, Proceedings of the Sixth ICGA Conference, 15–20 July, Pittsburgh, pp. 24-31.
Syswerda, G., 1991, A study of reproduction in generational and steady-state genetic algorithms, In G. J. E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan Kaufmann Pub., 94-101.
Goldberg, D. E., Deb, K., and Horn, J., 1992, Massive multimodality, deception, and genetic algorithms, In R. Manner and B. Manderick (Eds.), Parallel Problem Solving from Nature, 2; Elsevier Science Pub. B. V., 37-46.
Oei, C. K., Goldberg, D. E., and Chang, S. J., 1991, Tournament Selection, Niching, and the preservation of Diversity, IlliGAL Report No. 91011, University of Illinois, Urbana-Champaign, USA.
Yin, X. and Germay, N., 1993, A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization, In; R. F. Albrecht, C. R. Reeves, and N. C. Steele (Eds.), Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, Springer-Verlag, Berlin, pp. 450–457.
Jelasity, M. and Dombi, J., 1995, GAS, an approach to a solution of the niche radius problem, Proceedings of GALISIA ′95 Conference, Sheffield, UK, 12–14 September, pp. 424-429.
Miller, B. L. and Shaw, M. J., 1996, Genetic algorithms with dynamic niche sharing for multimodal function optimization, Proceedings of 1996 IEEE International Conference on Evolutionary Computation, Nagoya, Japan, 20–22 May, pp. 786-791.
Stadnyk, I., 1987, Schema recombination in a pattern recognition problem, Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pp. 27-35.
Smith, R. E., Forrest, S. and Perelson, A. S., 1993, Searching for diverse, co-operative populations with genetic algorithms, Evolutionary Computation, 1, no. 2, MIT Press, 127-149.
Darwen, P. and Yao Xin, 1996, Every niching method has its niche: fitness sharing and implicit sharing compared, Proceedings of PPSN IV Conference, Berlin, Germany, 22–27 September, pp. 398-407.
Grosso, P. B., 1985, Computer simulation of genetic adaptation: Parallel subcomponent interaction in a multilocus model, PhD Dissertation, University of Michigan, University Microfilms No. 8520908.
Elo, S., 1994, A parallel genetic algorithm on the CM-2 for multi-modal optimization, Proceedings of the First IEEE Conference on Evolutionary Computation, Florida, USA, 27–29 June, pp. 818-822.
Davidor, Y., 1991, A naturally occurring niche & species phenomenon: The model and first results, Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 257-263.
Beasley, D., Bull, D. R. and Martin, R. R., 1993, A sequential niche technique for multimodal function optimization, Evolutionary Computation, 1, no. 2, MIT Press, 101-125.
Mahfoud, S. W., 1995, A comparison of parallel and sequential niching methods, Proceedings of the Sixth International Conference on Genetic Algorithms, Pittsburgh, Morgan Kaufmann Pub. Inc., 15–19 July, pp. 136-143.
Jarvis, R. A. and Patrick, E. A., 1973, Clustering using a similarity measure based on shared near neighbors, IEEE Transactions on Computers, 22, no. 11, 388–397.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London
About this paper
Cite this paper
Roy, R., Parmee, I.C. (1998). An Overview of Evolutionary Computing for Multimodal Function Optimisation. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds) Soft Computing in Engineering Design and Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-0427-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0427-8_4
Publisher Name: Springer, London
Print ISBN: 978-3-540-76214-0
Online ISBN: 978-1-4471-0427-8
eBook Packages: Springer Book Archive