Multi-objective routing optimization using evolutionary algorithms

Wireless ad hoc networks suffer from several limitations, such as routing failures, potentially excessive bandwidth requirements, computational constraints and limited storage capability. Their routing strategy plays a significant role in determining the overall performance of the multi-hop network. However, in conventional network design only one of the desired routing-related objectives is optimized, while other objectives are typically assumed to be the constraints imposed on the problem. In this paper, we invoke the Non-dominated Sorting based Genetic Algorithm-II (NSGA-II) and the MultiObjective Differential Evolution (MODE) algorithm for finding optimal routes from a given source to a given destination in the face of conflicting design objectives, such as the dissipated energy and the end-to-end delay in a fully-connected arbitrary multi-hop network. Our simulation results show that both the NSGA-II and MODE algorithms are efficient in solving these routing problems and are capable of finding the Pareto-optimal solutions at lower complexity than the ’brute-force’ exhaustive search, when the number of nodes is higher than or equal to 10. Additionally, we demonstrate that at the same complexity, the MODE algorithm is capable of finding solutions closer to the Pareto front and typically, converges faster than the NSGA-II algorithm

Comparison between five stochastic global search algorithms for optimizing thermoelectric generator designs

In this study, the best settings of five heuristics are determined for solving a mixed-integer non-linear multi-objective optimization problem. The algorithms treated in the article are: ant colony optimization, genetic algorithm, particle swarm optimization, differential evolution, and teaching-learning basic algorithm. The optimization problem consists in optimizing the design of a thermoelectric device, based on a model available in literature. Results showed that the inner settings can have different effects on the algorithm performance criteria depending on the algorithm. A formulation based on the weighted sum method is introduced for solving the multiobjective optimization problem with optimal settings. It was found that the five heuristic algorithms have comparable performances. Differential evolution generated the highest number of non-dominated solutions in comparison with the other algorithms

Improving the multi-objective evolutionary optimization algorithm for hydropower reservoir operations in the California Oroville-Thermalito complex

This study demonstrates the application of an improved Evolutionary optimization Algorithm (EA), titled Multi-Objective Complex Evolution Global Optimization Method with Principal Component Analysis and Crowding Distance Operator (MOSPD), for the hydropower reservoir operation of the Oroville-Thermalito Complex (OTC) - a crucial head-water resource for the California State Water Project (SWP). In the OTC's water-hydropower joint management study, the nonlinearity of hydropower generation and the reservoir's water elevation-storage relationship are explicitly formulated by polynomial function in order to closely match realistic situations and reduce linearization approximation errors. Comparison among different curve-fitting methods is conducted to understand the impact of the simplification of reservoir topography. In the optimization algorithm development, techniques of crowding distance and principal component analysis are implemented to improve the diversity and convergence of the optimal solutions towards and along the Pareto optimal set in the objective space. A comparative evaluation among the new algorithm MOSPD, the original Multi-Objective Complex Evolution Global Optimization Method (MOCOM), the Multi-Objective Differential Evolution method (MODE), the Multi-Objective Genetic Algorithm (MOGA), the Multi-Objective Simulated Annealing approach (MOSA), and the Multi-Objective Particle Swarm Optimization scheme (MOPSO) is conducted using the benchmark functions. The results show that best the MOSPD algorithm demonstrated the best and most consistent performance when compared with other algorithms on the test problems. The newly developed algorithm (MOSPD) is further applied to the OTC reservoir releasing problem during the snow melting season in 1998 (wet year), 2000 (normal year) and 2001 (dry year), in which the more spreading and converged non-dominated solutions of MOSPD provide decision makers with better operational alternatives for effectively and efficiently managing the OTC reservoirs in response to the different climates, especially drought, which has become more and more severe and frequent in California

Adaptiver Suchansatz zur multidisziplinären Optimierung von Leichtbaustrukturen unter Verwendung hybrider Metaheuristik

