Kontaktujte nás | Jazyk: čeština English
Název: | DSOMA-Discrete Self Organising Migrating Algorithm | ||||||||||
Autor: | Davendra, Donald David; Zelinka, Ivan; Pluháček, Michal; Šenkeřík, Roman | ||||||||||
Typ dokumentu: | Článek ve sborníku (English) | ||||||||||
Zdrojový dok.: | Self-Organizing Migrating Algorithm: Methodology and Implementation. 2016, vol. 626, p. 51-63 | ||||||||||
ISSN: | 1860-949X (Sherpa/RoMEO, JCR) | ||||||||||
Journal Impact
This chart shows the development of journal-level impact metrics in time
|
|||||||||||
ISBN: | 978-3-319-28161-2 | ||||||||||
DOI: | https://doi.org/10.1007/978-3-319-28161-2_2 | ||||||||||
Abstrakt: | 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. | ||||||||||
Plný text: | https://link.springer.com/chapter/10.1007/978-3-319-28161-2_2 | ||||||||||
Fyzické výtisky: | Jednotky v katalogu Knihovny UTB | ||||||||||
Zobrazit celý záznam |