| dc.contributor.author | Metlická, Magdalena | |
| dc.contributor.author | Davendra, Donald David | |
| dc.date.accessioned | 2016-02-22T13:45:52Z | |
| dc.date.available | 2016-02-22T13:45:52Z | |
| dc.date.issued | 2015 | |
| dc.identifier.citation | Swarm and Evolutionary Computation. 2015, vol. 25, p. 15-28. | cs |
| dc.identifier.issn | 2210-6502 | |
| dc.identifier.issn | 2210-6510 | |
| dc.identifier.uri | http://hdl.handle.net/10084/111300 | |
| dc.description.abstract | 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. | cs |
| dc.language.iso | en | cs |
| dc.publisher | Elsevier | cs |
| dc.relation.ispartofseries | Swarm and Evolutionary Computation | cs |
| dc.relation.uri | http://dx.doi.org/10.1016/j.swevo.2015.03.002 | cs |
| dc.rights | Copyright © 2015 Elsevier B.V. All rights reserved. | cs |
| dc.title | Chaos driven discrete artificial bee algorithm for location and assignment optimisation problems | cs |
| dc.type | article | cs |
| dc.identifier.doi | 10.1016/j.swevo.2015.03.002 | |
| dc.type.status | Peer-reviewed | cs |
| dc.description.source | Web of Science | cs |
| dc.description.volume | 25 | cs |
| dc.description.lastpage | 28 | cs |
| dc.description.firstpage | 15 | cs |
| dc.identifier.wos | 000367860600003 | |