Discrete set handling

Citation data:

Studies in Computational Intelligence, ISSN: 1860-949X, Vol: 175, Page: 163-205

Publication Year:
2009
Usage 1364
Abstract Views 909
Holdings 452
Downloads 3
Captures 26
Exports-Saves 14
Readers 12
Citations 49
Citation Indexes 49
Ratings
Goodreads
Repository URL:
http://publikace.k.utb.cz/handle/10563/1002829; http://publikace.k.utb.cz/handle/10563/1002827; http://publikace.k.utb.cz/handle/10563/1002828; http://hdl.handle.net/10563/1002827; http://hdl.handle.net/10563/1002828; http://hdl.handle.net/10563/1002829
DOI:
10.1007/978-3-540-92151-6_7; 10.1007/978-3-540-92151-6_2; 10.1007/978-3-540-92151-6_1; 10.1007/978-3-540-92151-6
ISBN:
9783540921509; 9783540921516
OCLC:
436991112; 314175901; 746939569; 1005787532; 938883682
Author(s):
Onwubolu, Godfrey; Davendra, Donald David
Publisher(s):
Springer Nature; Springer; Springer-Verlag; Springer Berlin Heidelberg
Tags:
Computer Science; TRAVELING; SALESMAN PROBLEMS
book chapter description
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. © 2009 Springer-Verlag Berlin Heidelberg.