Distributed Cooperative Co-Evolution With Adaptive Computing Resource Allocation for Large Scale Optimization

Through introducing the divide-and-conquer strategy, cooperative co-evolution (CC) has been successfully employed by many evolutionary algorithms (EAs) to solve large-scale optimization problems. In practice, it is common that different subcomponents of a large-scale problem have imbalanced contribu...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on evolutionary computation 2019-04, Vol.23 (2), p.188-202
Main Authors: Jia, Ya-Hui, Chen, Wei-Neng, Gu, Tianlong, Zhang, Huaxiang, Yuan, Hua-Qiang, Kwong, Sam, Zhang, Jun
Format: Article
Language:English
Subjects:
Adaptation models
Computation
Computational modeling
Computer architecture
Computer networks
Cooperative co-evolution (CC)
distributed evolutionary algorithm (EA)
Distributed processing
Evolutionary algorithms
Fitness
large-scale optimization
Optimization
Policies
pool model
Program processors
Resource allocation
Resource management
Sociology
Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Through introducing the divide-and-conquer strategy, cooperative co-evolution (CC) has been successfully employed by many evolutionary algorithms (EAs) to solve large-scale optimization problems. In practice, it is common that different subcomponents of a large-scale problem have imbalanced contributions to the global fitness. Thus, how to utilize such imbalance and concentrate efforts on optimizing important subcomponents becomes an important issue for improving performance of cooperative co-EA, especially in distributed computing environment. In this paper, we propose a two-layer distributed CC (dCC) architecture with adaptive computing resource allocation for large-scale optimization. The first layer is the dCC model which takes charge of calculating the importance of subcomponents and accordingly allocating resources. An effective allocating algorithm is designed which can adaptively allocate computing resources based on a periodic contribution calculating method. The second layer is the pool model which takes charge of making fully utilization of imbalanced resource allocation. Within this layer, two different conformance policies are designed to help optimizers use the assigned computing resources efficiently. Empirical studies show that the two conformance policies and the computing resource allocation algorithm are effective, and the proposed distributed architecture possesses high scalability and efficiency.
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2018.2817889