4.7 Article

Distributed and Expensive Evolutionary Constrained Optimization With On-Demand Evaluation

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2022.3177936

关键词

Differential evolution (DE); distributed optimization; on-demand evaluation; surrogate-assisted evolutionary algorithm (SAEA)

向作者/读者索取更多资源

This article defines distributed expensive constrained optimization problems (DECOPs) and proposes a distributed evolutionary constrained optimization algorithm with on-demand evaluation (DEAOE). DEAOE adaptively evolves different constraints in an asynchronous way through on-demand evaluation, improving population convergence and diversity. Experimental results demonstrate that DEAOE outperforms centralized state-of-the-art surrogate-assisted evolutionary algorithms (SAEAs) in terms of performance and efficiency.
Expensive optimization problems (EOPs) are common in industry and surrogate-assisted evolutionary algorithms (SAEAs) have been developed for solving them. However, many EOPs have not only expensive objective but also expensive constraints, which are evaluated through distributed ways. We define this kind of EOPs as distributed expensive constrained optimization problems (DECOPs). The distributed characteristic of DECOPs leads to the asynchronous evaluation of both objective and constraints. Though some researchers have studied the asynchronous evaluation of objectives, the asynchronous evaluation of constraints has not gained much attention. Therefore, this article gives a formal formulation of DECOPs and proposes a distributed evolutionary constrained optimization algorithm with on-demand evaluation (DEAOE). DEAOE can adaptively evolve different constraints in an asynchronous way through the on-demand evaluation strategy. The on-demand evaluation works from two aspects to improve the population convergence and diversity. From the aspect of individual selection, a joint sample selection strategy is adopted to determine which candidates are promising. From the aspect of constraint selection, an infeasible-first evaluation strategy is devised to judge which constraints need to be further evolved. Extensive experiments and analyses on benchmark functions and engineering problems demonstrate that DEAOE has better performance and higher efficiency compared to centralized state-of-the-art SAEAs.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Cybernetics

An Evolutionary Guardrail Layout Design Framework for Crowd Control in Subway Stations

Jinghui Zhong, Tiantian Cheng, Wei-Li Liu, Peng Yang, Ying Lin, Jun Zhang

Summary: This article proposes an evolutionary framework to automatically optimize guardrail layouts in subway stations, providing high-quality designs through novel encoding methods and fitness evaluation functions.

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Fitness and Distance Based Local Search With Adaptive Differential Evolution for Multimodal Optimization Problems

Zi-Jia Wang, Zhi-Hui Zhan, Yun Li, Sam Kwong, Sang-Woon Jeon, Jun Zhang

Summary: This paper proposes a novel local search technique, named FDLS, based on individual information including fitness and distance, to execute precise local search operations on global optima in multimodal algorithms, avoiding meaningless local search operations on local optima or similar areas. The proposed FDLS technique is integrated with an adaptive differential evolution algorithm called ADE, and the experiments on the CEC2015 multimodal competition demonstrate its effectiveness and superiority compared to other multimodal algorithms.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

Article Computer Science, Artificial Intelligence

A Self-adaptive neuroevolution approach to constructing Deep Neural Network architectures across different types

Zhenhao Shuai, Hongbo Liu, Zhaolin Wan, Wei-Jie Yu, Jun Zhang

Summary: This study proposes a self-adaptive neuroevolution (SANE) approach to automatically construct various lightweight DNN architectures for different tasks. SANE is able to self-adaptively adjust evolution exploration and exploitation to improve search efficiency. The results illustrate that the obtained DNN architectures could have smaller scale with similar performance compared to existing DNN architectures.

APPLIED SOFT COMPUTING (2023)

Article Computer Science, Information Systems

A novel dropout mechanism with label extension schema toward text emotion classification

Zongxi Li, Xianming Li, Haoran Xie, Fu Lee Wang, Mingming Leng, Qing Li, Xiaohui Tao

Summary: Researchers have found that emotion is not limited to one category in emotion-relevant classification tasks, and multiple emotions can exist together in a sentence. Recent studies have focused on using distribution or grayscale labels to enhance the classification model, providing additional information on the intensity of emotions and their correlations. This approach has been effective in overcoming overfitting and improving model robustness. However, it can also reduce the model's discriminative ability within similar emotion categories.

INFORMATION PROCESSING & MANAGEMENT (2023)

Article Computer Science, Information Systems

Effective stabilized self-training on few-labeled graph data

Ziang Zhou, Jieming Shi, Shengzhong Zhang, Zengfeng Huang, Qing Li

Summary: Graph neural networks (GNNs) are designed for semi-supervised node classification on graphs with limited labeled data. However, in extreme cases where very few labels are available (e.g., only 1 labeled node per class), GNNs suffer from severe performance degradation. To address this issue, the proposed Stabilized Self-Training (SST) framework effectively handles the scarcity of labeled data and improves classification accuracy.

