A combined multi-objective optimization model for degradation trend prediction of pumped storage unit

In order to better characterize the performance degradation trend of rolling bearings, a new performance degradation evaluation method based on principal component analysis (PCA), phase space reconstruction (PSR) and kernel extreme learning machine (KELM), namely PAPRKM is proposed to evaluate the performance degradation of rolling bearings in this paper. In the PAPRKM method, the time-domain and frequency-domain features of the vibration signal are extracted to construct the high-dimension feature matrix. Then the PCA is used to reduce the dimension of the feature matrix in order to represent the running state and the declining trend of rolling bearings, so as to eliminate the redundancy and information conflict among these features. Nextly, the PSR is adopted to obtain more relevant information from the time series. By determining the delay time and embedding dimension, the time series are reconstructed to obtain a new performance degradation index, which is regarded as the input data to input into KELM, and the degradation trend prediction model is established to realize the performance degradation trend prediction. Finally, the actual vibration signals of rolling bearings are applied to prove the effectiveness of the PAPRKM. The obtained experimental results show that the PAPRKM method can effectively predict the performance degradation trend of rolling bearings. The predicted results are more accurate than the other compared methods.

In this paper, a multi-objective particle swarm optimization algorithm based on the relative distance strategy is proposed to realize hydrodynamic coefficient identification, which can improve the accuracy of parameter identification without determining the weight manually. Firstly, single-objective particle swarm optimization (PSO) is used to identify the parameters of the model with a low coupling degree. Then, the parameters of the strongly coupled sway and yaw motion model are regarded as multi-objective, and a set of unbiased Pareto optimal solutions are obtained by the multi-objective particle swarm optimization (MOPSO) algorithm. Then the distance function of the Pareto solution is constructed to determine the parametric solution of the model. Finally, experimental identification is carried out by using the data set collected from the real ship. Experimental results show that the accuracy of model parameters obtained by this identification method is about 91.6%, and there is no need to set the weighting coefficient.

A method for designing miniaturized frequency selective surface (FSS) using equivalent circuit model (ECM) and multi-objective particle swarm optimization (MOPSO) algorithm is proposed in this paper. In the proposed method, ECM describing the desired frequency response is established, and parameters of the ECM are determined using the MOPSO algorithm. Combining the ECM analysis and the MOPSO algorithm, the requirements of desired frequency response can be converted into the constraints of equivalent circuit parameters, which simplifies the optimization process of FSS design. For verification, a single-layer bandstop-bandpass FSS composed of convoluted elements with the unit cell size of 0.073λ 0 × 0.073λ 0 is designed. Simulation results show that the −15 dB bandwidth is from 2.62 to 2.83 GHz, and the −0.5 dB bandwidth is from 3.84 to 5 GHz. Meanwhile, the resonant frequency is stable at different incident angles (up to 80°) under TE and TM polarization. Finally, the proposed FSS prototype is fabricated and measured. The measured results agree well with the simulated ones.

An integrated optimization strategy based on Kriging model and multi-objective particle swarm optimization (PSO) algorithm was constructed. As a new surrogate model technology, Kriging model has better fitting precision for nonlinear problem. The Kriging model was adopted to replace computer aided engineering (CAE) simulation as fitness function of multi-objective PSO algorithm, and the computation cost can be reduced greatly. By introducing multi-objective handling mechanism of crowding distance and mutation operator to multi-objective PSO algorithm, the entire Pareto front can be approximated better. It is shown that the multi-objective optimization strategy can get higher solving accuracy and computation efficiency under small sample.

This paper addresses a multi-objective approach for simultaneous dynamic expansion planning of conventional sub-transmission grid and Regional Virtual Power Plant (RVPP). In such a feed-in tariff electricity market, it will assist RVVP’s stakeholders in deciding whether or not they should invest in new equipment’s installation. A Multi-Objective Particle Swarm Optimization (MOPSO) algorithm as a heuristic optimization method is proposed to eliminate the conventional centralized planning, which has led to competition between Regional Electric Company (REC) and RVPP for power delivery in sub-transmission system. Two objective functions are considered for simultaneous expansion planning of these two systems. The first one takes the minimum cost of the REC, as the sub-transmission grid operator, into account while the other one considers profit maximization for RVPP. To achieve the goals, MOPSO algorithm is employed to find the best expansion of REC and best location and capacity of RVPP’s resources. Having solved the proposed multi-objective optimization problem, a Pareto front is determined to show the trade-off between REC and RVPPs' contributions in joint optimal expansion planning of conventional sub-transmission grid and the RVPP. To demonstrate the applicability and effectiveness of the proposed approach, a realistic sub-transmission system in Guilan Province, Iran is used as a test system, and the results are evaluated accordingly.

