Investigation of static transmission expansion planning using the symbiotic organisms search algorithm

Transmission expansion planning (TEP) has become a complex problem in restructured electricity markets. This article presents the symbiotic organisms search (SOS) algorithm, a novel metaheuristic optimization technique for solving TEP problems in power systems. The SOS algorithm is inspired by the interactions among organisms in an ecosystem. The TEP problem is formulated here as an optimization problem to determine the cost-effective expansion planning of electrical power systems. Several constraints, such as power flow of the lines, right-of-way validity and maximum line addition, are taken into consideration. First, the SOS algorithm is tested with several benchmark functions. Then, it is applied on three standard power system networks (IEEE 24-bus system, Brazilian 46-bus system and Brazilian 87-bus system) in a TEP study to demonstrate the optimization capability of the proposed SOS algorithm. The results are compared with those produced by other state-of-the-art algorithms.     

Real-parameter quantum evolutionary algorithm for economic load dispatch

A novel real-parameter optimisation algorithm called the 'real-parameter quantum evolutionary algorithm' is presented. The algorithm pieces together the ideas from evolutionary algorithms (EA) and quantum computing to provide a robust optimisation technique that can be utilised to optimise highly constrained non-linear real-parameter functions. Quantum bits have immense representational power due to their being in superposition of all the basic states at the same time. New quantum operators designed in this work enable the search to effectively handle the twin objectives of exploitation and exploration. This enables the search to be pursued with small population sizes, thereby speeding up the search process and also ensuring that there is no problem of premature convergence that often plagues pure EA implementations. The power of the proposed algorithm is demonstrated by solving the economic load dispatch (ELD) in power systems. ELD is to find the optimal loadings on the generators so as to achieve minimum operating cost while satisfying various system and unit-level constraints. The proposed method has been applied to standard load dispatch problems reported in the literature including the IEEE 30 bus system, IEEE 57 bus system and a 110-generator problem, and its performance has been compared with the results obtained by other methods. The results adequately demonstrate the enhanced search power of the proposed algorithm in terms of obtaining better solutions and provide motivation for its application to other real-parameter optimisation problems in power systems.     

A constraint consensus memetic algorithm for solving constrained optimization problems

Constraint handling is an important aspect of evolutionary constrained optimization. Currently, the mechanism used for constraint handling with evolutionary algorithms mainly assists the selection process, but not the actual search process. In this article, first a genetic algorithm is combined with a class of search methods, known as constraint consensus methods, that assist infeasible individuals to move towards the feasible region. This approach is also integrated with a memetic algorithm. The proposed algorithm is tested and analysed by solving two sets of standard benchmark problems, and the results are compared with other state-of-the-art algorithms. The comparisons show that the proposed algorithm outperforms other similar algorithms. The algorithm has also been applied to solve a practical economic load dispatch problem, where it also shows superior performance over other algorithms.     

Self-adaptiveness in particle swarm optimisation to enhance available transfer capability using thyristor-controlled series compensation (TCSC)

Available transfer capability (ATC) is one of the challenging criteria under the functioning of the deregulated power system. The high demand for improving ATC is generally met using flexible alternating current transmission system (FACTS) devices in the power system. However, it suffers from serious crisis during determination of the optimal location and compensation stage of FACTS. The present study uses thyristor-controlled series compensation (TCSC) devices in order to compensate for the limitation of FACTS. Further, a novel self-adapted particle swarm optimisation (SAPSO) algorithm is proposed in this study for enhancing ATC. Experiments are carried on three benchmark bus systems such as IEEE 24, IEEE 30 and IEEE 57. Performance and statistical analyses are carried out by comparing the proposed SAPSO with the conventional PSO. Eventually, the study proves the effectiveness of the proposed method in case of ATC enhancement.     

Phase retrieval,error reduction algorithm,and Fienup variants: a view from convex optimization

