It is generally accepted that Differential Evolution (DE) was originally designed to solve problems which are defined in continuous form. Some researchers have however, felt that this is a limiting factor on DE, hence there have been vigorous research work to extend the functionalities of DE to include permutative-based combinatorial problems. This chapter sets the scene for the book by discussing the motivation for presenting the foundational theories for a number of variants of DE for permutative-based combinatorial problems. These DE variants are presented by their initiators or proposers, to the best of our knowledge.
This is a preview of subscription content, access via your institution.
Unable to display preview. Download preview PDF.
Price, K., Storn, R.: Differential evolution homepage (2001) (Cited September 10, 2008), http://www.ICSI.Berkeley.edu/ ~storn/code.html
Price, K., Storn, R., Lampinen, J.: Differential Evolution. Springer, Heidelberg (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 March 1999 (1995) (available via ftp), ftp.icsi.berkeley.edu/pub/techreports/1995/tr-95-012.ps.Z
Editors and Affiliations
Rights and permissions
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Onwubolu, G., Davendra, D. (2009). Motivation for Differential Evolution for Permutative—Based Combinatorial Problems. In: Onwubolu, G.C., Davendra, D. (eds) Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization. Studies in Computational Intelligence, vol 175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92151-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92150-9
Online ISBN: 978-3-540-92151-6
eBook Packages: EngineeringEngineering (R0)