Uncertainty-aware normal behavior modeling with spatiotemporal graph learning for health monitoring of pumped storage units

In data center companies, cloud computing can host multiple types of heterogeneous virtual machines (VMs) and provide many features, including flexibility, security, support, and even better maintenance than traditional centers. However, some issues need to be considered, such as the optimization of energy usage, utilization of resources, reduction of time consumption, and optimization of virtual machine placement. Therefore, this paper proposes an alternative multiobjective optimization (MOP) approach that combines the salp swarm and sine-cosine algorithms (MOSSASCA) to determine a suitable solution for virtual machine placement (VMP). The objectives of the proposed MOSSASCA are to maximize mean time before a host shutdown (MTBHS), to reduce power consumption, and to minimize service level agreement violations (SLAVs). The proposed method improves the salp swarm and the sine-cosine algorithms using an MOP technique. The SCA works by using a local search approach to improve the performance of traditional SSA by avoiding trapping in a local optimal solution and by increasing convergence speed. To evaluate the quality of MOSSASCA, we perform a series of experiments using different numbers of VMs and physical machines. The results of MOSSASCA are compared with well-known methods, including the nondominated sorting genetic algorithm (NSGA-II), multiobjective particle swarm optimization (MOPSO), a multiobjective evolutionary algorithm with decomposition (MOEAD), and a multiobjective sine-cosine algorithm (MOSCA). The results reveal that MOSSASCA outperforms the compared methods in terms of solving MOP problems and achieving the three objectives. Compared with the other methods, MOSSASCA exhibits a better ability to reduce power consumption and SLAVs while increasing MTBHS. The main differences in terms of power consumption between the MOSCA, MOPSO, MOEAD, and NSGA-II and the MOSSASCA are 0.53, 1.31, 1.36, and 1.44, respectively. Additionally, the MOSSASCA has higher MTBHS value than MOSCA, MOPSO, MOEAD, and NSGA-II by 362.49, 274.70, 585.73 and 672.94, respectively, and the proposed method has lower SLAV values than MOPSO, MOEAD, and NSGA-II by 0.41, 0.28, and 1.27, respectively.

In the last decade, multiobjective Particle Swarm Optimization (MOPSO) has been observed as one of the most powerful optimization algorithms in solving Multiobjective Optimization Problems (MOPs). Nowadays, it is becoming increasingly clear that MOPSO can handle complex MOPs based on the competitive-cooperative framework. The goal of this paper is to provide a comprehensive review of MOPSO from the basic principles to hybrid evolutionary strategies. To offer the readers insights on the prominent developments of MOPSO, the key parameters on the convergence and diversity performance of MOPSO were analyzed to reflect the influence on the searching performance of particles. Then, the main advanced MOPSO methods were discussed, as well as the theoretical analysis of multiobjective optimization performance metrics. Even though some hybrid MOPSO methods show promising multiobjective optimization performance, there is much room left for researchers to improve further, in particular in terms of engineering applications. As a result, further in-depth studies are required. This paper should motivate evolutionary computation researchers to pay more attention to this practical yet challenging area.

This paper deals with the optimal placement of distributed generation (DG) units in distribution systems via an enhanced multi-objective particle swarm optimization (EMOPSO) algorithm. To pursue a better simulation of the reality and provide the designer with diverse alternative options, a multi-objective optimization model with technical and operational constraints is constructed to minimize the total power loss and the voltage fluctuation of the power system simultaneously. To enhance the convergence of MOPSO, special techniques including a dynamic inertia weight and acceleration coefficients have been integrated as well as a mutation operator. Besides, to promote the diversity of Pareto-optimal solutions, an improved non-dominated crowding distance sorting technique has been introduced and applied to the selection of particles for the next iteration. After verifying its effectiveness and competitiveness with a set of well-known benchmark functions, the EMOPSO algorithm is employed to achieve the optimal placement of DG units in the IEEE 33-bus system. Simulation results indicate that the EMOPSO algorithm enables the identification of a set of Pareto-optimal solutions with good tradeoff between power loss and voltage stability. Compared with other representative methods, the present results reveal the advantages of optimizing capacities and locations of DG units simultaneously, and exemplify the validity of the EMOPSO algorithm applied for optimally placing DG units.

The current paper presents a novel multi-objective particle swarm optimization (MOPSO) algorithm for solving no-wait flow shop scheduling problems with makespan and maximum tardiness criteria. First, in the algorithm, particles are represented as job permutations and updated directly in the discrete domain. Second, the concept of Pareto dominance is applied to compare different solutions of multi-objective optimization, and a set is employed to hold and to update the obtained non-dominated solutions, where a randomly selected non-dominated solution is assigned as the global best particle to maintain the diversity of the searching direction and to speed up the convergence process to the Pareto front. Third, a new multi-objective heuristic, named the PWQ (Pan—Wang—Qian) heuristic, is proposed to produce a population of initial particles with relatively good performances. Fourth, a simple but effective multi-objective local search algorithm is developed to embed in the MOPSO algorithm for stressing the balance between global exploration and local exploitation. In addition, two speed-up methods are devised to evaluate a job permutation and its insert neighbourhood respectively. Computational simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is shown that the proposed algorithm is superior to a recently published multi-objective hybrid differential evolution (MHDE) algorithm in terms of searching quality, diversity level, robustness, and efficiency.

A multi-objective particle swarm optimization (MOPSO) approach for multi-objective economic load dispatch problem in power system is presented in this paper. The economic load dispatch problem is a non-linear constrained multi-objective optimization problem. The proposed MOPSO approach handles the problem as a multi-objective problem with competing and non-commensurable fuel cost, emission and system loss objectives and has a diversity-preserving mechanism using an external memory (call “repository”) and a geographically-based approach to find widely different Pareto-optimal solutions. In addition, fuzzy set theory is employed to extract the best compromise solution. Several optimization runs of the proposed MOPSO approach were carried out on the standard IEEE 30-bus test system. The results revealed the capabilities of the proposed MOPSO approach to generate well-distributed Pareto-optimal non-dominated solutions of multi-objective economic load dispatch. Comparison with Multi-objective Evolutionary Algorithm (MOEA) showed the superiority of the proposed MOPSO approach and confirmed its potential for solving multi-objective economic load dispatch.

Research in multi-objective particle swarm optimizers (MOPSOs) progresses by proposing one new MOPSO at a time. In spite of the commonalities among different MOPSOs, it is often unclear which algorithmic components are crucial for explaining the performance of a particular MOPSO design. Moreover, it is expected that different designs may perform best on different problem families and identifying a best overall MOPSO is a challenging task. We tackle this challenge here by: (1) proposing AutoMOPSO, a flexible algorithmic template for designing MOPSOs with a design space that can instantiate thousands of potential MOPSOs; and (2) searching for good-performing MOPSO designs given a family of training problems by means of an automatic configuration tool (irace). We apply this automatic design methodology to generate a MOPSO that significantly outperforms two state-of-the-art MOPSOs on four well-known bi-objective problem families. We also identify the key design choices and parameters of the winning MOPSO by means of ablation. AutoMOPSO is publicly available as part of the jMetal framework.

As an important part of rotating machinery, the degradation trend prediction of rolling bearings is the key to reducing economic losses and ensuring safe production. To improve the accuracy of prediction, a degradation trend prediction method of rolling bearings based on Mahalanobis distance (MD) and long and short term memory network (LSTM) is proposed. Firstly, the original vibration signal is decomposed and reconstructed by ensemble empirical mode decomposition (EEMD), and the feature space in the time domain and frequency domain is constructed. Then, the correlation, monotonicity, and robustness criteria are used to comprehensively screen the features, and the optimal feature subset is obtained. MD is calculated as the performance degradation index. Finally, the LSTM model is used to predict the degradation trend of bearings. The results show that the proposed method can effectively extract features and accurately predict the trend of performance degradation.

A novel approach to hybrid dynamic environmental-economic dispatch of multi-energy complementary virtual power plant considering renewable energy generation uncertainty and demand response

This paper deals with a multi-objective unequal sized dynamic facility layout problem (DFLP) with pickup/drop-off locations. First, a mathematical model to obtain optimal solutions for small size instances of the problem is developed. Then, a multi-objective particle swarm optimisation (MOPSO) algorithm is implemented to find near optimal solutions. Two new heuristics to prevent overlapping of the departments and to reduce ‘unused gaps’ between the departments are introduced. The performance of the MOPSO is examined using some sets of available test problems in the literature and various random test problems in small, medium, and large sizes. The percentage of improvements on the initial solutions is calculated for small, medium and large size instances. Also, the generation metric and the space metric for non-dominated solutions are examined. These experiments show the good performance of the developed MOPSO and sensitivity analysis show the robustness of the obtained solutions.