HC12: Highly scalable optimisation algorithm

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In engineering as well as in non-engineering areas, numerous optimisation problems have to be solved using a wide range of optimisation methods. Soft-computing optimisation procedures are often applied to problems for which the classic mathematical optimisation approaches do not yield satisfactory results. In this paper we present a relatively new optimisation algorithm denoted as HC12 and demonstrate its possible parallel implementation. The paper aims to show that HC12 is highly scalable and can be implemented in a cluster of computers. As a practical consequence, the high scalability substantially reduces the computing time of optimisation problems. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Matousek, R. (2010). HC12: Highly scalable optimisation algorithm. In Studies in Computational Intelligence (Vol. 284, pp. 177–183). https://doi.org/10.1007/978-3-642-12538-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free