4.6 Article

APPLICATION OF NOVEL CLONAL ALGORITHM IN MULTIOBJECTIVE OPTIMIZATION

出版社

WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0219622010003804

关键词

Multiobjective optimization; immune algorithm; clonal selection; hybrid mutation

资金

  1. National Natural Science Foundation of China [60703112, 60773203]

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

In this paper, a novel clonal algorithm applied in multiobjecitve optimization (NCMO) is presented, which is designed from the improvement of search operators, i.e. dynamic mutation probability, dynamic simulated binary crossover (D-SBX) operator and hybrid mutation operator combining with Gaussian and polynomial mutations (GP-HM) operator. The main notion of these approaches is to perform more coarse-grained search at initial stage in order to speed up the convergence toward the Pareto-optimal front. Once the solutions are getting close to the Pareto-optimal front, more fine-grained search is performed in order to reduce the gaps between the solutions and the Pareto-optimal front. Based on this purpose, a cooling schedule is adopted in these approaches, reducing the parameters gradually to a minimal threshold, the aim of which is to keep a desirable balance between fine-grained search and coarse-grained search. By this means, the exploratory capabilities of NCMO are enhanced. When compared with various state-of-the-art multiobjective optimization algorithms developed recently, simulation results show that NCMO has remarkable performance.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

Article Computer Science, Artificial Intelligence

A novel multimodal multiobjective memetic algorithm with a local detection mechanism and a clustering-based selection strategy

Naili Luo, Yulong Ye, Wu Lin, Qiuzhen Lin, Victor C. M. Leung

Summary: A novel multimodal multiobjective memetic algorithm is proposed in this paper, which preserves more global and local Pareto optimal solution sets using a local detection mechanism and a clustering-based selection strategy. Experimental results demonstrate the superior performance of the proposed algorithm.

MEMETIC COMPUTING (2023)

Article Computer Science, Artificial Intelligence

A survey of artificial immune algorithms for multi-objective optimization

Lingjie Li, Qiuzhen Lin, Zhong Ming

Summary: This paper presents a comprehensive survey on the multi-objective immune algorithm (MOIA), which is a heuristic algorithm based on the artificial immune system model. MOIAs can be classified into three main categories: multi-objective optimization problems (MOPs), dynamic MOPs, and constrained MOPs. The characteristics, principles, theoretical analyses, and performance of MOIAs in solving various types of MOPs are discussed. The paper concludes with a brief summary of the current drawbacks, challenges, and future directions for MOIAs.

NEUROCOMPUTING (2022)

Review Computer Science, Artificial Intelligence

Heuristics and metaheuristics for biological network alignment: A review

Lijia Ma, Zengyang Shao, Lingling Li, Jiaxiang Huang, Shiqiang Wang, Qiuzhen Lin, Jianqiang Li, Maoguo Gong, Asoke K. Nandi

Summary: In this paper, a comprehensive review of heuristic and metaheuristic biological network alignment methods is presented. Comparative analyses of alignment models, datasets, evaluation metrics, and experimental results are provided, along with conclusions and possible future directions for BNAs.

NEUROCOMPUTING (2022)

Article Automation & Control Systems

A Fuzzy Decomposition-Based Multi/Many-Objective Evolutionary Algorithm

Songbai Liu, Qiuzhen Lin, Kay Chen Tan, Maoguo Gong, Carlos A. Coello Coello

Summary: This article proposes a fuzzy decomposition-based MOEA that estimates the population's shape using fuzzy prediction and selects weight vectors to fit the Pareto front shapes of different multi-objective optimization problems.

IEEE TRANSACTIONS ON CYBERNETICS (2022)

Article Computer Science, Artificial Intelligence

Many-objective optimization by using an immune algorithm

Yuchao Su, Naili Luo, Qiuzhen Lin, Xia Li

Summary: Multiobjective optimization is crucial in practical engineering applications, but becomes more challenging with increased number of objectives. This paper proposes a many-objective immune algorithm that utilizes global information to select high-quality parents for evolution, enhancing convergence and diversity of the population.

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Article Computer Science, Artificial Intelligence

An Ensemble Surrogate-Based Framework for Expensive Multiobjective Evolutionary Optimization

Qiuzhen Lin, Xunfeng Wu, Lijia Ma, Jianqiang Li, Maoguo Gong, Carlos A. Coello Coello

Summary: This article proposes an ensemble surrogate-based framework for solving computationally expensive multiobjective optimization problems (EMOPs). The framework trains a global surrogate model and multiple surrogate submodels to enhance prediction accuracy and reliability. Experimental results demonstrate the advantages of this approach in solving EMOPs.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2022)

Article Computer Science, Artificial Intelligence

Multiresolution community detection in complex networks by using a decomposition based multiobjective memetic algorithm

Zengyang Shao, Lijia Ma, Yuan Bai, Shanfeng Wang, Qiuzhen Lin, Jianqiang Li