Within the last few years environmental regulations, safety requirements and market competitions forced the automotive industry to open up a wide range of new technologies. Lightweight design is considered as one of the most innovative concepts to fulfil environmental, safety and many other objectives at competitive prices. Choosing the best design and production process in the development period is the most significant link in the automobile production chain. A wide range of design and process parameters needs to be evaluated to achieve numerous goals of production. These goals often stand in conflict with each other. In addition to the variation of the concepts and following the objectives, some limitations such as manufacturing restrictions, financial limits, and deadlines influence the choice of the best combination of variables. This study introduces a structural optimization tool for assemblies made of sheet metal, e.g. the automobile body, based on parametrization and evaluation of concepts in CAD and CAE. This methodology focuses on those concepts, which leads to the use of the right amount of light and strong material in the right place, instead of substituting the whole structure with the new material. An adaptive hybrid metaheuristic algorithm is designed to eliminate all factors that would lead to a local minimum instead of global optimum. Finding the global optimum is granted by using some explorative and exploitative search heuristics, which are intelligently organized by a central controller. Reliability, accuracy and the speed of the proposed algorithm are validated via a comparative study with similar algorithms for an academic optimization problem, which shows valuable results. Since structures might be subject to a wide range of load cases, e.g. static, cyclic, dynamic, temperature-dependent etc., these requirements need to be addressed by a multidisciplinary optimization algorithm. To handle the nonlinear response of objectives and to tackle the time-consuming FEM analyses in crash situations, a surrogate model is implemented in the optimization tool. The ability of such tool to present the optimum results in multi-objective problems is improved by using some user-selected fitness functions. Finally, an exemplary sub-assembly made of sheet metal parts from a car body is optimized to enhance both, static load case and crashworthiness.Die Automobilindustrie hat in den letzten Jahren unter dem Druck von Umweltvorschriften, Sicherheitsanforderungen und wettbewerbsfähigem Markt neue Wege auf dem Gebiet der Technologien eröffnet. Leichtbau gilt als eine der innovativsten und offenkundigsten Lösungen, um Umwelt- und Sicherheitsziele zu wettbewerbsfähigen Preisen zu erreichen. Die Wahl des besten Designs und Verfahrens für Produktionen in der Entwicklungsphase ist der wichtigste Ring der Automobilproduktionskette. Um unzählige Produktionsziele zu erreichen, müssen zahlreiche Design- und Prozessparameter bewertet werden. Die Anzahl und Variation der Lösungen und Ziele sowie einige Einschränkungen wie Fertigungsbeschränkungen, finanzielle Grenzen und Fristen beeinflussen die Auswahl einer guten Kombination von Variablen. In dieser Studie werden strukturelle Optimierungswerkzeuge für aus Blech gefertigte Baugruppen, z. Karosserie, basierend auf Parametrisierung und Bewertung von Lösungen in CAD bzw. CAE. Diese Methodik konzentriert sich auf die Lösungen, die dazu führen, dass die richtige Menge an leichtem / festem Material an der richtigen Stelle der Struktur verwendet wird, anstatt vollständig ersetzt zu werden. Eine adaptive Hybrid-Metaheuristik soll verhindern, dass alle Faktoren, die Bedrohungsoptimierungstools in einem lokalen Minimum konvergieren, anstelle eines globalen Optimums. Das Auffinden des globalen Optimums wird durch einige explorative und ausbeuterische Such Heuristiken gewährleistet. Die Zuverlässigkeit, Genauigkeit und Geschwindigkeit des vorgeschlagenen Algorithmus wird mit ähnlichen Algorithmen in akademischen Optimierungsproblemen validiert und führt zu respektablen Ergebnissen. Da Strukturen möglicherweise einem weiten Bereich von Lastfällen unterliegen, z. statische, zyklische, dynamische, Temperatur usw. Möglichkeit der multidisziplinären Optimierung wurde in Optimierungswerkzeugen bereitgestellt. Um die nichtlineare Reaktion von Zielen zu überwinden und um den hohen Zeitverbrauch von FEM-Analysen in Absturzereignissen zu bewältigen, könnte ein Ersatzmodell vom Benutzer verwendet werden. Die Fähigkeit von Optimierungswerkzeugen, optimale Ergebnisse bei Problemen mit mehreren Zielsetzungen zu präsentieren, wird durch die Verwendung einiger vom Benutzer ausgewählten Fitnessfunktionen verbessert. Eine Unterbaugruppe aus Blechteilen, die zur Automobilkarosserie gehören, ist optimiert, um beide zu verbessern; statischer Lastfall und Crashsicherheit

