4.6 Article

Global and Local Surrogate-Assisted Differential Evolution for Expensive Constrained Optimization Problems With Inequality Constraints

期刊

IEEE TRANSACTIONS ON CYBERNETICS
卷 49, 期 5, 页码 1642-1656

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2018.2809430

关键词

Differential evolution (DE); expensive constrained optimization problems (ECOP); global search; local search; surrogate model

资金

  1. Innovation-Driven Plan in Central South University [2018CX010]
  2. National Natural Science Foundation of China [61673397, 61673331]
  3. EU Horizon 2020 Marie Sklodowska-Curie Individual Fellowships [661327]
  4. Engineering and Physical Sciences Research Council of U.K. [EP/K001310/1]
  5. Hunan Provincial Natural Science Fund for Distinguished Young Scholars [2016JJ1018]
  6. Science Fund of State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body [31715006]
  7. EPSRC [EP/K001310/1] Funding Source: UKRI
  8. Marie Curie Actions (MSCA) [661327] Funding Source: Marie Curie Actions (MSCA)

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

For expensive constrained optimization problems (ECOPs), the computation of objective function and constraints is very time-consuming. This paper proposes a novel global and local surrogate-assisted differential evolution (DE) for solving ECOPs with inequality constraints. The proposed method consists of two main phases: 1) global surrogate-assisted phase and 2) local surrogate-assisted phase. In the global surrogate-assisted phase, DE serves as the search engine to produce multiple trial vectors. Afterward, the generalized regression neural network is used to evaluate these trial vectors. In order to select the best candidate from these trial vectors, two rules are combined. The first is the feasibility rule, which at first guides the population toward the feasible region, and then toward the optimal solution. In addition, the second rule puts more emphasis on the solution with the highest predicted uncertainty, and thus alleviates the inaccuracy of the surrogates. In the local surrogate-assisted phase, the interior point method coupled with radial basis function is utilized to refine each individual in the population. During the evolution, the global surrogate-assisted phase has the capability to promptly locate the promising region and the local surrogate-assisted phase is able to speed up the convergence. Therefore, by combining these two important elements, the number of fitness evaluations can be reduced remarkably. The proposed method has been tested on numerous benchmark test functions from three test suites and two real-world cases. The experimental results demonstrate that the performance of the proposed method is better than that of other state-of-the-art methods.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

Article Automation & Control Systems

Combining Reduced-Order Model With Data-Driven Model for Parameter Estimation of Lithium-Ion Battery

Zhong-Yi Shui, Xu-Hao Li, Yun Feng, Bing-Chuan Wang, Yong Wang

Summary: The parameters of a lithium-ion battery are crucial for an effective battery management system. Parameter estimation using the pseudo-two-dimensional (P2D) model is more cost-effective than direct measurement methods, but the simulation of the P2D model is time-consuming. To overcome this, a two-phase surrogate model-assisted parameter estimation algorithm (TPSMA-PEAL) is proposed, combining the advantages of reduced-order and data-driven models. TPSMA-PEAL addresses challenges such as overfitting and low observability using differential evolution and parameter sensitivity analysis. Simulations and experiments demonstrate the efficiency and accuracy of TPSMA-PEAL.

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS (2023)

Article Automation & Control Systems

Shift-Based Penalty for Evolutionary Constrained Multiobjective Optimization and Its Application

Zhongwei Ma, Yong Wang

Summary: This article presents a new constraint-handling technique called shift-based penalty (ShiP) for solving constrained multiobjective optimization problems. ShiP utilizes a two-step process by shifting infeasible solutions towards feasible solutions and penalizing them based on constraint violations. ShiP encourages diverse feasible solutions during the early stage of evolution and promotes convergence towards Pareto optimal solutions in the later stage. The effectiveness of ShiP is demonstrated through experiments on benchmark test problems and its application in vehicle scheduling.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Computer Science, Artificial Intelligence

Classification in Dynamic Data Streams With a Scarcity of Labels

Conor Fahy, Shengxiang Yang, Mario Gongora

Summary: This paper proposes an algorithm named COCEL for classification in dynamic data streams. The algorithm combines a stream clustering algorithm and an ensemble of one-class classifiers to recognize and react to changes in the data stream. Experimental results demonstrate that COCEL can achieve superior or comparative accuracy with less labeled data compared to peer stream classification ensembles.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2023)

Article Engineering, Electrical & Electronic

Resilience-Oriented Co-Deployment of Remote- Controlled Switches and Soft Open Points in Distribution Networks

Xiaodong Yang, Zhiyan Zhou, Youbing Zhang, Jiancun Liu, Jinyu Wen, Qiuwei Wu, Shijie Cheng

Summary: This paper proposes a co-deployment framework for soft open points (SOPs) and remote-controlled switches (RCSs) to improve the resilience and management of flexible resources in distribution networks. The model optimizes the investment cost of SOPs and RCSs, as well as the cost caused by de-energized loads, while considering operational constraints. It also analyzes the tradeoff between resilience and cost.

IEEE TRANSACTIONS ON POWER SYSTEMS (2023)

Article Computer Science, Information Systems

A strength pareto evolutionary algorithm based on adaptive reference points for solving irregular fronts

Xin Li, Xiaoli Li, Kang Wang, Shengxiang Yang

Summary: Evolutionary algorithms are effective for multi-objective optimization problems, but their performance degrades when dealing with many-objective optimization problems, especially with irregular Pareto front shapes. To address this, we propose a strength Pareto evolutionary algorithm based on adaptive reference points (SPEA/ARP), which updates reference points using current and historical population information and balances selection pressure and diversity of non-dominated solutions.

INFORMATION SCIENCES (2023)

Article Computer Science, Information Systems