Summary: This paper proposes a decomposition based multiobjective memetic algorithm for multiresolution community detection in complex networks. The method models the problem as a multiobjective optimization problem and combines evolutionary algorithm with local search to detect communities at multiple resolution levels. Experimental results demonstrate the effectiveness of the method.

MEMETIC COMPUTING (2023)

Article Computer Science, Artificial Intelligence

A self -organizing weighted optimization based framework for large -scale multi-objective optimization

Yongfeng Li, Lingjie Li, Qiuzhen Lin, Ka-Chun Wong, Zhong Ming, Carlos A. Coello

Summary: This paper proposes a self-organizing weighted optimization based framework (S-WOF) for solving large-scale multi-objective optimization problems (LSMOPs). The S-WOF achieves a dynamic trade-off between convergence and diversity by adjusting the weights and evaluation numbers. In addition, an efficient competitive swarm optimizer (CSO) is implemented to improve the search ability. Experimental results demonstrate the superiority of S-WOF over several state-of-the-art large-scale evolutionary algorithms.

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Article Automation & Control Systems

A convergence and diversity guided leader selection strategy for many-objective particle swarm optimization

Lingjie Li, Yongfeng Li, Qiuzhen Lin, Zhong Ming, Carlos A. Coello Coello

Summary: This paper proposes a convergence and diversity guided leader selection strategy (CDLS) for improving the performance of particle swarm optimizer (PSO) in high-dimensional objective space. By adaptively selecting different leader particles based on each particle's situation, CDLS achieves a good tradeoff between convergence and diversity.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2022)

Article Computer Science, Artificial Intelligence

Variable neighborhood search for a new practical dynamic pickup and delivery problem

Junchuang Cai, Qingling Zhu, Qiuzhen Lin

Summary: This paper introduces a new Dynamic Pickup and Delivery Problem (DPDP) and proposes an algorithm called VNSME to solve it. The algorithm performs well in practical scenarios and achieves the first place in the ICAPS 2021 competition.

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Article Computer Science, Artificial Intelligence

Adversarial attacks and defenses in deep learning for image recognition: A survey

Jia Wang, Chengyu Wang, Qiuzhen Lin, Chengwen Luo, Chao Wu, Jianqiang Li

Summary: This paper provides a comprehensive survey of recent advances in adversarial attack and defense methods. It analyzes and compares the pros and cons of various schemes, and discusses the main challenges and future research directions in this field.

NEUROCOMPUTING (2022)

Article Automation & Control Systems

An Ensemble Surrogate-Based Coevolutionary Algorithm for Solving Large-Scale Expensive Optimization Problems

Xunfeng Wu, Qiuzhen Lin, Jianqiang Li, Kay Chen Tan, Victor C. M. Leung

Summary: In this article, an ensemble surrogate-based coevolutionary optimizer is proposed to solve large-scale optimization problems. By training local surrogate models and using feature selection to construct a selective ensemble surrogate, the optimizer approximates the target problem. With two populations solving the target problem and a simplified auxiliary problem collaboratively, the coevolutionary optimizer can leverage the search experience from the auxiliary problem to help solve the target problem.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Competitive Decomposition-Based Multiobjective Architecture Search for the Dendritic Neural Model

Junkai Ji, Jiajun Zhao, Qiuzhen Lin, Kay Chen Tan

Summary: The dendritic neural model (DNM) is a computationally fast machine-learning technique that can be implemented using logic circuits and binary calculations. In order to enhance its speed, a more concise architecture can be generated. However, existing multiobjective evolutionary algorithms face limitations in solving this large-scale multiobjective optimization problem. Therefore, a novel competitive decomposition-based algorithm is proposed in this study, which outperforms state-of-the-art algorithms in terms of optimization ability. Experimental results also demonstrate that the proposed algorithm can achieve competitive performance when applied to DNM and its hardware implementation, compared to widely used machine-learning approaches.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Adapting Decomposed Directions for Evolutionary Multiobjective Optimization

Yuchao Su, Qiuzhen Lin, Zhong Ming, Kay Chen Tan

Summary: This article proposes an effective method called Adapted Decomposed Directions (ADDs) for solving Multiobjective Optimization Problems (MOPs). Instead of using a single ideal or nadir point, each weight vector has its own ideal point for decomposition, and the decomposed directions are adaptively adjusted during the search process. The experimental results show that this method significantly improves the performance of three representative Multiobjective Evolutionary Algorithms (MOEAs) and outperforms seven competitive MOEAs in solving various artificial MOPs and a real-world MOP.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Computer Science, Artificial Intelligence

Influence Maximization in Complex Networks by Using Evolutionary Deep Reinforcement Learning

Lijia Ma, Zengyang Shao, Xiaocong Li, Qiuzhen Lin, Jianqiang Li, Victor C. M. Leung, Asoke K. Nandi

Summary: This article proposes an evolutionary deep reinforcement learning algorithm called EDRL-IM for influence maximization in complex networks. By combining evolutionary algorithm and deep reinforcement learning algorithm, EDRL-IM outperforms state-of-the-art methods in finding seed nodes.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

暂无数据