Wind-solar-hydrothermal dispatch using convex optimization

In this research a convex optimization methodology is proposed for the Shortterm hydrothermal scheduling (STHS). In addition, wind and solar generation are also considered under a robust approach by modeling the equilibrium of power flow constraint as chance box constraints, which allows determining the amount of renewable source available with a specific probability value. The proposed methodology guarantees global optimum of the convexified model andfast convergences..

Two-Step Many-Objective Optimal Power Flow Based on Knee Point-Driven Evolutionary Algorithm

To coordinate the economy, security and environment protection in the power system operation, a two-step many-objective optimal power flow (MaOPF) solution method is proposed. In step 1, it is the first time that knee point-driven evolutionary algorithm (KnEA) is introduced to address the MaOPF problem, and thereby the Pareto-optimal solutions can be obtained. In step 2, an integrated decision analysis technique is utilized to provide decision makers with decision supports by combining fuzzy c-means (FCM) clustering and grey relational projection (GRP) method together. In this way, the best compromise solutions (BCSs) that represent decision makers' different, even conflicting, preferences can be automatically determined from the set of Pareto-optimal solutions. The primary contribution of the proposal is the innovative application of many-objective optimization together with decision analysis for addressing MaOPF problems. Through examining the two-step method via the IEEE 118-bus system and the real-world Hebei provincial power system, it is verified that our approach is suitable for addressing the MaOPF problem of power systems.Comment: Accepted by Journal Processe

Solution of combined heat and power economic dispatch problem using genetic algorithm.

Masters Degree. University of KwaZulu-Natal, Durban.The combination of heat and power constitutes a system that provides electricity and thermal energy concurrently. Its high efficiency and significant emission reduction makes it an outstanding prospect in the future of energy production and transmission. The broad application of combined heat and power units requires the joint dispatch of power and heating systems, in which the modelling of combined heat and power units plays a vital role. This research paper employed genetic algorithm, artificial bee colony, differential evolution, particle swarm optimization and direct solution algorithms to evaluate the cost function as well as output decision variables of heat and power in a system that has simple cycle cogeneration unit with quadratic cost function. The system was first modeled to determine the various parameters of combined heat and power units in order to solve the economic dispatch problem with direct solution algorithm. In order for modelling to be done, a general structure of combined heat and power must be defined. The system considered in this research consists of four test units, i.e. two conventional power units, one combined heat and power unit and one heat-only unit. These algorithms were applied to on the research data set to determine the required decision variables while taking into account the power and heat units, operation bound of power and heat-only units as well as feasible operation region of the cogeneration unit. Power and heat output decision variables plus cost functions from Genetic Algorithm, differential evolution, Particle Swarm Optimization and artificial bee colony were determined using codes. Also, the decision variables and cost function value were obtained by calculations using direct solution algorithm. The findings of the research paper show that there are different ways in which combined heat and power economic dispatch variables can be determined, which include genetic algorithm, differential evolution, artificial bee colony, particle swarm optimization and direct solution algorithms. However, each solution method allows for different combined heat and power output decision variables to be found, with some of the methods (particle swarm optimization and artificial bee colony) having setbacks such as: large objective function values, slower convergence and large number solution. The analysis revealed that the differential evolution algorithm is a viable alternative to solving combined heat and power problems. This is due in most part to its faster convergence, minimum cost function value, and high quality solution which are diverse and widespread, more as a result of its effective search capability than genetic algorithm, particle swarm optimization, direct solution and artificial bee colony algorithms. The methods investigated in this research paper can be used and expanded on to create useful and accurate technique of solving combined heat and power problems

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Hybrid harmony search algorithm for continuous optimization problems

Harmony Search (HS) algorithm has been extensively adopted in the literature to address optimization problems in many different fields, such as industrial design, civil engineering, electrical and mechanical engineering problems. In order to ensure its search performance, HS requires extensive tuning of its four parameters control namely harmony memory size (HMS), harmony memory consideration rate (HMCR), pitch adjustment rate (PAR), and bandwidth (BW). However, tuning process is often cumbersome and is problem dependent. Furthermore, there is no one size fits all problems. Additionally, despite many useful works, HS and its variant still suffer from weak exploitation which can lead to poor convergence problem. Addressing these aforementioned issues, this thesis proposes to augment HS with adaptive tuning using Grey Wolf Optimizer (GWO). Meanwhile, to enhance its exploitation, this thesis also proposes to adopt a new variant of the opposition-based learning technique (OBL). Taken together, the proposed hybrid algorithm, called IHS-GWO, aims to address continuous optimization problems. The IHS-GWO is evaluated using two standard benchmarking sets and two real-world optimization problems. The first benchmarking set consists of 24 classical benchmark unimodal and multimodal functions whilst the second benchmark set contains 30 state-of-the-art benchmark functions from the Congress on Evolutionary Computation (CEC). The two real-world optimization problems involved the three-bar truss and spring design. Statistical analysis using Wilcoxon rank-sum and Friedman of IHS-GWO’s results with recent HS variants and other metaheuristic demonstrate superior performance

Enhancement of Metaheuristic Algorithm for Scheduling Workflows in Multi-fog Environments

