Discretization Of Decision Variables In Optimization Algorithms

but.event.date26.04.2018cs
but.event.titleStudent EEICT 2018cs
dc.contributor.authorMarek, Martin
dc.date.accessioned2019-03-04T10:05:51Z
dc.date.available2019-03-04T10:05:51Z
dc.date.issued2018cs
dc.description.abstractThis paper presents a verification of universal method for discretization of decision space in optimization algorithms. Real-world optimization tasks frequently use discontinuous decision variables and in order to effectively optimize such tasks, it is necessary to exploit an optimization algorithm that meets such requirement. Unfortunately, very few evolutionary algorithms can naturally work with discontinuous decision space. The method that entitles all optimization algorithms to effectively solve problems with discrete variables is here described and experimentally verified.en
dc.formattextcs
dc.format.extent307-311cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationProceedings of the 24th Conference STUDENT EEICT 2018. s. 307-311. ISBN 978-80-214-5614-3cs
dc.identifier.isbn978-80-214-5614-3
dc.identifier.urihttp://hdl.handle.net/11012/138246
dc.language.isoencs
dc.publisherVysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologiícs
dc.relation.ispartofProceedings of the 24th Conference STUDENT EEICT 2018en
dc.relation.urihttp://www.feec.vutbr.cz/EEICT/cs
dc.rights© Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologiícs
dc.rights.accessopenAccessen
dc.subjectOptimizationen
dc.subjectevolutionary algorithmsen
dc.subjectdiscrete decision spaceen
dc.titleDiscretization Of Decision Variables In Optimization Algorithmsen
dc.type.driverconferenceObjecten
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.departmentFakulta elektrotechniky a komunikačních technologiícs
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
eeict2018-307.pdf
Size:
508.1 KB
Format:
Adobe Portable Document Format
Description: