9 research outputs found

    An improved memory prediction strategy for dynamic multiobjective optimization

    Get PDF
    The file attached to this record is the author's final peer reviewed version.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 the behavior of environment change and tries to make use of the historical information appropriately. And then, this paper proposes an improved memory prediction model that uses the memory strategy to provide valuable information to the prediction model to predict the POS of the new environment more accurately. This memory prediction model is incorporated into a multiobjective evolutionary algorithm based on decomposition (MOEA/D). In particular, the resultant algorithm (MOEA/D-MP) adopts a sensor-based method to detect the environment change and find a similar one in history to reuse the information of it in the prediction process. The proposed algorithm is compared with several state-of-the-art dynamic multiobjective evolutionary algorithms (DMOEA) on six typical benchmark problems with different dynamic characteristics. Experimental results demonstrate that the proposed algorithm can effectively tackle DMOPs

    A dynamic multi-objective evolutionary algorithm based on decision variable classification

    Get PDF
    The file attached to this record is the author's final peer reviewed version.In recent years, dynamic multi-objective optimization problems (DMOPs) have drawn increasing interest. Many dynamic multi-objective evolutionary algorithms (DMOEAs) have been put forward to solve DMOPs mainly by incorporating diversity introduction or prediction approaches with conventional multi-objective evolutionary algorithms. Maintaining good balance of population diversity and convergence is critical to the performance of DMOEAs. To address the above issue, a dynamic multi-objective evolutionary algorithm based on decision variable classification (DMOEA-DVC) is proposed in this study. DMOEA-DVC divides the decision variables into two and three different groups in static optimization and change response stages, respectively. In static optimization, two different crossover operators are used for the two decision variable groups to accelerate the convergence while maintaining good diversity. In change response, DMOEA-DVC reinitializes the three decision variable groups by maintenance, prediction, and diversity introduction strategies, respectively. DMOEA-DVC is compared with the other six state-of-the-art DMOEAs on 33 benchmark DMOPs. Experimental results demonstrate that the overall performance of the DMOEA-DVC is superior or comparable to that of the compared algorithms

    A Brief Review on Mathematical Tools Applicable to Quantum Computing for Modelling and Optimization Problems in Engineering

    Get PDF
    Since its emergence, quantum computing has enabled a wide spectrum of new possibilities and advantages, including its efficiency in accelerating computational processes exponentially. This has directed much research towards completely novel ways of solving a wide variety of engineering problems, especially through describing quantum versions of many mathematical tools such as Fourier and Laplace transforms, differential equations, systems of linear equations, and optimization techniques, among others. Exploration and development in this direction will revolutionize the world of engineering. In this manuscript, we review the state of the art of these emerging techniques from the perspective of quantum computer development and performance optimization, with a focus on the most common mathematical tools that support engineering applications. This review focuses on the application of these mathematical tools to quantum computer development and performance improvement/optimization. It also identifies the challenges and limitations related to the exploitation of quantum computing and outlines the main opportunities for future contributions. This review aims at offering a valuable reference for researchers in fields of engineering that are likely to turn to quantum computing for solutions. Doi: 10.28991/ESJ-2023-07-01-020 Full Text: PD

    Dynamic Multiobjectives Optimization with a Changing Number of Objectives

    Get PDF
    This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Existing studies on dynamic multiobjective optimization (DMO) focus on problems with time-dependent objective functions, while the ones with a changing number of objectives have rarely been considered in the literature. Instead of changing the shape or position of the Pareto-optimal front/set (PF/PS) when having time-dependent objective functions, increasing or decreasing the number of objectives usually leads to the expansion or contraction of the dimension of the PF/PS manifold. Unfortunately, most existing dynamic handling techniques can hardly be adapted to this type of dynamics. In this paper, we report our attempt toward tackling the DMO problems with a changing number of objectives. We implement a dynamic two-archive evolutionary algorithm which maintains two co-evolving populations simultaneously. In particular, these two populations are complementary to each other: one concerns more about the convergence while the other concerns more about the diversity. The compositions of these two populations are adaptively reconstructed once the environment changes. In addition, these two populations interact with each other via a mating selection mechanism. Comprehensive experiments are conducted on various benchmark problems with a time-dependent number of objectives. Empirical results fully demonstrate the effectiveness of our proposed algorithm.Engineering and Physical Sciences Research Council (EPSRC)NSF

    Dynamic Multi-Objectives Optimization with a Changing Number of Objectives

    Get PDF
    This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Existing studies on dynamic multiobjective optimization (DMO) focus on problems with time-dependent objective functions, while the ones with a changing number of objectives have rarely been considered in the literature. Instead of changing the shape or position of the Pareto-optimal front/set (PF/PS) when having time-dependent objective functions, increasing or decreasing the number of objectives usually leads to the expansion or contraction of the dimension of the PF/PS manifold. Unfortunately, most existing dynamic handling techniques can hardly be adapted to this type of dynamics. In this paper, we report our attempt toward tackling the DMO problems with a changing number of objectives. We implement a dynamic two-archive evolutionary algorithm which maintains two co-evolving populations simultaneously. In particular, these two populations are complementary to each other: one concerns more about the convergence while the other concerns more about the diversity. The compositions of these two populations are adaptively reconstructed once the environment changes. In addition, these two populations interact with each other via a mating selection mechanism. Comprehensive experiments are conducted on various benchmark problems with a time-dependent number of objectives. Empirical results fully demonstrate the effectiveness of our proposed algorithm.Engineering and Physical Sciences Research Council (EPSRC)NSF

    Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

    Get PDF
    No abstract available

    Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

    Get PDF
    No abstract available
    corecore