The phase retrieval problem is of paramount importance in various areas of applied physics and engineering. The state of the art for solving this problem in two dimensions relies heavily on the pioneering work of Gerchberg, Saxton, and Fienup. Despite the widespread use of the algorithms proposed by these three researchers, current mathematical theory cannot explain their remarkable success. Nevertheless, great insight can be gained into the behavior, the shortcomings, and the performance of these algorithms from their possible counterparts in convex optimization theory. An important step in this direction was made two decades ago when the error reduction algorithm was identified as a nonconvex alternating projection algorithm. Our purpose is to formulate the phase retrieval problem with mathematical care and to establish new connections between well-established numerical phase retrieval schemes and classical convex optimization methods. Specifically, it is shown that Fienup's basic input-output algorithm corresponds to Dykstra's algorithm and that Fienup's hybrid input-output algorithm can be viewed as an instance of the Douglas-Rachford algorithm. We provide a theoretical framework to better understand and, potentially, to improve existing phase recovery algorithms.     

Dark Forest Algorithm: A Novel Metaheuristic Algorithm for Global Optimization Problems

Metaheuristic algorithms, as effective methods for solving optimization problems, have recently attracted considerable attention in science and engineering fields. They are popular and have broad applications owing to their high efficiency and low complexity. These algorithms are generally based on the behaviors observed in nature, physical sciences, or humans. This study proposes a novel metaheuristic algorithm called dark forest algorithm (DFA), which can yield improved optimization results for global optimization problems. In DFA, the population is divided into four groups: highest civilization, advanced civilization, normal civilization, and low civilization. Each civilization has a unique way of iteration. To verify DFA’s capability, the performance of DFA on 35 well-known benchmark functions is compared with that of six other metaheuristic algorithms, including artificial bee colony algorithm, firefly algorithm, grey wolf optimizer, harmony search algorithm, grasshopper optimization algorithm, and whale optimization algorithm. The results show that DFA provides solutions with improved efficiency for problems with low dimensions and outperforms most other algorithms when solving high dimensional problems. DFA is applied to five engineering projects to demonstrate its applicability. The results show that the performance of DFA is competitive to that of current well-known metaheuristic algorithms. Finally, potential upgrading routes for DFA are proposed as possible future developments.     

Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems

This article presents an algorithm based on the Bernstein form of polynomials for solving the optimal power flow (OPF) problem in electrical power networks. The proposed algorithm combines local and global optimization methods and is therefore referred to as a ‘hybrid’ Bernstein algorithm in the context of this work. The proposed algorithm is a branch-and-bound procedure wherein a local search method is used to obtain a good upper bound on the global minimum at each branching node. Subsequently, the Bernstein form of polynomials is used to obtain a lower bound on the global minimum. The performance of the proposed algorithm is compared with the previously reported Bernstein algorithm to demonstrate its efficacy in terms of the chosen performance metrics. Furthermore, the proposed algorithm is tested on the OPF problem for several benchmark IEEE power system examples and its performance is compared with generic global optimization solvers such as BARON and COUENNE. The test results demonstrate that the hybrid Bernstein global optimization algorithm delivers satisfactory performance in terms of solution optimality.     

求解约束优化问题的改进布谷鸟搜索算法

为了提高约束优化问题的求解精度和收敛速度,提出求解约束优化问题的改进布谷鸟搜索算法。首先分析了基本布谷鸟搜索算法全局搜索和局部搜索过程中的不足,对其中全局搜索和局部搜索迭代公式进行重新定义,然后以一定概率在最优解附近进行搜索。对12个标准约束优化问题和4个工程约束优化问题进行测试并与多种算法进行对比,实验结果和统计分析表明所提算法在求解约束优化问题上具有较强的优越性。     

考虑任务拆分特性与簇准备时间的并行机调度

在印制电路板钻孔任务调度等工程实际中,普遍存在一类具有任务拆分特性与簇准备时间的并行机调度问题,尚缺乏高效的优化模型和方法。针对该问题,首先建立以总拖期最小为目标的数学模型,以约束的形式将两个现有优势定理嵌入其中。为了高效求解实际规模问题,进一步提出嵌入优势定理的模拟退火算法。最后,基于随机生成的算例构造计算实验,以验证所建模型和算法的有效性。实验结果表明,嵌入优势定理的数学模型在问题求解规模和计算效率方面均优于现有数学模型,嵌入优势定理的模拟退火算法同样优于现有模拟退火算法。     

