23 May 2024 in IEEE Transactions on Industrial Informatics
The operation optimization problem of coal mine integrated energy system (CMIES) is characterized by multiobjective, strong constraints, large scale, and mixed variables. It is difficult for existing multiobjective evolutionary algorithms to obtain a set of nondominated solutions with good convergence and uniform distribution, primarily due to the absence of suitable constraint-handling techniques. This research proposes a multitask multiobjective operation optimization framework combining evolutionary algorithm and mathematical programming (MO-EAMP) to address this issue. Within this framework, the main task employs an evolutionary algorithm with global search capability to solve the multiobjective CMIES operation optimization problem. Meanwhile, auxiliary tasks utilize mathematical programming method with robust linear constraint handling capability to solve multiple weighted single-objective CMIES operation optimization problems. During the iteration process of MO-EAMP, the scale and form of auxiliary tasks are adjusted autonomously based on the current state of population, with the aim of guiding the population search toward more promising regions. Finally, the presented algorithm is applied to a coal mine in Shanxi Province, China, and the experimental results demonstrate that the proposed algorithm can obtain a set of optimal operation plans with better convergence and distribution in a shorter time, compared with 7 other existing algorithms.
4 February 2025 in IEEE Transactions on Cybernetics
Constrained multiobjective optimization problems are widespread in practical engineering fields. Scholars have proposed various effective constrained multiobjective evolutionary algorithms (CMOEAs) for such problems. However, most existing algorithms overlook the differences between different decision variables in influencing the degree of constraint violation and still lack an effective handling mechanism for constraint-sensitive variables. To address this issue, a two-stage cooperation multiobjective evolutionary algorithm guided by constraint-sensitive variables (CV-TCMOEA) is proposed. In the first stage, a relatively simple auxiliary problem with only a few dominant constraints is constructed to approximate the original problem. After obtaining a set of approximate Pareto optimal solutions by dealing with the auxiliary problem, in the second stage, a constraint-sensitive variable-guided multistrategy cooperation search method is developed. In this method, decision variables are divided into two types: 1) constraint-sensitive and 2) constraint-insensitive variables, and a variable-type-guided cooperative individual update strategy is proposed to autonomously select appropriate search strategies for different types of variables. Experimental results on 28 benchmark functions and 10 engineering problems demonstrated the superiority of the CV-TCMOEA over seven state-of-the-art CMOEAs.
16 June 2025 in Smart Agricultural Technology
20 January 2026 in IEEE Transactions on Evolutionary Computation
The operational optimization problem of coal mine integrated energy systems features large-scale variables, strong constraints, and multiple objectives. Especially, its ramp constraints introduce significant temporal coupling between decision variables. To address the limitations of existing constrained multi-objective evolutionary algorithms in handling temporal coupling variables, we propose a frequency-domain assisted multi-task differential evolution algorithm. Specifically, for the first time, we present a method for constructing auxiliary task based on frequency-domain decision variables. The frequency-domain representation of decision variables simultaneously possesses global correlation and low-dimensional characteristics. It not only produces solutions more readily satisfy temporal constraints, but also substantially reduce the dimensionality of search space, thereby improving the auxiliary population’s search efficiency. Furthermore, a Gaussian random field-based initialization method for main and auxiliary populations is proposed to generate high-quality initial individuals whose variable values satisfy temporal continuity; and a novel adaptive frequency-domain differential evolution strategy is designed to enhance the search efficiency and diversity of the auxiliary population. Finally, the proposed algorithm is applied to a mine in Shanxi Province, China. The experimental results show that the algorithm is able to obtain a set of optimal solutions with good distribution and convergence in a short time, and it shows improvements of at least 8.5% in HV value and 1.6-3 times in Spread performance over 12 state-of-the-art algorithms.