An evolutionary algorithm based on dynamic sparse grouping for sparse large scale multiobjective optimization

Yingjie Zou, Yuan Liu, Juan Zou, Shengxiang Yang, Jinhua Zheng

Summary: Sparse large scale multiobjective optimization problems (sparse LSMOPs) have a high degree of sparsity in the decision variables of their Pareto optimal solutions. Existing evolutionary algorithms for sparse LSMOPs fail to achieve sufficient sparsity due to inaccurate location of nonzero decision variables and lack of interaction between the locating process and optimizing process. To address this, a dynamic sparse grouping evolutionary algorithm (DSGEA) is proposed, which groups decision variables with comparable numbers of nonzero variables and applies improved evolutionary operators for optimization. DSGEA outperforms current EAs in experiments on real-world and benchmark problems, achieving sparser Pareto optimal solutions with precise locations of nonzero decision variables.

INFORMATION SCIENCES (2023)

Article Automation & Control Systems

Combining Lyapunov Optimization With Evolutionary Transfer Optimization for Long-Term Energy Minimization in IRS-Aided Communications

Pei-Qiu Huang, Yong Wang, Kezhi Wang, Qingfu Zhang

Summary: This article studies an intelligent reflecting surface (IRS)-aided communication system under the time-varying channels and stochastic data arrivals. It proposes a method called LETO that combines Lyapunov optimization with evolutionary transfer optimization (ETO) to solve the optimization problem. LETO decouples the long-term optimization problem into deterministic optimization problems in short time slots, ensuring queue stability, and then solves the optimization problem in each time slot using the evolutionary transfer method to achieve real-time decisions.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Retraction Mycology

撤稿声明: Fusaric acid detoxification: a strategy of Gliocladium roseum involved in its antagonism against Fusarium verticillioides (Retraction of Vol 38, Pg 13, 2022)

Yi Kuang, Kirstin Scherlach, Christian Hertweck, Shengxiang Yang, Diego A. Sampietro, Petr Karlovsky

MYCOTOXIN RESEARCH (2023)

Article Computer Science, Artificial Intelligence

Meta-heuristic Techniques in Microgrid Management: A Survey

Zedong Zheng, Shengxiang Yang, Yinan Guo, Xiaolong Jin, Rui Wang

Summary: This paper reviews the application of meta-heuristics in microgrid management, summarizes the contributions and influences of different methods, and provides further insights and suggestions for future research.

SWARM AND EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Artificial Intelligence

A dynamic multi-objective evolutionary algorithm using adaptive reference vector and linear prediction

Jinhua Zheng, Qishuang Wu, Juan Zou, Shengxiang Yang, Yaru Hu

Summary: Responding quickly to environmental changes is crucial in solving dynamic multi-objective optimization problems (DMOPs). Most existing methods perform well on predicting individuals but struggle with improving the accuracy of the predicted population. This paper proposes an approach called RVCP, which combines an adjusted reference vector with a multi-objective evolutionary algorithm to predict the population and effectively tackle DMOPs.

SWARM AND EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Artificial Intelligence

A dual-population evolutionary algorithm based on adaptive constraint strength for constrained multi-objective optimization

Kaixi Yang, Jinhua Zheng, Juan Zou, Fan Yu, Shengxiang Yang

Summary: This paper proposes a dual-population algorithm called dp-ACS to balance constraint satisfaction and objective optimization. The algorithm introduces a dominance relation and an adaptive constraint strength strategy to improve convergence and consider excellent infeasible solutions. Experimental results show that the proposed algorithm outperforms seven state-of-the-art CMOEAs on constrained test suites and real-world CMOPs.

SWARM AND EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Artificial Intelligence

A weight vector generation method based on normal distribution for preference-based multi-objective optimization

Jinhua Zheng, Zhenfang Du, Juan Zou, Shengxiang Yang

Summary: In researching multi-objective evolutionary algorithms, a preference-based MOEA called MOEA/D-ND is proposed. It uses a normal distribution to generate a weight vector and incorporates the decision-maker's preference information to guide convergence. An angle-based niche selection strategy is adopted to prevent falling into local optima. Experimental results show that this algorithm outperforms in various benchmark problems with 2 to 15 goals.

SWARM AND EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Information Systems

A flexible two-stage constrained multi-objective evolutionary algorithm based on automatic regulation

Juan Zou, Jian Luo, Yuan Liu, Shengxiang Yang, Jinhua Zheng

Summary: The core element in solving CMOPs is to balance objective optimization and constraint satisfaction. We propose a flexible two-stage evolutionary algorithm based on automatic regulation (ARCMO) to adapt to complex CMOPs.

INFORMATION SCIENCES (2023)

Article Computer Science, Information Systems

Global and local feasible solution search for solving constrained multi-objective optimization

Weixiong Huang, Juan Zou, Yuan Liu, Shengxiang Yang, Jinhua Zheng

Summary: This paper proposes a constrained multi-objective evolutionary algorithm framework based on global and local feasible solutions search to address the complexity of feasible regions caused by constraints. The framework is divided into three stages and an adaptive method is used to decide when to switch the search state. The experimental results show that the proposed framework is highly competitive for solving CMOPs.

INFORMATION SCIENCES (2023)

Article Automation & Control Systems

Two-Stage Sparse Representation Clustering for Dynamic Data Streams

Jie Chen, Zhu Wang, Shengxiang Yang, Hua Mao

Summary: This article proposes a two-stage sparse representation clustering (TSSRC) method based on sparse representation techniques to address the critical issues in data stream clustering. The TSSRC algorithm evaluates the effective relationship among data objects in landmark windows with an accurate number of clusters and efficiently passes previously learned knowledge to the current landmark window. Experimental results demonstrate the effectiveness and robustness of TSSRC.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

暂无数据