• Login
    Browsing by Author 
    •   DORA Home
    • Browsing by Author
    •   DORA Home
    • Browsing by Author
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browsing by Author "Zheng, Jinhua"

    • 0-9
    • A
    • B
    • C
    • D
    • E
    • F
    • G
    • H
    • I
    • J
    • K
    • L
    • M
    • N
    • O
    • P
    • Q
    • R
    • S
    • T
    • U
    • V
    • W
    • X
    • Y
    • Z

    Sort by:

    Order:

    Results:

    Now showing items 1-20 of 22

    • title
    • publication date
    • submission date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • An adaptation reference-point-based multiobjective evolutionary algorithm 

        Zou, Juan; Fu, Liuwei; Yang, Shengxiang; Zheng, Jinhua; Ruan, Gan; Pei, Tingrui; Wang, Lei (Article)
        It is well known that maintaining a good balance between convergence and diversity is crucial to the performance of multiobjective optimization algorithms (MOEAs). However, the Pareto front (PF) of multiobjective optimization ...
      • Adaptive neighborhood selection for many-objective optimization problems 

        Zou, Juan; Zhang, Yuping; Yang, Shengxiang; Liu, Yuan; Zheng, Jinhua (Article)
        It is generally accepted that conflicts between convergence and distribution deteriorate with an increase in the number of objectives. Furthermore, Pareto dominance loses its effectiveness in many-objectives optimization ...
      • A close neighbor mobility method using particle swarm optimizer for solving multimodal optimization problems 

        Zou, Juan; Deng, Qi; Yang, Shengxiang; Zheng, Jinhua (Article)
        Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. But these parameters are usually difficult to set ...
      • A dynamic multi-objective evolutionary algorithm based on intensity of environmental change 

        Hu, Yaru; Zheng, Jinhua; Zou, Juan; Yang, Shengxiang; Ou, Junwei; Rui, Wang (Article)
        This paper proposes a novel evolutionary algorithm based on the intensity of environmental change (IEC) to effectively track the moving Pareto-optimal front (POF) or Pareto-optimal set (POS) in dynamic optimization. The ...
      • A dynamic multiobjective evolutionary algorithm based on a dynamic evolutionary environment model 

        Zou, Juan; Li, Qingya; Yang, Shengxiang; Zheng, Jinhua; Peng, Zhou; Pei, Tingrui (Article)
        Traditional dynamic multiobjective evolutionary algorithms usually imitate the evolution of nature, maintaining diversity of population through different strategies and making the population track the Pareto optimal solution ...
      • The effect of diversity maintenance on prediction in dynamic multi-objective optimization 

        Ruan, Gan; Yu, Guo; Zheng, Jinhua; Zou, Juan; Yang, Shengxiang (Article)
        There are many dynamic multi-objective optimization problems (DMOPs) in real-life engineering applications whose objectives change over time. After an environmental change occurs, prediction strategies are commonly used ...
      • ETEA: A Euclidean minimum spanning tree-based evolutionary algorithm for multiobjective optimization 

        Li, Miqing; Yang, Shengxiang; Zheng, Jinhua; Liu, Xiaohui (Article)
        The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in space where the edge weight between each pair of points is their Euclidean distance. Since ...
      • An evolutionary dynamic multi-objective optimization algorithm based on center-point prediction and sub-population autonomous guidance 

        Zhou, Jianwei; Zou, Juan; Yang, Shengxiang; Ruan, Gan; Ou, Junwei; Zheng, Jinhua (Conference)
        Dynamic multi-objective optimization problems (DMOPs) provide a challenge in that objectives conflict each other and change over time. In this paper, a hybrid approach based on prediction and autonomous guidance is proposed, ...
      • An improved memory prediction strategy for dynamic multiobjective optimization 

        Zheng, Jinhua; Chen, Tian; Xie, Huipeng; Yang, Shengxiang (Conference)
        In evolutionary dynamic multiobjective optimization (EDMO), the memory strategy and prediction method are considered as effective and efficient methods. To handling dynamic multiobjective problems (DMOPs), this paper studies ...
      • A knee-point-based evolutionary algorithm using weighted subpopulation for many-objective optimization 

        Zou, Juan; Ji, Chunhui; Yang, Shengxiang; Zhang, Yuping; Zheng, Jinhua; Li, Ke (Article)
        Among many-objective optimization problems (MaOPs), the proportion of nondominated solutions is too large to distinguish among different solutions, which is a great obstacle in the process of solving MaOPs. Thus, this paper ...
      • A many-objective algorithm based on staged coordination selection 

        Zou, Juan; Liu, Jing; Zheng, Jinhua; Yang, Shengxiang (Article)
        Convergence and diversity are two performance requirements that should be paid attention to in evolutionary algorithms. Most multiobjective evolutionary algorithms (MOEAs) try their best to maintain a balance between the ...
      • A many-objective evolutionary algorithm based on rotated grid 

        Zou, Juan; Fu, Liuwei; Yang, Shengxiang; Zheng, Jinhua; Yu, Guo; Hu, Yaru (Article)
        Evolutionary optimization algorithms, a meta-heuristic approach, often encounter considerable challenges in many-objective optimization problems (MaOPs). The Pareto-based dominance loses its effectiveness in MaOPs, which ...
      • A many-objective evolutionary algorithm based on rotation and decomposition 

        Zou, Juan; Liu, Jing; Yang, Shengxiang; Zheng, Jinhua (Article)
        Evolutionary algorithms have shown their promise in addressing multiobjective problems (MOPs). However, the Pareto dominance used in multiobjective optimization loses its effectiveness when addressing many-objective problems ...
      • A Pareto-based evolutionary algorithm using decomposition and truncation for dynamic multi-objective optimization 

        Ou, Junwei; Zheng, Jinhua; Ruan, Gan; Hu, Yaru; Zou, Juan; Li, Miqing; Yang, Shengxiang; Tan, Xu (Article)
        Maintaining a balance between convergence and diversity of the population in the objective space has been widely recognized as the main challenge when solving problems with two or more conflicting objectives. This is added ...
      • A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation 

        Bai, Hui; Zheng, Jinhua; Yu, Guo; Yang, Shengxiang; Zou, Juan (Article)
        Evolutionary algorithms (EAs) have shown to be efficient in dealing with many-objective optimization problems (MaOPs) due to their ability to obtain a set of compromising solutions which not only converge toward the Pareto ...
      • A performance indicator for reference-point-based multiobjective evolutionary optimization 

        Hou, Zhanglu; Yang, Shengxiang; Zou, Juan; Zheng, Jinhua; Yu, Guo; Ruan, Gan (Conference)
        Aiming at the difficulty in evaluating preference-based evolutionary multiobjective optimization, this paper proposes a new performance indicator. The main idea is to project the preferred solutions onto a constructed ...
      • A prediction strategy based on center points and knee points for evolutionary dynamic multi-objective optimization 

        Zou, Juan; Li, Qingya; Yang, Shengxiang; Bai, Hui; Zheng, Jinhua (Article)
        In real life, there are many dynamic multi-objective optimization problems which vary over time, requiring an optimization algorithm to track the movement of the Pareto front (Pareto set) with time. In this paper, we propose ...
      • A prediction strategy based on decision variable analysis for dynamic multi-objective optimization 

        Zheng, Jinhua; Zhou, Yubing; Zou, Juan; Yang, Shengxiang; Ou, Junwei; Hu, Yaru (Article)
        Many multi-objective optimization problems in reality are dynamic, requiring the optimization algorithm to quickly track the moving optima after the environment changes. Therefore, response strategies are often used in ...
      • A predictive strategy based on special points for evolutionary dynamic multi-objective optimization 

        Li, Qingya; Zou, Juan; Yang, Shengxiang; Zheng, Jinhua; Ruan, Gan (Article)
        There are some real-world problems in which multiple objectives conflict with each other and the objectives change with time. These problems require an optimization algorithm to track the moving Pareto front or Pareto set ...
      • A proportion-based selection scheme for multi-objective optimization 

        Fu, Liuwei; Zou, Juan; Yang, Shengxiang; Ruan, Gan; Zheng, Jinhua; Ma, Zhongwei (Conference)
        Classical multi-objective evolutionary algorithms (MOEAs) have been proven to be inefficient for solving multiobjective optimizations problems when the number of objectives increases due to the lack of sufficient selection ...

        Submission Guide | Reporting Guide | Reporting Tool | DMU Open Access Libguide | Take Down Policy | Connect with DORA
        DMU LIbrary
         

         

        Browse

        All of DORACommunities & CollectionsAuthorsTitlesSubjects/KeywordsResearch InstituteBy Publication DateBy Submission Date

        My Account

        Login

        Submission Guide | Reporting Guide | Reporting Tool | DMU Open Access Libguide | Take Down Policy | Connect with DORA
        DMU LIbrary