Intelligent Optimal Control of Sewage Treatment Based on Multiobjective Evolutionary Algorithm

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.

Optimal control methods have gained significant attention due to their promising performance in nonlinear systems. In general, an optimal control method is regarded as an optimization process for solving the optimal control laws. However, for uncertain nonlinear systems with complex optimization objectives, the solving of optimal reference trajectories is difficult and significant that might be ignored to obtain robust performance. For this problem, a double-closed-loop robust optimal control (DCL-ROC) is proposed to maintain the optimal control reliability of uncertain nonlinear systems. First, a double-closed-loop scheme is established to divide the optimal control process into a closed-loop optimization process that solves optimal reference trajectories and a closed-loop control process that solves optimal control laws. Then, the ability of the optimal control method can be improved to solve complex uncertain optimization problems. Second, a closed-loop robust optimization (CL-RO) algorithm is developed to express uncertain optimization objectives as data-driven forms and adjust optimal reference trajectories in a close loop. Then, the optimality of reference trajectories can be improved under uncertainties. Third, the optimal reference trajectories are tracked by an adaptive controller to derive the optimal control laws without certain system dynamics. Then, the adaptivity and reliability of optimal control laws can be improved. The experimental results demonstrate that the proposed method can achieve better performance than other optimal control methods.

Multi-objective pity beetle algorithm based optimal control of wastewater treatment process

In different branches of economics-especially in the construction industry - supply systems are found, in which producers and consumers are connected by production and transport. By the occurrence of random or foreseeable perturbations an optimal control of the supply processes is appropriate. First directed graphs are assigned to special supply systems. On there graphs multistage decision processes are defined to yield an optimal control of the supply processes. The explicit representation of the perturbing quantities by parameters is decisive for optimal control. Next, an optimization problem is formulated, which includes as a special case the problem of optimal control of supply processes. This mathematical modelling and the solution of the optimization problems require some extensions of the known theory of multistage decision processes.

Multi-objective optimisation of software application mappings on heterogeneous MPSoCs: TONPET versus R2-EMOA

Runtime analysis of a multi-objective evolutionary algorithm for obtaining finite approximations of Pareto fronts

Dynamic programming (DP) is an elegant way to solve problems related to optimization and optimal control of processes. DP, however, has one major drawback, namely the “curse of dimensionality”. To overcome this shortcoming, an approach called neuro-dynamic programming (NDP) has been developed. This approach solves the “curse of dimensionality” problem of DP. For this purpose, a neural network is used in NDP, which ignores the poor results of the utility criterion. In this way, the time for solving the specific task is significantly shortened. In this work, an NDP algorithm is presented for the optimal control of a fed-batch biotechnological process for the production of L-lysine by the strain Brevibacterium flavum 22LD. Application of the NDP algorithm ensures maximum productivity of the L-lysine.

Evolutionary multi-objective algorithms (EMOA) using performance indicators for the selection of individuals have turned out to be a successful technique for multi-objective problems. Especially, the selection based on the $\mathcal{S}$-metric, as implemented in the SMS-EMOA, seems to be effective. A special feature of this EMOA is the greedy (μ + 1) selection. Based on a pathological example for a population of size two and a discrete Pareto front it has been proven that a (μ + 1)- (or 1-greedy) EMOA may fail in finding a population maximizing the $\mathcal{S}$-metric. This work investigates the performance of (μ + 1)-EMOA with small fixed-size populations on Pareto fronts of innumerable size. We prove that an optimal distribution of points can always be achieved on linear Pareto fronts. Empirical studies support the conjecture that this also holds for convex and concave Pareto fronts, but not for continuous shapes in general. Furthermore, the pathological example is generalized to a continuous objective space and it is demonstrated that also (μ + k )-EMOA are not able to robustly detect the globally optimal distribution.

Reference sets generated with uniformly distributed weight vectors on a unit simplex are widely used by several multi-objective evolutionary algorithms (MOEAs). They have been employed to tackle multi-objective optimization problems (MOPs) with four or more objective functions, i.e., the so-called many-objective optimization problems. These MOEAs have shown a good performance on MOPs with regular Pareto front shapes, i.e., simplex-like shapes. However, it has been observed that in many cases, their performance degrades on MOPs with irregular Pareto front shapes. In this paper, we designed a new selection mechanism that aims to promote a Pareto front shape invariant performance of MOEAs that use weight vector-based reference sets. The newly proposed selection mechanism takes advantage of weight vector-based reference sets and seven pair-potential functions. It was embedded into the non-dominated sorting genetic algorithm III (NSGA-III) to increase its performance on MOPs with different Pareto front geometries. We use the DTLZ and DTLZ\(^{-1}\) test problems to perform an empirical study about the usage of these pair-potential functions for this selection mechanism. Our experimental results show that the pair-potential functions can enhance the distribution of solutions obtained by weight vector-based MOEAs on MOPs with irregular Pareto front shapes. Also, the proposed selection mechanism permits maintaining the good performance of these MOEAs on MOPs with regular Pareto front shapes.

