Chaos driven discrete artificial bee algorithm for location and assignment optimisation problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86096663" target="_blank" >RIV/61989100:27240/15:86096663 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S2210650215000279" target="_blank" >http://www.sciencedirect.com/science/article/pii/S2210650215000279</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.swevo.2015.03.002" target="_blank" >10.1016/j.swevo.2015.03.002</a>

Result language
angličtina
Original language name
Chaos driven discrete artificial bee algorithm for location and assignment optimisation problems
Original language description
The chaos driven discrete artificial bee colony (CDABC) algorithm is introduced in this paper. Four unique chaos maps of Burgers, Lozi, Delayed Logistic and Tinkerbell are embedded as chaos pseudo-random number generators and compared with the Mersenne Twister pseudo-random number generator. Two unique problems of quadratic assignment and capacitated vehicle routing problem are solved using five different variants of the algorithm and analytical comparison is conducted. Furthermore, paired t-test is done pairwise on all variants, and from these results it is ascertained that the Tinkerbell variant of CDABC is the best performing for both problem classes.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
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
S - Specificky vyzkum na vysokych skolach

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

Similar results(10)