Discrete set handling

Zelinka, Ivan

Title:

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

JCR	Journal Citation Reports - Impact Factor
SNIP	SCImago Source Normalized Impact per Paper
SJR	SCImago Journal Rank
IPP	SCImago Impact per Publication
CS	Scopus CiteScore

(Note: The metrics are not comparable against one another.)

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

Files in this item

Name: Fulltext_1002829.pdf

Size: 1.206Mb

Format: PDF

Description: fulltext

ČSN ISO 690:2011 citation

Citace článku v konferenčním sborníku:
ZELINKA, Ivan. Discrete set handling. In: Differential Evolution: A Handbook for Global Permutation Based Combinatorial Optimization [online]. Springer, 2009, s. 163-205. [cit. 2024-04-26]. ISSN 1860-949X. Dostupné z: https://link.springer.com/chapter/10.1007/978-3-540-92151-6_7.

These citations are software generated and may contain errors. To verify accuracy, check the appropriate style guide.