DSOMA-Discrete Self Organising Migrating Algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F16%3A43875577" target="_blank" >RIV/70883521:28140/16:43875577 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-28161-2_2" target="_blank" >http://dx.doi.org/10.1007/978-3-319-28161-2_2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-28161-2_2" target="_blank" >10.1007/978-3-319-28161-2_2</a>

Result language
angličtina
Original language name
DSOMA-Discrete Self Organising Migrating Algorithm
Original language description
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.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Book/collection name
Self-Organizing Migrating Algorithm: Methodology and Implementation
ISBN
978-3-319-28159-9
Number of pages of the result
13
Pages from-to
51-63
Number of pages of the book
289
Publisher name
Springer International Publishing Switzerland
Place of publication
Cham
UT code for WoS chapter
—

Similar results(10)