Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F14%3A43871559" target="_blank" >RIV/70883521:28140/14:43871559 - isvavai.cz</a>
Alternative codes found
RIV/70883521:28120/14:43871559 RIV/61989100:27240/14:86092620
Result on the web
<a href="http://link.springer.com/article/10.1007/s00500-014-1219-7" target="_blank" >http://link.springer.com/article/10.1007/s00500-014-1219-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00500-014-1219-7" target="_blank" >10.1007/s00500-014-1219-7</a>
Alternative languages
Result language
angličtina
Original language name
Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time
Original language description
The Dissipative Lozi chaotic map is embedded in the discrete self organising migrating algorithm (DSOMA), as a pseudorandom generator. This novel chaotic based algorithm is applied to the constraint based lot-streaming flowshop scheduling problem. Two new and unique data sets generated using the Lozi and Delayed Logistic maps are used to compare the chaos embedded DSOMA and the generic DSOMA utilising the venerable Mersenne Twister. In total, 100 data sets were tested by these two algorithms, for the idling and the non-idling case. From the obtained results, the chaos variant algorithm is shown to significantly improve the performance of generic DSOMA.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/TE01020197" target="_blank" >TE01020197: Centre for Applied Cybernetics 3</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Soft computing
ISSN
1432-7643
e-ISSN
—
Volume of the periodical
18
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
669-681
UT code for WoS article
000333030800006
EID of the result in the Scopus database
—