TBU Publications
Repository of TBU Publications

DSOMA-Discrete Self Organising Migrating Algorithm

DSpace Repository

Show simple item record


dc.title DSOMA-Discrete Self Organising Migrating Algorithm en
dc.contributor.author Davendra, Donald David
dc.contributor.author Zelinka, Ivan
dc.contributor.author Pluháček, Michal
dc.contributor.author Šenkeřík, Roman
dc.relation.ispartof Self-Organizing Migrating Algorithm: Methodology and Implementation
dc.identifier.issn 1860-949X OCLC, Ulrich, Sherpa/RoMEO, JCR
dc.identifier.isbn 978-3-319-28161-2
dc.identifier.isbn 978-3-319-28159-9
dc.date.issued 2016
utb.relation.volume 626
dc.citation.spage 51
dc.citation.epage 63
dc.type conferenceObject
dc.language.iso en
dc.publisher Springer-Verlag Berlin
dc.identifier.doi 10.1007/978-3-319-28161-2_2
dc.relation.uri http://link.springer.com/chapter/10.1007/978-3-319-28161-2_2
dc.description.abstract A discrete Self Organising Migrating Algorithm (DSOAM) is described in this chapter. This variant is specifically designed for the permutative based combinatorial optimisation problem, where the problem domain in generally NP-Hard. Specific sampling between individuals in the search space is introduced as a means of constructing new feasible individuals. These feasible solutions are improved using 2-Opt routines. DSOMA has proven successful in solving manufacturing scheduling and assignment problems. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1006464
utb.identifier.obdid 43876344
utb.identifier.scopus 2-s2.0-84957548762
utb.identifier.wok 000371478200004
utb.source d-wok
dc.date.accessioned 2016-07-26T14:58:35Z
dc.date.available 2016-07-26T14:58:35Z
utb.identifier.utb-sysno 87694
utb.contributor.internalauthor Pluháček, Michal
utb.contributor.internalauthor Šenkeřík, Roman
Find Full text

Files in this item

Show simple item record