Motivation for Differential Evolution for Permutative-Based Combinatorial Problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F09%3A43868168" target="_blank" >RIV/70883521:28140/09:43868168 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-540-92151-6" target="_blank" >http://dx.doi.org/10.1007/978-3-540-92151-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-540-92151-6" target="_blank" >10.1007/978-3-540-92151-6</a>

Result language
angličtina
Original language name
Motivation for Differential Evolution for Permutative-Based Combinatorial Problems
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)