Discrete set handling

Zelinka, Ivan

dc.title	Discrete set handling	en
dc.contributor.author	Zelinka, Ivan
dc.relation.ispartof	Differential Evolution: A Handbook for Global Permutation Based Combinatorial Optimization
dc.identifier.issn	1860-949X Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn	978-3-540-92150-9
dc.date.issued	2009
utb.relation.volume	175
dc.citation.spage	163
dc.citation.epage	205
dc.type	conferenceObject
dc.language.iso	en
dc.publisher	Springer	en
dc.identifier.doi	10.1007/978-3-540-92151-6_7
dc.relation.uri	https://link.springer.com/chapter/10.1007/978-3-540-92151-6_7
dc.subject	TRAVELING	en
dc.subject	SALESMAN PROBLEMS	en
dc.description.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.	en
utb.faculty	Faculty of Applied Informatics
dc.identifier.uri	http://hdl.handle.net/10563/1002829
utb.identifier.obdid	43861069
utb.identifier.scopus	2-s2.0-58149295998
utb.identifier.wok	000266824900007
utb.source	d-wok
dc.date.accessioned	2012-06-04T11:34:14Z
dc.date.available	2012-06-04T11:34:14Z
utb.contributor.internalauthor	Zelinka, Ivan