There are several different algorithms based on the ideas of collective behaviour of decentralized systems. Some of these algorithms try to imitate the distributed and self-organized systems that can be found in nature. Algorithms based on the mechanisms of distributed evidence gathering and processing of bee swarms are recent optimisation techniques. The distributed schema makes these algorithms suitable for a distributed implementation using the distributed computational infrastructures (DCIs) available. With these DCIs, large scale scientific problems can be optimized in a feasible time. However, the distributed paradigm of these infrastructures introduces several challenges in the design and development of any optimization technique. A distributed and asynchronous bees (DAB) algorithm running in a DCI is here presented with the aim to optimize any large scale problem. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gómez-Iglesias, A., Vega-Rodríguez, M. A., Castejón, F., & Cárdenas-Montes, M. (2010). Distributed and asynchronous bees algorithm: An efficient model for large scale problems optimizations. In Advances in Intelligent and Soft Computing (Vol. 79, pp. 381–388). Springer Verlag. https://doi.org/10.1007/978-3-642-14883-5_49
Mendeley helps you to discover research relevant for your work.