Application of improved particle swarm optimization in economic dispatch of power system

Abstract: This paper introduces an improved particle swarm optimization to solve economic dispatch problems involving numerous constraints. Depending on the type of generating units, there are optimization constraints and practical operating constraints of generators such as prohibited operating zones and ramp rate limits. The algorithm is a hybrid technique made up of particle swarm optimization and bat algorithm. Particle swarm optimization as the main algorithm integrates bat algorithm in order to boost its velocity and adjust the improved solution. The new technique is firstly tested on five different cases of economic dispatch problems comprising 6, 13, 15, 40 and 140 generating units. The simulation results show that it performs better than both particle swarm and bat technique

Improved dynamical particle swarm optimization method for structural dynamics

A methodology to the multiobjective structural design of buildings based on an improved particle swarm optimization algorithm is presented, which has proved to be very efficient and robust in nonlinear problems and when the optimization objectives are in conflict. In particular, the behaviour of the particle swarm optimization (PSO) classical algorithm is improved by dynamically adding autoadaptive mechanisms that enhance the exploration/exploitation trade-off and diversity of the proposed algorithm, avoiding getting trapped in local minima. A novel integrated optimization system was developed, called DI-PSO, to solve this problem which is able to control and even improve the structural behaviour under seismic excitations. In order to demonstrate the effectiveness of the proposed approach, the methodology is tested against some benchmark problems. Then a 3-story-building model is optimized under different objective cases, concluding that the improved multiobjective optimization methodology using DI-PSO is more efficient as compared with those designs obtained using single optimization.Peer ReviewedPostprint (published version

Reduction of Real Power Loss by using Enhanced Particle Swarm Optimization Algorithm

In this paper, an Enhancedparticle swarm optimization algorithm (EPSO) has been proposed to solve the reactive power problem. Particle Swarm Optimization (PSO) is swarm intelligence based exploration and optimization algorithm which is used to solve global optimization problems. But due to deficiency of population diversity and early convergence it is often stuck into local optima. We can upsurge diversity and avoid premature convergence by using evolutionary operators in PSO. In this paper the intermingling crossover operator is used to upsurge the exploration capability of the swarm in the exploration space .Particle Swarm Optimization uses this crossover method to converge optimum solution in quick manner .Thus the intermingling crossover operator is united with particle swarm optimization to augment the performance and possess the diversity which guides the particles to the global optimum powerfully. The proposedEnhanced particle swarm optimization algorithm (EPSO) has been tested in standard IEEE 30, 57,118 bus test systems and simulation results shows clearly the improved performance of the projected algorithm in reducing the real power loss and control variables are well within the limits. Keywords: Optimal Reactive Power, Transmission loss, intermingling crossover operato

Microgrid distribution system dynamic reactive power optimization based on improved particle swarm algorithms

Abstract Due to the low accuracy and convergence of existing particle swarm algorithm in the micro power dynamic reactive power optimization in distribution system, this paper proposes an improved particle swarm algorithm based on the state of the particle and inertia weight optimization. This algorithm first adjusts the status of the states of the particles. Then using Sigmoid mapping to optimize the search ability of the inertia weight in particle swarms algorithm. Finally, using the optimal learning strategies to improve the convergence of particle swarm optimization algorithm. Through simulation experiments, the proposed improving particle swarm algorithm based on particle state and inertia weight optimization owing better convergence than traditional particle swarm optimization. Only small error was obtained during dynamic reactive power optimization in micro power distribution system

information

In this study, an improved particle swarm optimization (PSO) algorithm, including 4 types of new velocity updating formulae (each is equal to the traditional PSO), was introduced. This algorithm was called the reverse direction supported particle swarm optimization (RDS-PSO) algorithm. The RDS-PSO algorithm has the potential to extend the diversity and generalization of traditional PSO by regulating the reverse direction information adaptively. To implement this extension, 2 new constants were added to the velocity update equation of the traditional PSO, and these constants were regulated through 2 alternative procedures, i.e. max min-based and cosine amplitude-based diversity-evaluating procedures. The 4 most commonly used benchmark functions were used to test the general optimization performances of the RDS-PSO algorithm with 3 different velocity updates, RDS-PSO without a regulating procedure, and the traditional PSO with linearly increasing/decreasing inertia weight. All PSO algorithms were also implemented in 4 modes, and their experimental results were compared. According to the experimental results, RDS-PSO 3 showed the best optimization performance

Virtual machine-based task scheduling algorithm in a cloud computing environment

Virtualization technology has been widely used to virtualize single server into multiple servers, which not only creates an operating environment for a virtual machine-based cloud computing platform but also potentially improves its efficiency. Currently, most task scheduling-based algorithms used in cloud computing environments are slow to convergence or easily fall into a local optimum. This paper introduces a Greedy Particle Swarm Optimization (G&PSO) based algorithm to solve the task scheduling problem. It uses a greedy algorithm to quickly solve the initial particle value of a particle swarm optimization algorithm derived from a virtual machine-based cloud platform. The archived experimental results show that the algorithm exhibits better performance such as a faster convergence rate, stronger local and global search capabilities, and a more balanced workload on each virtual machine. Therefore, the G&PSO algorithm demonstrates improved virtual machine efficiency and resource utilization compared with the traditional particle swarm optimization algorithm

Optimization of Agricultural Machinery Allocation in Heilongjiang Reclamation Area Based on Particle Swarm Optimization Algorithm

Aiming at the imbalance of seasonal agricultural machinery operations in different regions and the low efficiency of agricultural machinery, an experiment is proposed to use particle swarm algorithm to plan agricultural machinery paths to solve the current problems in agricultural machinery operations. Taking the harvesting of autumn soybeans at Jianshan Farm in Heilongjiang Reclamation Area as the experimental object, this paper constructs the optimization target model of the maximum net income of farm machinery households, and uses particle swarm algorithm to carry out agricultural machinery operation distribution and path planning gradually. In this paper, by introducing 0 - 1 mapping, the improved algorithm adopts continuous decision variables to solve the optimization of discrete variables in agricultural machinery operations. The test results show that the particle swarm algorithm can realize the optimal allocation of agricultural machinery path, and the particle swarm algorithm is scientific and explanatory to solve the agricultural machinery allocation problem. This research can provide a scientific basis for farm agricultural machinery allocation and decision analysis

An Estimation of Distribution Improved Particle Swarm Optimization Algorithm

PSO is a powerful evolutionary algorithm used for finding global solution to a multidimensional problem. Particles in PSO tend to re-explore already visited bad solution regions of search space because they do not learn as a whole. This is avoided by restricting particles into promising regions through probabilistic modeling of the archive of best solutions. This paper presents hybrids of estimation of distribution algorithm and two PSO variants. These algorithms are tested on benchmark functions having high dimensionalities. Results indicate that the methods strengthen the global optimization abilities of PSO and therefore, serve as attractive choices to determine solutions to optimization problems in areas including sensor networks

Application of improved particle swarm optimization in economic dispatch of power systems

Economic dispatch is an important optimization challenge in power systems. It helps to find the optimal output power of a number of generating units that satisfy the system load demand at the cheapest cost, considering equality and inequality constraints. Many nature inspired algorithms have been broadly applied to tackle it such as particle swarm optimization. In this dissertation, two improved particle swarm optimization techniques are proposed to solve economic dispatch problems. The first is a hybrid technique with Bat algorithm. Particle swarm optimization as the main optimizer integrates bat algorithm in order to boost its velocity and to adjust the improved solution. The second proposed approach is based on Cuckoo operations. Cuckoo search algorithm is a robust and powerful technique to solve optimization problems. The study investigates the effect of levy flight and random search operation in Cuckoo search in order to ameliorate the performance of the particle swarm optimization algorithm. The two improved particle swarm algorithms are firstly tested on a range of 10 standard benchmark functions and then applied to five different cases of economic dispatch problems comprising 6, 13, 15, 40 and 140 generating units.Electrical and Mining EngineeringM. Tech. (Electrical Engineering