INFORMATION SCIENCES (2023)

Article Automation & Control Systems

Distributed Differential Evolution With Adaptive Resource Allocation

Jian-Yu Li, Ke-Jing Du, Zhi-Hui Zhan, Hua Wang, Jun Zhang

Summary: This article proposes a novel three-layer DDE framework, along with three novel methods, for solving the resource allocation and search efficiency problems in distributed differential evolution. The effectiveness and efficiency of the framework and methods are demonstrated through theoretical analysis and extensive experiments.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Graph-Based Deep Decomposition for Overlapping Large-Scale Optimization Problems

Xin Zhang, Bo-Wen Ding, Xin-Xin Xu, Jian-Yu Li, Zhi-Hui Zhan, Pengjiang Qian, Wei Fang, Kuei-Kuei Lai, Jun Zhang

Summary: Decomposition methods are important in CCEAs for solving large-scale optimization problems. The proposed GDD method improves the grouping accuracy by mining interactions among variables and dealing with computational roundoff errors. GDD shows better performance in grouping and fault tolerance, especially for overlapping problems.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

A knowledge learning and random pruning-based memetic algorithm for user route planning in bike-sharing system

Ke-Jing Du, Jian-Yu Li, Hua Wang, Jun Zhang

Summary: In this paper, the user route planning problem (URPP) in a bike-sharing system is studied, and a knowledge learning and random pruning-based memetic algorithm (KLRP-MA) is proposed to efficiently solve it. The proposed algorithm not only considers the static perspective of users but also addresses the challenges of the URPP in dynamic situations. Experimental results show that the KLRP-MA and the DyKLRP-MA can find the best solution in a short time, and the DyKLRP-MA can quickly respond to changes and re-optimize the current planning route.

MEMETIC COMPUTING (2023)

Article Computer Science, Artificial Intelligence

An Efficient Federated Genetic Programming Framework for Symbolic Regression

Junlan Dong, Jinghui Zhong, Wei-Neng Chen, Jun Zhang

Summary: This paper introduces a federated genetic programming framework that can train a global model while protecting data privacy. By processing decentralized data locally without sending the original data to the server, it achieves data privacy protection and reduces data collection time.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

Article Computer Science, Artificial Intelligence

Incremental particle swarm optimization for large-scale dynamic optimization with changing variable interactions

Xiao-Fang Liu, Zhi-Hui Zhan, Jun Zhang

Summary: This paper proposes an incremental particle swarm optimization method to address the key issues of problem decomposition and solution reconstruction in large-scale dynamic optimization problems. Experimental results demonstrate the superiority of the proposed method in terms of solution optimality.

APPLIED SOFT COMPUTING (2023)

Article Computer Science, Artificial Intelligence

Visual question generation for explicit questioning purposes based on target objects

Jiayuan Xie, Jiali Chen, Wenhao Fang, Yi Cai, Qing Li

Summary: Visual question generation focuses on target objects in images to generate questions for specific questioning purposes. Existing studies extract target objects corresponding to the questioning purpose based on answers. However, answers may not accurately and completely map to every target object. This study proposes a content-controlled question generation model that generates questions based on a given target object set specified from an image.

NEURAL NETWORKS (2023)

Article Automation & Control Systems

Edge-Cloud Co-Evolutionary Algorithms for Distributed Data-Driven Optimization Problems

Xiao-Qi Guo, Wei-Neng Chen, Feng-Feng Wei, Wen-Tao Mao, Xiao-Min Hu, Jun Zhang

Summary: Surrogate-assisted evolutionary algorithms have been proposed to solve data-driven optimization problems. However, most existing methods do not consider the challenges brought by the distribution of data at the edge of networks in the era of the Internet of Things. In this study, we propose edge-cloud co-EAs to address distributed data-driven optimization problems, where data are collected by edge servers.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Chemistry, Multidisciplinary

GCARe: Mitigating Subgroup Unfairness in Graph Condensation through Adversarial Regularization

Runze Mao, Wenqi Fan, Qing Li

Summary: Training Graph Neural Networks (GNNs) on large-scale graphs in the deep learning era can be expensive. Graph condensation has emerged as a promising approach to reduce training cost by compressing large graphs, but its fairness in treating node subgroups during compression has not been explored.

APPLIED SCIENCES-BASEL (2023)

Article Computer Science, Artificial Intelligence

Popularity-aware sequential recommendation with user desire

Jiajin Wu, Bo Yang, Runze Mao, Qing Li

Summary: Sequential recommendation systems have gained significant attention, but current models still suffer from popularity bias. To alleviate this bias, this study proposes a debiasing model that considers the dynamic user desire and conducts intervention analysis and counterfactual reasoning. The proposed model, PAUDRec, outperforms existing models while alleviating popularity bias in sequential recommendation.

EXPERT SYSTEMS WITH APPLICATIONS (2024)

暂无数据