Fast Multi-Objective CMODE-Type Optimization of PM Machines Using Multicore Desktop Computers

Large-scale design optimization of electric machines is oftentimes practiced to achieve a set of objectives, such as the minimization of cost and power loss, under a set of constraints, such as maximum permissible torque ripple. Accordingly, the design optimization of electric machines can be regarded as a constrained optimization problem (COP). Evolutionary algorithms (EAs) used in the design optimization of electric machines including differential evolution (DE), which has received considerable attention during recent years, are unconstrained optimization methods that need additional mechanisms to handle COPs. In this paper, a new optimization algorithm that features combined multi-objective optimization with differential evolution (CMODE) has been developed and implemented in the design optimization of electric machines. A thorough comparison is conducted between the two counterpart optimization algorithms, CMODE and DE, to demonstrate CMODE\u27s superiority in terms of convergence rate, diversity and high definition of the resulting Pareto fronts, and its more effective constraint handling. More importantly, CMODE requires a lesser number of simultaneous processing units which makes its implementation best suited for state-of-the-art desktop computers reducing the need for high-performance computing systems and associated software licenses

Pattern Synthesis in Time-Modulated Arrays Using Heuristic Approach

Time-modulation principle evolves as an emerging technology for easy realization of the desired array patterns with the help of an additional degree of freedom, namely, “time.” To the antenna community, the topic, time-modulated antenna array (TMAA) or 4D antenna arrays, has got much attention during the last two decades. However, population-based, stochastic, heuristic evolutionary algorithm plays as an important protagonist to meet the essential requirements on synthesizing the desired array patterns. This chapter is basically devoted to understand the theory of different time-modulation principles and the application of optimization techniques in solving different antenna array synthesis problems. As a first step, the theory of time-modulation principles and the behaviors of the sideband radiation (SBR) that appeared due to time modulation have been studied. Then, different important aspects associated with TMAA synthesis problems have been discussed. These include conflicting parameters, the need of evolutionary algorithms, multiple objectives and their optimization, cost function formation, and selection of weighting factors. After that, a novel approach to design a time modulator for synthesizing TMAAs is presented. Finally, discussing the working principle of an efficient heuristic approach, namely, artificial bee colony (ABC) algorithm, the effectiveness of the time modulator and potentiality of the algorithm are presented through representative numerical examples

A Novel Fractional Order Fuzzy PID Controller and Its Optimal Time Domain Tuning Based on Integral Performance Indices

A novel fractional order (FO) fuzzy Proportional-Integral-Derivative (PID) controller has been proposed in this paper which works on the closed loop error and its fractional derivative as the input and has a fractional integrator in its output. The fractional order differ-integrations in the proposed fuzzy logic controller (FLC) are kept as design variables along with the input-output scaling factors (SF) and are optimized with Genetic Algorithm (GA) while minimizing several integral error indices along with the control signal as the objective function. Simulations studies are carried out to control a delayed nonlinear process and an open loop unstable process with time delay. The closed loop performances and controller efforts in each case are compared with conventional PID, fuzzy PID and PI{\lambda}D{\mu} controller subjected to different integral performance indices. Simulation results show that the proposed fractional order fuzzy PID controller outperforms the others in most cases.Comment: 30 pages, 20 figure