DSOMA-Discrete Self Organising Migrating Algorithm

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86100244" target="_blank" >RIV/61989100:27240/16:86100244 - 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. (C) Springer International Publishing Switzerland 2016.

Czech name

—

Czech description

—

Type

C - Chapter in a specialist book

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GA15-06700S" target="_blank" >GA15-06700S: Unconventional Control of Complex Systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Studies in Computational Intelligence. Volume 642

ISBN

978-3-642-34299-8

Number of pages of the result

13

Pages from-to

51-63

Number of pages of the book

119

Publisher name

Springer Verlag

Place of publication

New York

UT code for WoS chapter

—