Multi-objective hierarchical genetic algorithms for multilevel redundancy allocation optimization

Multilevel redundancy allocation optimization problems (MRAOPs) occur frequently when attempting to maximize the system reliability of a hierarchical system, and almost all complex engineering systems are hierarchical. Despite their practical significance, limited research has been done concerning the solving of simple MRAOPs. These problems are not only NP hard but also involve hierarchical design variables. Genetic algorithms (GAs) have been applied in solving MRAOPs, since they are computationally efficient in solving such problems, unlike exact methods, but their applications has been confined to single-objective formulation of MRAOPs. This paper proposes a multi-objective formulation of MRAOPs and a methodology for solving such problems. In this methodology, a hierarchical GA framework for multi-objective optimization is proposed by introducing hierarchical genotype encoding for design variables. In addition, we implement the proposed approach by integrating the hierarchical genotype encoding scheme with two popular multi-objective genetic algorithms (MOGAs)—the strength Pareto evolutionary genetic algorithm (SPEA2) and the non-dominated sorting genetic algorithm (NSGA-II). In the provided numerical examples, the proposed multi-objective hierarchical approach is applied to solve two hierarchical MRAOPs, a 4- and a 3-level problems. The proposed method is compared with a single-objective optimization method that uses a hierarchical genetic algorithm (HGA), also applied to solve the 3- and 4-level problems. The results show that a multi-objective hierarchical GA (MOHGA) that includes elitism and mechanism for diversity preserving performed better than a single-objective GA that only uses elitism, when solving large-scale MRAOPs. Additionally, the experimental results show that the proposed method with NSGA-II outperformed the proposed method with SPEA2 in finding useful Pareto optimal solution sets.     

Efficiently Solving the Redundancy Allocation Problem Using Tabu Search

A tabu search meta-heuristic has been developed and successfully demonstrated to provide solutions to the system reliability optimization problem of redundancy allocation. Tabu search is particularly well-suited to this problem and it offers distinct advantages compared to alternative optimization methods. While there are many forms of the problem, the redundancy allocation problem generally involves the selection of components and redundancy levels to maximize system reliability given various system-level constraints. This is a common and extensively studied problem involving system design, reliability engineering and operations research. It is becoming increasingly important to develop efficient solutions to this reliability optimization problem because many telecommunications (and other) systems are becoming more complex, yet with short development schedules and very stringent reliability requirements. Tabu search can be applied to a more diverse problem domain compared to mathematical programming methods, yet offers the potential of greater efficiency compared to population-based search methodologies, such as genetic algorithms. The tabu search is demonstrated on numerous variations of three different problems and compared to integer programming and genetic algorithm solutions. The results demonstrate the benefits of tabu search for solving this type of problem.     

Energy Efficient Resource Allocation Approach for Renewable Energy Powered Heterogeneous Cellular Networks

In this paper, maximizing energy efficiency (EE) through radio resource allocation for renewable energy powered heterogeneous cellular networks (HetNet) with energy sharing, is investigated. Our goal is to maximize the network EE, conquer the instability of renewable energy sources and guarantee the fairness of users during allocating resources. We define the objective function as a sum weighted EE of all links in the HetNet. We formulate the resource allocation problem in terms of subcarrier assignment, power allocation and energy sharing, as a mixed combinatorial and non-convex optimization problem. We propose an energy efficient resource allocation scheme, including a centralized resource allocation algorithm for iterative subcarrier allocation and power allocation in which the power allocation problem is solved by analytically solving the Karush-Kuhn-Tucker (KKT) conditions of the problem and a water-filling problem thereafter and a low-complexity distributed resource allocation algorithm based on reinforcement learning (RL). Our numerical results show that both centralized and distributed algorithms converge with a few times of iterations. The numerical results also show that our proposed centralized and distributed resource allocation algorithms outperform the existing reference algorithms in terms of the network EE.     

