Deakin University
Browse

File(s) under permanent embargo

Evolutionary optimization: A big data perspective

Version 2 2024-06-03, 11:54
Version 1 2015-03-17, 10:31
journal contribution
posted on 2024-06-03, 11:54 authored by M Bhattacharya, R Islam, Jemal AbawajyJemal Abawajy
Stochastic search techniques such as evolutionary algorithms (EA) are known to be better explorer of search space as compared to conventional techniques including deterministic methods. However, in the era of big data like most other search methods and learning algorithms, suitability of evolutionary algorithms is naturally questioned. Big data pose new computational challenges including very high dimensionality and sparseness of data. Evolutionary algorithms' superior exploration skills should make them promising candidates for handling optimization problems involving big data. High dimensional problems introduce added complexity to the search space. However, EAs need to be enhanced to ensure that majority of the potential winner solutions gets the chance to survive and mature. In this paper we present an evolutionary algorithm with enhanced ability to deal with the problems of high dimensionality and sparseness of data. In addition to an informed exploration of the solution space, this technique balances exploration and exploitation using a hierarchical multi-population approach. The proposed model uses informed genetic operators to introduce diversity by expanding the scope of search process at the expense of redundant less promising members of the population. Next phase of the algorithm attempts to deal with the problem of high dimensionality by ensuring broader and more exhaustive search and preventing premature death of potential solutions. To achieve this, in addition to the above exploration controlling mechanism, a multi-tier hierarchical architecture is employed, where, in separate layers, the less fit isolated individuals evolve in dynamic sub-populations that coexist alongside the original or main population. Evaluation of the proposed technique on well known benchmark problems ascertains its superior performance. The algorithm has also been successfully applied to a real world problem of financial portfolio management. Although the proposed method cannot be considered big data-ready, it is certainly a move in the right direction.

History

Journal

Journal of Network and Computer Applications

Volume

59

Pagination

416-426

Location

Amsterdam, The Netherlands

ISSN

1084-8045

eISSN

1095-8592

Language

English

Publication classification

C Journal article, C1 Refereed article in a scholarly journal

Copyright notice

2014, Elsevier

Publisher

ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD