Design and Maintenance Optimisation of Substation Automation Systems: A Multiobjectivisation Approach Exploration

This study compared the performances of three state-of-theart evolutionary multi-objective optimization algorithms: the Non-Dominated Sorted Genetic Algorithm II (NSGA-II), the Epsilon-Dominance Non-Dominated Sorted Genetic Algorithm II (e -NSGA-II) and the Epsilon-Dominance Multi-Objective Evolutionary Algorithm ( e MOEA), on a constrained biobjective crop-mix planning problem (BCP). The BCP test case objectives were to: (i) maximize crop production and (ii) minimize planting area. The BCP problem was enumerated to provide the true Pareto-optimal solution set to facilitate rigorous testing of the evolutionary multi-objective optimization algorithms. The performances of the three algorithms were assessed and compared using three performance metrics (additive epsilon indicator, inverted generational distance and spacing). For the comparative study, a graphical comparison with respect to true Pareto front of optimal crop planning problem was provided. Results of the analyses indicated that the e MOEA greatly outperforms the NSGAII and the e -NSGA-II.

An Enhanced multi-objective evolutionary optimization algorithm based on decomposition (E-MOEA-D) proposed for optimal placement of Distributed Generation (DG) and Electric Vehicle (EV) Fast Charging Station (FCS) in distribution system. The diversity of the evolutionary algorithm improves the convergence and diverse solution in the process of evolutionary optimization. The proposed algorithm is improved using enhanced diversity algorithm, which yield diverse candidate solutions in population. The optimal placement of DGs and FCS are formulated using three objective functions as i) Active power loss ii) Voltage deviation iii) DG cost. The proposed algorithm is simulated on IEEE-33 bus distribution system. The proposed algorithm is compared with other competitive multi-objective evolutionary algorithms such as decomposition based multi-objective evolutionary algorithm (MOEA-D) and Non-dominated sorting multi-objective evolutionary algorithm (NSGA-II).

In this paper we propose a methodology based on an evolutionary multiobjective optimization algorithm for the problem of up-grading (expansion) the physical topology of transparent optical networks. The aim is to define the new topology layout and the specification of the new optical devices that should be deployed in an existing network in order to improve its performance, considering simultaneously the total installation cost (capital cost) and the total network blocking probability (performance criteria). To accomplish that, we propose a capital cost model for the network. We considered the following physical layer impairments: losses in optical devices, amplified spontaneous emission in optical amplifier and homodyne crosstalk in optical cross connect. The multiobjective optimization evolutionary algorithm used in the optimization process is the NSGA-II. Our proposed methodology can solve the expand physical topology design problem taking into account the physical layer impairments and the capital costs simultaneously. We also present a case study to show the effectiveness of our methodology.

Using Pareto-based multi-objective Evolution algorithms in decision structure to transfer the hazardous materials to safety storage centre

Almost all real-world and engineering problems involve multi-objective optimization of some sort that is often constrained. To solve these constrained multi-objective optimization problems, constrained multi-objective optimization evolutionary algorithms (CMOEAs) are enlisted. These CMOEAs require specific constraint handling techniques. This study aims to address and test the most successful constraint handling techniques, seven different penalty constraint techniques, as applied to the Non-dominated Sorting Genetic Algorithm II (NSGA-II). In this paper, NSGA-II is chosen because of its high popularity amongst evolutionary algorithms. Inverted Generational Distance and Hypervolume are the main metrics that are discussed to compare the constraint handling techniques. NSGA-II is applied on 13 constrained multi-objective problems known as CF1-CF10, C1-DTLZ1, C2-DTLZ2, and C3-DTLZ4. The result of IGD and HV values are compared and the feasibility proportions of each combination on each problem are shown. The results of simulation present interesting findings that have been presented at the end of paper as discussion and conclusion.

Distribution system (DS) service restoration is a very complex multi-objective and multi-constraint optimization problem, which requires high-quality Pareto fronts for helping the DS operators' work. This paper proposes a multi-objective evolutionary algorithm (MOEA) that combines the advantages of MOEAs in Tables with the properties of the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to recover Pareto fronts of the service problem. Its main differentials are its ability of recovering high-quality Pareto fronts, even in large-scale DSs, and of prioritizing switching operations in Remotely Controlled Switches (RCSs), independently of amount of RCSs. In opposite of Manually Controlled Switches (MCSs), RCS can be faster and cheapest operated from operating center. Several tests were carried out to validate and to compare the proposed MOEA to three MOEAs published in literature. Four metrics were used for assessing the quality of Pareto fronts generated and a Welch's t hypothesis test enabled the comparison of MOEAs' performance. Test results indicate the proposed MOEA outperforms those three MOEAs published in literature.