Hybrid evolutionary robust optimization-based optimal control for time-delay nonlinear systems

Many of the problems that arise in production systems can be handled with multiobjective techniques. One of those problems is that of scheduling operations subject to constraints on the availability of machines and buffer capacity. In this paper we analyze different Evolutionary multiobjective Algorithms (MOEAs) for this kind of problems. We consider an experimental framework in which we schedule production operations for four real world Job-Shop contexts using three algorithms, NSGAII, SPEA2, and IBEA. Using two performance indexes, Hypervolume and R2, we found that SPEA2 and IBEA are the most efficient for the tasks at hand. On the other hand IBEA seems to be a better choice of tool since it yields more solutions in the approximate Pareto frontier.

Efficient design and management of water distribution networks is critical for conservation of water resources and minimization of both energy requirements and maintenance costs. Several computational routines have been proposed for the optimization of operational parameters that govern such networks. In particular, multi-objective evolutionary algorithms have proven to be useful both properly describing a network and optimizing its performance. Despite these computational advances, practical implementation of multi-objective optimization algorithms for water networks is an abstruse subject for researchers and engineers, particularly since efficient coupling between multi-objective algorithms and the hydraulic network model is required. Further, even if the coupling is successfully implemented, selecting the proper set of multi-objective algorithms for a given network, and addressing the quality of the obtained results (i.e., the approximate Pareto frontier) introduces additional complexities that further hinder the practical application of these algorithms. Here, we present an open-source project that couples the EPANET hydraulic network model with the jMetal framework for multi-objective optimization, allowing flexible implementation and comparison of different metaheuristic optimization algorithms through statistical quality assessment. Advantages of this project are discussed by comparing the performance of different multi-objective algorithms (i.e., NSGA-II, SPEA2, SMPSO) on case study water pump networks available in the literature.

In order to protect the environment and slow down global warming trend, many governments and environmentalists are keen at promoting the use of plug-in hybrid electric vehicles (PHEVs). As a result, more and more PHEVs have been put into use. However, load peak caused by their disordered charging can be detrimental to an entire power grid. Several methods have been proposed to establish ordered PHEV charging. While focusing on single-objective load scheduling, they fail to meet the real requirements that need one to conduct multiple objective optimization. This paper formulates a multi-objective load scheduling problem to minimize two competing objectives: 1) potential serious peak-to-valley difference and 2) economic loss. When we apply existing multi-objective evolutionary algorithms (MOEAs), i.e., multi-objective particle swarm optimization (MOPSO), Nondominated Sorting Genetic Algorithm II, MOEA based on decomposition, and multi-objective differential evolutionary algorithm to solve it, because its high dimension and special conditions we find that they fail to reach the Pareto Front or converge into a relatively small area only. Therefore, we propose a weight aggregation (WA) strategy and implement a novel MOEA algorithm named WA-MOPSO by incorporating WA into MOPSO to solve the problem. Its effectiveness and efficiency to generate a Pareto front of this problem are verified and compared with those of the state-of-the-art approaches. Furthermore, WA is also combined with other MOEAs to solve the defined scheduling problem.

Evolutionary Multi-objective Optimization(EMO) is becoming a hot research area and quite a few aspects of Multi-objective Evolutionary algorithms(MOEAs) have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by a representative combinatorial Multi-objective Problem(MOP): Multi-objective TSP. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two kinds of selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using Finite Markov Chain and proved that it could converge to Pareto Front with probability 1.We also find that the convergence property of MOEAs has much relationship with search and selection operators.

A number of multiobjective evolutionary algorithms (MOEAs) have been developed and applied to water resource optimization problems over the past decade. The comparative performance of these MOEAs has been investigated often according to their overall end-of-run results (quality of optimal fronts) within prespecified computational budgets. Despite the importance of such comparative analyses, these studies have provided little knowledge of how different MOEAs navigate through the decision space toward the Pareto front. To address this issue, this paper uses a range of metrics to quantitively characterize MOEAs’ run-time searching behavior, with a focus on the statistics of search quality and convergence progress. The metrics are applied to three state-of-the-art MOEAs, including the nondominated sorting genetic algorithm-II (NSGA-II), self-adaptive multiobjective differential evolution (SAMODE), and Borg, for six water distribution system (WDS) design problems with the objectives of minimizing netwo...