A Memetic Algorithm for Global Optimization of Multimodal Nonseparable Problems | IEEE Journals & Magazine | IEEE Xplore

A Memetic Algorithm for Global Optimization of Multimodal Nonseparable Problems

Publisher: IEEE

Abstract:

It is a big challenging issue of avoiding falling into local optimum especially when facing high-dimensional nonseparable problems where the interdependencies among vecto...View more

Abstract:

It is a big challenging issue of avoiding falling into local optimum especially when facing high-dimensional nonseparable problems where the interdependencies among vector elements are unknown. In order to improve the performance of optimization algorithm, a novel memetic algorithm (MA) called cooperative particle swarm optimizer-modified harmony search (CPSO-MHS) is proposed in this paper, where the CPSO is used for local search and the MHS for global search. The CPSO, as a local search method, uses 1-D swarm to search each dimension separately and thus converges fast. Besides, it can obtain global optimum elements according to our experimental results and analyses. MHS implements the global search by recombining different vector elements and extracting global optimum elements. The interaction between local search and global search creates a set of local search zones, where global optimum elements reside within the search space. The CPSO-MHS algorithm is tested and compared with seven other optimization algorithms on a set of 28 standard benchmarks. Meanwhile, some MAs are also compared according to the results derived directly from their corresponding references. The experimental results demonstrate a good performance of the proposed CPSO-MHS algorithm in solving multimodal nonseparable problems.
Published in: IEEE Transactions on Cybernetics ( Volume: 46, Issue: 6, June 2016)
Page(s): 1375 - 1387
Date of Publication: 18 August 2015

ISSN Information:

PubMed ID: 26292352
Publisher: IEEE

Funding Agency:


References

References is not available for this document.