Water distribution networks (WDN) model optimization is an important part of smart water systems to achieve optimal strategies. WDN optimization focuses on the nonlinearity of the discharge head loss equation, the availability of discrete properties of pipe sizes, and the conservation of constraints. Multi-objective evolutionary algorithms (MOEAs) have been proposed and successfully applied in the field of WDN design optimization. Previous studies have focused on comparing the optimization effects of algorithms in water distribution networks, ignoring the problems of unbalanced pressure distribution and water hammer at the nodes of the pipe network caused by the complex terrain in mountainous areas. In this paper, a multi-objective water supply optimization model that integrated cost, reliability, and water quality was established for a mountainous WDN in real engineering. The method of traversing the nodes to solve the water age was introduced to find a more scientific and practical water age solution model, with setting the weight function to evaluate the water age of the water supply model comprehensively. Strength Pareto Evolutionary Algorithm II (SPEA-II) and Non-dominated Sorting Genetic Algorithm II (NSGA-II) were adopted to optimize the WDN design model in the mountainous complex terrain. The significance levels of the number of Pareto solutions (NOPS) and running time are 0.029 and 0.001, respectively, indicating that the two algorithms have significant differences. Compared to NSGA-II, SPEA-II has a better convergence rate and running time in multi-objective water supply optimization design. The solution set distribution of SPEA-II is more concentrated than that of NSGA-II, also the numerical value is better. The number of SPEA-II optimization schemes is larger and the scheme is more effective. Among them, the Pareto solution set of SPEA-II can obtain more desirable optimization results on cost, reliability index (RI) and water age. In summary, the study provides valuable information for decision makers in WDN with complex terrain.

Multi-objective Cascade Control of Regulatory Process with Two Conflicting Objectives

Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)

The non-dominated sorting genetic algorithm II (NSGA-II) is the most intensively used multi-objective evolutionary algorithm (MOEA) in real-world applications. However, in contrast to several simple MOEAs analyzed also via mathematical means, no such study exists for the NSGA-II so far. In this work, we show that mathematical runtime analyses are feasible also for the NSGA-II. As particular results, we prove that with a population size larger than the Pareto front size by a constant factor, the NSGA-II with two classic mutation operators and three different ways to select the parents satisfies the same asymptotic runtime guarantees as the SEMO and GSEMO algorithms on the basic OneMinMax and LOTZ benchmark functions. However, if the population size is only equal to the size of the Pareto front, then the NSGA-II cannot efficiently compute the full Pareto front (for an exponential number of iterations, the population will always miss a constant fraction of the Pareto front). Our experiments confirm the above findings.

A multi-objective genetic optimization for fast, fuzzy rule-based credit classification with balanced accuracy and interpretability

Solving a tri-objective supply chain problem with modified NSGA-II algorithm

In recent years, multi-objective evolutionary optimization algorithms have shown success in different areas of research. Due to their efficiency and power, many researchers have concentrated on adapting evolutionary algorithms to generate Pareto solutions. This paper proposes a new memetic adaptive multi-objective evolutionary algorithm that is based on a three-term backpropagation network (MAMOT). This algorithm is an automatic search method for optimizing the parameters and performance of neural networks, and it relies on the use of the adaptive non-dominated sorting genetic algorithm-II integrated with the backpropagation algorithm, being used as a local search method. The presented MAMOT employs a self-adaptive mechanism toward improving the performance of the proposed algorithm and a local optimizer improving all the individuals in a population in order to obtain better accuracy and connection weights. In addition, it selects an appropriate number of hidden nodes simultaneously. The proposed method was applied to 11 datasets representing pattern classification problems, including two-class, multi-class and complex data reflecting real problems. Experiments were performed, and the results indicated that the proposed method is viable in pattern classification tasks compared to a multi-objective genetic algorithm based on a three-term backpropagation network (MOGAT) and some of the methods mentioned in the literature. The statistical analysis results of the t test and Wilcoxon signed-ranks test also show that the performance of the proposed method is significantly better than MOGAT.

Towards Software Product Lines Optimization Using Evolutionary Algorithms

Determining the contribution of an agent to a system-level objective function (credit assignment) is a key area of research in cooperative multiagent systems. Multi-objective optimization is a growing area of research, though mostly focused on single agent settings. Many real-world problems are multiagent and multi-objective, (e.g., air traffic management, scheduling observations across multiple exploration robots) yet there is little work on their intersection. In this work, we leverage recent advances in single-objective multiagent learning to address multi-objective domains. We focus on the impact of difference evaluation functions (which extracts an agent's contribution to the team objective) on the Non-dominated Sorting Genetic Algorithm-II (NSGA-II), a state-of-the-art multi-objective evolutionary algorithm. We derive multiple methods for incorporating difference evaluations into the NSGA-II framework, and test each in a multiagent rover exploration domain, which is a good surrogate for a wide variety of distributed scheduling and resource gathering problems. We show that how and where difference evaluations are incorporated in the NSGA-II algorithm is critical, and can either provide significant benefits or destroy system performance, depending on how it is used. Median performance of the correctly used difference evaluations dominates best-case performance of NSGA-II in a multiagent multi-objective problem.