Summary
This document describes a new mutation operator for evolutionary algorithms based on a 1-dimensional optimisation strategy. This provides a directed, rather than random, mutation which can increase the speed of convergence when approaching a minimum. We detail typical comparative results of unimodal and polymodal optimisations with and without the operator.
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
Robertson C., Fisher R. B., Werghi N., Ashbrook A. P. “An Evolutionary Approach to Fitting Constrained Degenerate Second Order Surfaces”. in Evolutionary Image Analysis, Signal Processing and Telecommunications, Proc. First European workshop on evolutionary computation in image analysis and signal processing (Evo1ASP99). Goteborg, Sweden, pp 1–16, Springer LNCS 1596, May (1999).
Robertson C., Fisher R. B., Werghi N., Ashbrook A. P., “An Improved Algorithm to Extract Surfaces from Complete Range Descriptions”, Proc. World Manuf. Conf, WMC’99 (ISMT’99) - Sept., pp 592–598, ICSC Academic Press, Durham (1999)
Robertson C., Fisher R. B., Werghi N., Ashbrook A. P., “Object reconstruction by incorporating geometric constraints in reverse engineering”, Computer-Aided Design, Vol 31 (6), pp 363–399, (1999).
Eggert D, Fitzgibbon A., Fisher R. B., “Simultaneous Registration of Multiple Range Views For Use In Reverse Engineering of CAD Models”, Computer Vision and Image Understanding, Vol 69, No 3, pp 253–272, March (1998).
Rawlins G. J. E. (ed), Foundations of Genetic Algorithms, Morgan Kaufmann Inc., San Mateo, CA, (1991), pp 3.
Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs, Third Edition, Springer, (1996).
Fogel D. B., “An Introduction to Simulated Evoutionary Optimization”, in IEEE Transactions on Neural Networks, Vol.5, No.1, January, pp3–14., (1994)
Chen K., Parmee I. C., Gane C. R., “Dual Mutation Strategies for Mixed-integer Optimisation in Power Station Design.”, Proceedings of IEEE International Conference on Evolutionary Computation, Indiana University, April, pp. 385–390., (1997)
Roy R., Parmee I. C., “An Overview of Evolutionary Computing for Multimodal Function Optimisation”, Proceedings of WSC2. June (1997).
Press W.H., Teukolsky S.A., Vetterling W.T., and Flannery B.P. Numerical Recipes in Fortran. Cambridge University Press, (1992).
Yao X. and Liu Y., “Fast evolution strategies,” Control and Cybernetics. 26(3):467496, (1997).
Benson K., “Evolving Automatic Target Detection Algorithms theat Logically Combine Decision Spaces”, Proc. British Machine Vision Conference, M. Mirmehdi and B. Thomas (eds), BMVA Press, pp 685., (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag London
About this paper
Cite this paper
Robertson, C., Fisher, R.B. (2003). 1-D Parabolic Search Mutation. In: Benítez, J.M., Cordón, O., Hoffmann, F., Roy, R. (eds) Advances in Soft Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3744-3_31
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3744-3_31
Publisher Name: Springer, London
Print ISBN: 978-1-84996-905-5
Online ISBN: 978-1-4471-3744-3
eBook Packages: Springer Book Archive