Evolutionary Maximization of Energy Amount Harvested by Means of Panel of Thermoelectric Modules

This work proposes the use of a specialized algorithm based on evolutionary computation to the global MPPT regulation of panel of thermoelectric modules connected serially in numerous string sections. Each section of the thermovoltaic panel is equipped with local DC/DC converter controlled by the proposed algorithm and finally this allows the optimization of the total efficiency of conversion. Evolutionary computations adjust PWM signals of switching waveforms of DC/DC sectional simple boost converters, which have outputs configured in parallel. It gives the chance to obtain the highest level of electric energy harvested, i.e., thanks to boost converting operational points precise adaptation to the system temperature profile as well as electric load level. The simulation results of the proposed evolutionary technique confirmed the high speed of the MPPT process that is much better than for perturbation and observation, as well as incremental conductance methods, and it assures concurrent optimization of numerous PWM signals. Next, the work shows practical optimization results achieved by the proposed algorithm implemented to microcontroller module controlling the DC/DC converter during thermal to electric conversion experiment. A laboratory thermovoltaic panel was constructed from a string of Peltier modules and radiator that assured passive cooling. The measurements obtained once more proved the MPPT evolutionary regulation properness and its adaptation effectiveness for different resistive test loads.

Optimization-based transient control of turbofan engines: a sequential quadratic programming approach

Engine transient control has been challenging due to its stringent requirements from both performance and safety. Many methodologies have been proposed such as conventional schedule-based methods, linear parameter varying, multiobjective optimization and evolutionary computations etc. These approaches have been well-established and led to a series of significant results. However, they are either not providing limit protection or requiring exhaustive computational resources, particularly when generating results into full flight envelope applications. Consequently a compromise between limit protection and computational complexity is necessitated. This note considers a sequential quadratic programming (SQP)-based method for full flight envelope investigations. The proposed method can provide important design guidance and the corresponding claims are validated through detailed analysis and simulations.

Implementation of new hybrid evolutionary algorithm with fuzzy logic control approach for optimization problems

The main purpose of using the hybrid evolutionary algorithm is to reach optimal values and achieve goals that traditional methods cannot reach and because there are different evolutionary computations, each of them has different advantages and capabilities. Therefore, researchers integrate more than one algorithm into a hybrid form to increase the ability of these algorithms to perform evolutionary computation when working alone. In this paper, we propose a new algorithm for hybrid genetic algorithm (GA) and particle swarm optimization (PSO) with fuzzy logic control (FLC) approach for function optimization. Fuzzy logic is applied to switch dynamically between evolutionary algorithms, in an attempt to improve the algorithm performance. The HEF hybrid evolutionary algorithms are compared to GA, PSO, GAPSO, and PSOGA. The comparison uses a variety of measurement functions. In addition to strongly convex functions, these functions can be uniformly distributed or not, and are valuable for evaluating our approach. Iterations of 500, 1000, and 1500 were used for each function. The HEF algorithm’s efficiency was tested on four functions. The new algorithm is often the best solution, HEF accounted for 75 % of all the tests. This method is superior to conventional methods in terms of efficiency

Convergence Analysis of Particle Swarm Optimization via Illustration Styles

Particle swarm optimization (PSO) is the most important and popular algorithm to solving the engineering optimization problem due to its simple updating formulas and excellent searching capacity. This algorithm is one of evolutionary computations and is also a population-based algorithm. Traditionally, to demonstrate the convergence analysis of the PSO algorithm or its related variations, simulation results in a numerical presentation are often given. This way may be unclear or unsuitable for some particular cases. Hence, this paper will adopt the illustration styles instead of numeric simulation results to more clearly clarify the convergence behavior of the algorithm. In addition, it is well known that three parameters used in the algorithm, i.e., the inertia weight w, position constants c1 and c2, sufficiently dominate the whole searching performance. The influence of these parameter settings on the algorithm convergence will be considered and examined via a simple two-dimensional function optimization problem. All simulation results are displayed using a series of illustrations with respect to various iteration numbers. Finally, some simple rules on how to suitably assign these parameters are also suggested

Approaches to Numerical Solution of Optimal Control Problem Using Evolutionary Computations

Two approaches to the numerical solution of the optimal control problem are studied. The direct approach is based on the reduction of the optimal control problem to a nonlinear programming problem. Another approach is so-called synthesized optimal control, and it includes the solution of the control synthesis problem and stabilization at some point in the state space, followed by the search of stabilization points and movement of the control object along these points. The comparison of these two approaches was carried out as the solution of the optimal control problem as a time function cannot be directly used in the control system, although the obtained discretized control can be embedded. The control object was a group of interacting mobile robots. Dynamic and static constraints were included in the quality criterion. Implemented methods were evolutionary algorithms and a random parameter search of piecewise linear approximation and coordinates of stabilization points, along with a multilayer network operator for control synthesis.

Comparison of a novel dominance-based differential evolution method with the state-of-the-art methods for solving multi-objective real-valued optimization problems

Differential Evolution algorithm (DE) is a well-known nature-inspired method in evolutionary computations scope. This paper adds some new features to DE algorithm and proposes a novel method focusing on ranking technique. The proposed method is named as Dominance-Based Differential Evolution, called DBDE from this point on, which is the improved version of the standard DE algorithm. The suggested DBDE applies some changes on the selection operator of the Differential Evolution (DE) algorithm and modifies the crossover and initialization phases to improve the performance of DE. The dominance ranks are used in the selection phase of DBDE to be capable of selecting higher quality solutions. A dominance-rank for solution X is the number of solutions dominating X. Moreover, some vectors called target vectors are used through the selection process. Effectiveness and performance of the proposed DBDE method is experimentally evaluated using six well-known benchmarks, provided by CEC2009, plus two additional test problems namely Kursawe and Fonseca & Fleming. The evaluation process emphasizes on specific bi-objective real-valued optimization problems reported in literature. Likewise, the Inverted Generational Distance (IGD) metric is calculated for the obtained results to measure the performance of algorithms. To follow up the evaluation rules obeyed by all state-of-the-art methods, the fitness evaluation function is called 300.000 times and 30 independent runs of DBDE is carried out. Analysis of the obtained results indicates that the performance of the proposed algorithm (DBDE) in terms of convergence and robustness outperforms the majority of state-of-the-art methods reported in the literature