Contact Us | Language: čeština English
Title: | Discrete set handling | ||||||||||
Author: | Zelinka, Ivan | ||||||||||
Document type: | Conference paper (English) | ||||||||||
Source document: | Differential Evolution: A Handbook for Global Permutation Based Combinatorial Optimization. 2009, vol. 175, p. 163-205 | ||||||||||
ISSN: | 1860-949X (Sherpa/RoMEO, JCR) | ||||||||||
Journal Impact
This chart shows the development of journal-level impact metrics in time
|
|||||||||||
ISBN: | 978-3-540-92150-9 | ||||||||||
DOI: | https://doi.org/10.1007/978-3-540-92151-6_7 | ||||||||||
Abstract: | Discrete Set Handling and its application to permutative problems is presented in this chapter. Discrete Set is applied to Differential Evolution Algorithm, in order to enable it to solve strict-sence combinatorial problems. In addition to the theoretical framework and description, benchmark Flow Shop Scheduling and Traveling Salesman Problems are solved. The results are compared with published literature to illustrate the effectiveness of the developed approach. Also, general applications of Discrete Set Handling to Chaotic, non-linear and symbolic regression systems are given. | ||||||||||
Full text: | https://link.springer.com/chapter/10.1007/978-3-540-92151-6_7 | ||||||||||
Show full item record |