Abstract
Differential Evolution (DE) is a competitive optimization technique for numerical optimization problems with real-parameter representation. This paper aims to investigate how DE can be adapted with binary encoding and to study its behaviors on the binary level.
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
Price, K.V., Storn, R., Lampinen, J.: Differential Evolution: A Practical Approach to Global Optimization. Springer, London (2005)
Storn, R., Price, K.: Differential evolution–a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR–95–012, ICSI (1995)
Radcliffe, N.: The algebra of genetic algorithms. Annals of Maths and Artificial Intelligence 10, 339–384 (1994)
Surry, P.D.: A Prescriptive Formalism for Constructing Domain-specific Evolutionary Algorithm. PhD thesis, University of Edinburgh, Edinburgh, Scotland, UK (1998)
Tuson, A.L.: No optimization without representation: a knowledge based systems view of evolutionary/neighbourhood search optimization. PhD thesis, University of Edinburgh, Edinburgh (1999)
Gong, T., Tuson, A.L.: Formal descriptions of real parameter optimisation. In: Proceedings of IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, July 16-21, 2006, pp. 2119–2126. IEEE Computer Society Press, Los Alamitos (2006)
Ackley, D.: A Connectionist Machine for Genetic Hillclimbing. Kluwer Academic Publishers, Boston (1987)
Goldberg, D.: Genetic algorithms and walsh functions: Part I, a gentle introduction. Complex Systems 3, 129–152 (1989)
Mitchell, M., Forrest, S., Holland, J.: The royal road for genetic algorithms: Fitness landscapes and GA performance. In: Varela, F., Bourgine, P. (eds.) Proceeding of the 1st European Conference on Artificial Life, pp. 245–254. MIT Press, Cambridge (1992)
Horn, J., Goldberg, D.E., Deb, K.: Long path problems. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN III. LNCS, vol. 866, pp. 149–158. Springer, Heidelberg (1994)
Horn, J., Goldberg, D.E.: Genetic algorithm difficulty and the modality of fitness landscapes. In: Whitley, L.D., Vose, M.D. (eds.) FOGA, pp. 243–269. Morgan Kaufmann, San Francisco (1994)
Rudolph, G.: How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation 4, 195–205 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gong, T., Tuson, A.L. (2007). Differential Evolution for Binary Encoding. In: Saad, A., Dahal, K., Sarfraz, M., Roy, R. (eds) Soft Computing in Industrial Applications. Advances in Soft Computing, vol 39. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70706-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-70706-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70704-2
Online ISBN: 978-3-540-70706-6
eBook Packages: EngineeringEngineering (R0)