Whether in computer science, engineering, or economics, optimization lies at the heart of any challenge involving decision-making. Choosing between several options is part of the decision- making process. Our desire to make the "better" decision drives our decision. An objective function or performance index describes the assessment of the alternative's goodness. The theory and methods of optimization are concerned with picking the best option. There are two types of optimization methods: deterministic and stochastic. The first is a traditional approach, which works well for small and linear problems. However, they struggle to address most of the real-world problems, which have a highly dimensional, nonlinear, and complex nature. As an alternative, stochastic optimization algorithms are specifically designed to tackle these types of challenges and are more common nowadays. This study proposed two stochastic, robust swarm-based metaheuristic optimization methods. They are both hybrid algorithms, which are formulated by combining Particle Swarm Optimization and Salp Swarm Optimization algorithms. Further, these algorithms are then applied to an important and thought-provoking problem. The problem is scientific workflow scheduling in multiple fog environments. Many computer environments, such as fog computing, are plagued by security attacks that must be handled. DDoS attacks are effectively harmful to fog computing environments as they occupy the fog's resources and make them busy. Thus, the fog environments would generally have fewer resources available during these types of attacks, and then the scheduling of submitted Internet of Things (IoT) workflows would be affected. Nevertheless, the current systems disregard the impact of DDoS attacks occurring in their scheduling process, causing the amount of workflows that miss deadlines as well as increasing the amount of tasks that are offloaded to the cloud. Hence, this study proposed a hybrid optimization algorithm as a solution for dealing with the workflow scheduling issue in various fog computing locations. The proposed algorithm comprises Salp Swarm Algorithm (SSA) and Particle Swarm Optimization (PSO). In dealing with the effects of DDoS attacks on fog computing locations, two Markov-chain schemes of discrete time types were used, whereby one calculates the average network bandwidth existing in each fog while the other determines the number of virtual machines existing in every fog on average. DDoS attacks are addressed at various levels. The approach predicts the DDoS attack’s influences on fog environments. Based on the simulation results, the proposed method can significantly lessen the amount of offloaded tasks that are transferred to the cloud data centers. It could also decrease the amount of workflows with missed deadlines. Moreover, the significance of green fog computing is growing in fog computing environments, in which the consumption of energy plays an essential role in determining maintenance expenses and carbon dioxide emissions. The implementation of efficient scheduling methods has the potential to mitigate the usage of energy by allocating tasks to the most appropriate resources, considering the energy efficiency of each individual resource. In order to mitigate these challenges, the proposed algorithm integrates the Dynamic Voltage and Frequency Scaling (DVFS) technique, which is commonly employed to enhance the energy efficiency of processors. The experimental findings demonstrate that the utilization of the proposed method, combined with the Dynamic Voltage and Frequency Scaling (DVFS) technique, yields improved outcomes. These benefits encompass a minimization in energy consumption. Consequently, this approach emerges as a more environmentally friendly and sustainable solution for fog computing environments

Optimal Selection of Gear Ratio for Hybrid Electric Vehicles Using Modern Meta-Heuristics Search Algorithm

Gear Train Design problem is most important design problem for machine tools manufacturers. Recent work on gear train improvement has been bound towards multi-shaft gear trains of the speed-change kind, where major focus is to maximize the range of operating speeds and to minimize the number of gears and spindles. In the proposed research, a hybrid meta-heuristic search algorithm is presented to design and optimize multi-spindle gear trains problem. The objective of the research is to optimize gear trains on the basis of minimum overall centre distance, minimum overall size, minimum gear volume, or other desirable criteria, such as maximum contact or overlap ratios. The proposed hybrid meta-heuristic search algorithm is inspired by canis lupus family of grey wolves and exploitation capability of existing grey wolf optimizer is further enhanced by pattern search algorithm, which is a derivative-free, direct search optimization algorithm suitable for non-differential, discontinuous search space and does not require gradient for numerical optimization problem and have good exploitation capability in local search space. The effectiveness of the proposed algorithm has been tested on various mechanical and civil design problem including gear train design problem, which includes four different gear and experimental results are compared with others recently reported heuristics and meta-heuristics search algorithm. It has been found that the proposed algorithm indorses its effectiveness in the field of nature inspired meta heuristics algorithms for engineering design problems for hybrid electric vehicles

Multi-population-based differential evolution algorithm for optimization problems

A differential evolution (DE) algorithm is an evolutionary algorithm for optimization problems over a continuous domain. To solve high dimensional global optimization problems, this work investigates the performance of differential evolution algorithms under a multi-population strategy. The original DE algorithm generates an initial set of suitable solutions. The multi-population strategy divides the set into several subsets. These subsets evolve independently and connect with each other according to the DE algorithm. This helps in preserving the diversity of the initial set. Furthermore, a comparison of combination of different mutation techniques on several optimization algorithms is studied to verify their performance. Finally, the computational results on the arbitrarily generated experiments, reveal some interesting relationship between the number of subpopulations and performance of the DE. Centralized charging of electric vehicles (EVs) based on battery swapping is a promising strategy for their large-scale utilization in power systems. In this problem, the above algorithm is designed to minimize total charging cost, as well as to reduce power loss and voltage deviation of power networks. The resulting algorithm and several others are executed on an IEEE 30-bus test system, and the results suggest that the proposed algorithm is one of effective and promising methods for optimal EV centralized charging