An improved harmony search algorithm for emergency inspection scheduling

The ability of nature-inspired search algorithms to efficiently handle combinatorial problems, and their successful implementation in many fields of engineering and applied sciences, have led to the development of new, improved algorithms. In this work, an improved harmony search (IHS) algorithm is presented, while a holistic approach for solving the problem of post-disaster infrastructure management is also proposed. The efficiency of IHS is compared with that of the algorithms of particle swarm optimization, differential evolution, basic harmony search and the pure random search procedure, when solving the districting problem that is the first part of post-disaster infrastructure management. The ant colony optimization algorithm is employed for solving the associated routing problem that constitutes the second part. The comparison is based on the quality of the results obtained, the computational demands and the sensitivity on the algorithmic parameters.     

An effective hybrid cuckoo search and genetic algorithm for constrained engineering design optimization

This article presents an effective hybrid cuckoo search and genetic algorithm (HCSGA) for solving engineering design optimization problems involving problem-specific constraints and mixed variables such as integer, discrete and continuous variables. The proposed algorithm, HCSGA, is first applied to 13 standard benchmark constrained optimization functions and subsequently used to solve three well-known design problems reported in the literature. The numerical results obtained by HCSGA show competitive performance with respect to recent algorithms for constrained design optimization problems.     

Enhanced Heap-Based Optimizer Algorithm for Solving Team FormationProblem

Team Formation (TF) is considered one of the most significant problems in computer science and optimization. TF is defined as forming the best team of experts in a social network to complete a task with least cost. Many real-world problems, such as task assignment, vehicle routing, nurse scheduling, resource allocation, and airline crew scheduling, are based on the TF problem. TF has been shown to be a Nondeterministic Polynomial time (NP) problem, and high-dimensional problem with several local optima that can be solved using efficient approximation algorithms. This paper proposes two improved swarm-based algorithms for solving team formation problem. The first algorithm, entitled Hybrid Heap-Based Optimizer with Simulated Annealing Algorithm (HBOSA), uses a single crossover operator to improve the performance of a standard heap-based optimizer (HBO) algorithm. It also employs the simulated annealing (SA) approach to improve model convergence and avoid local minima trapping. The second algorithm is the Chaotic Heap-based Optimizer Algorithm (CHBO). CHBO aids in the discovery of new solutions in the search space by directing particles to different regions of the search space. During HBO’s optimization process, a logistic chaotic map is used. The performance of the two proposed algorithms (HBOSA) and (CHBO) is evaluated using thirteen benchmark functions and tested in solving the TF problem with varying number of experts and skills. Furthermore, the proposed algorithms were compared to well-known optimization algorithms such as the Heap-Based Optimizer (HBO), Developed Simulated Annealing (DSA), Particle Swarm Optimization (PSO), Grey Wolf Optimization (GWO), and Genetic Algorithm (GA). Finally, the proposed algorithms were applied to a real-world benchmark dataset known as the Internet Movie Database (IMDB). The simulation results revealed that the proposed algorithms outperformed the compared algorithms in terms of efficiency and performance, with fast convergence to the global minimum.     

Efficient and robust model predictive control for first swing transient stability of power systems using flexible AC transmission systems devices

A wide area measurement, nonlinear, model predictive control (MPC) approach is introduced to provide first swing stability protection of vulnerable power system transmission lines. The authors consider large disturbance events and focus on the avoidance of first swing angular separation using flexible AC transmission systems (FACTS) devices. The presented control strategy for FACTS devices is designed to be numerically efficient (due to the short MPC horizons) and robust (against complicated separation mechanisms). Simulation studies conducted on a three-machine system illustrate that the proposed MPC approach achieves first swing large disturbance performance that is near optimal and superior to existing transient stability controllers. Moreover, the proposed control approach is demonstrated to improve critical clearance times and to improve transfer capacity in simulation studies on the 39 bus New England system.     

Variation-aware clock network buffer sizing using robust multi-objective optimization

Many engineering optimization problems include unavoidable uncertainties in parameters or variables. Ignoring such uncertainties when solving the optimization problems may lead to inferior solutions that may even violate problem constraints. Another challenge in most engineering optimization problems is having different conflicting objectives that cannot be minimized simultaneously. Finding a balanced trade-off between these objectives is a complex and time-consuming task. In this paper, an optimization framework is proposed to address both of these challenges. First, we exploit a self-calibrating multi-objective framework to achieve a balanced trade-off between the conflicting objectives. Then, we develop the robust counterpart of the uncertainty-aware self-calibrating multi-objective optimization framework. The significance of this framework is that it does not need any manual tuning by the designer. We also develop a mathematical demonstration of the objective scale invariance property of the proposed framework. The engineering problem considered in this paper to illustrate the effectiveness of the proposed framework is a popular sizing problem in digital integrated circuit design. However, the proposed framework can be applied to any uncertain multi-objective optimization problem that can be formulated in the geometric programming format. We propose to consider variations in the sizes of circuit elements during the optimization process by employing ellipsoidal uncertainty model. For validation, several industrial clock networks are sized by the proposed framework. The results show a significant reduction in one objective (power, on average 38 %) as well as significant increase in the robustness of solutions to the variations. This is achieved with no significant degradation in the other objective (timing metrics of the circuit) or reduction in its standard deviation which demonstrates a more robust solution.     

VIS: An artificial immune network for multi-objective optimization

The aim of this work is to propose and validate a novel multi-objective optimization algorithm based on the emulation of the behaviour of the immune system. The rationale of this work is that the artificial immune system has, in its elementary structure, the main features required by other multi-objective evolutionary algorithms described in the literature, such as diversity preservation, memory, adaptivity, and elitism. The proposed approach is compared with three multi-objective evolutionary algorithms that are representative of the state of the art in multi-objective optimization. Algorithms are tested on six standard problems (both unconstrained and constrained) and comparisons are carried out using three different metrics. Results show that the proposed approach has very good performances and can become a valid alternative to standard algorithms for solving multi-objective optimization problems.     

Multi-load level reactive power planning considering slow and fast VAR devices by means of particle swarm optimisation

The problem of optimal allocation of fast and slow reactive power VAR devices under different load levels is addressed. These devices are supposed to be utilised to maintain system security in normal and contingency states, where corrective and preventive controls are implemented for the contingency cases. Load shedding and fast VAR devices are used in the corrective state in order to restore the system stability very quickly, even though they are highly expensive, whereas cheap slow VAR devices can be used in the preventive state to obtain the desired security level. The main objective is to establish a trade-off between economy and security by determining the optimal combination of fast and slow controls (load shedding, new slow and fast VAR devices). To meet the desired steady-state security limits, a variety of constraints have to be considered during the investigated transition states. The overall problem is formulated as a large-scale mixed-integer nonlinear programming problem. Particle swarm optimisation as an efficient method for solving such problems is applied to solve the problem. The proposed approach has been successfully tested on the IEEE-14 as well as IEEE-57 bus systems.     

A particle swarm optimizer for constrained multi-objective engineering design problems

This article presents a particle swarm optimizer (PSO) capable of handling constrained multi-objective optimization problems. The latter occur frequently in engineering design, especially when cost and performance are simultaneously optimized. The proposed algorithm combines the swarm intelligence fundamentals with elements from bio-inspired algorithms. A distinctive feature of the algorithm is the utilization of an arithmetic recombination operator, which allows interaction between non-dominated particles. Furthermore, there is no utilization of an external archive to store optimal solutions. The PSO algorithm is applied to multi-objective optimization benchmark problems and also to constrained multi-objective engineering design problems. The algorithmic effectiveness is demonstrated through comparisons of the PSO results with those obtained from other evolutionary optimization algorithms. The proposed particle swarm optimizer was able to perform in a very satisfactory manner in problems with multiple constraints and/or high dimensionality. Promising results were also obtained for a multi-objective engineering design problem with mixed variables.