12,389 research outputs found

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

    Get PDF
    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

    Adaptive mufti-objective particle swarm optimization algorithm

    Get PDF
    In this article we describe a novel Particle Swarm Optimization (PSO) approach to Multi-objective Optimization (MOO) called Adaptive Multi-objective Particle Swarm Optimization (AMOPSO). AMOPSO algorithm's novelty lies in its adaptive nature, that is attained by incorporating inertia and the acceleration coefficient as control variables with usual optimization variables, and evolving these through the swarming procedure. A new diversity parameter has been used to ensure sufficient diversity amongst the solutions of the non dominated front. AMOPSO has been compared with some recently developed multi-objective PSO techniques and evolutionary algorithms for nine function optimization problems, using different performance measures

    Improved dynamical particle swarm optimization method for structural dynamics

    Get PDF
    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

    A Improved Particle Swarm Optimization Algorithm with Dynamic Acceleration Coefficients

    Get PDF
    Particle swarm optimization (PSO) is one of the famous heuristic methods. However, this method may suffer to trap at local minima especially for multimodal problem. This paper proposes a modified particle swarm optimization with dynamic acceleration coefficients (ACPSO). To efficiently control the local search and convergence to the global optimum solution, dynamic acceleration coefficients are introduced to PSO. To improve the solution quality and robustness of PSO algorithm, a new best mutation method is proposed to enhance the diversity of particle swarm and avoid premature convergence. The effectiveness of ACPSO algorithm is tested on different benchmarks. Simulation results found that the proposed ACPSO algorithm has good solution quality and more robust than other methods reported in previous work

    Coordinated optimal control of secondary cooling and final electromagnetic stirring for continuous casting billets

    Get PDF
    Secondary cooling and final electromagnetic stirring (F-EMS) are both key technologies for continuous casting. These parameters are usually optimized and controlled separately which caused internal quality fluctuations in unsteady conditions. In this paper, a coordinated optimal control strategy based on a multiobjective particle swarm optimization (MOPSO) algorithm is proposed for the parameter optimization of secondary cooling and F-EMS, which is solved based on multiobjective particle swarm optimization (MOPSO) algorithm. The solidification and heat transfer model are developed for the computation of billet temperature and the solidification, and the adaptive grid method is used to improve the diversity and robustness of optimal solutions. The secondary cooling water and F-EMS’ stirring current are dynamically controlled based on the optimization results. The results of field trials showed that the maximum carbon segregation and other quality indexes of billets can be improved significantly

    Adaptive particle swarm optimization

    Get PDF
    An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity

    Particle swarm optimization with composite particles in dynamic environments

    Get PDF
    This article is placed here with the permission of IEEE - Copyright @ 2010 IEEEIn recent years, there has been a growing interest in the study of particle swarm optimization (PSO) in dynamic environments. This paper presents a new PSO model, called PSO with composite particles (PSO-CP), to address dynamic optimization problems. PSO-CP partitions the swarm into a set of composite particles based on their similarity using a "worst first" principle. Inspired by the composite particle phenomenon in physics, the elementary members in each composite particle interact via a velocity-anisotropic reflection scheme to integrate valuable information for effectively and rapidly finding the promising optima in the search space. Each composite particle maintains the diversity by a scattering operator. In addition, an integral movement strategy is introduced to promote the swarm diversity. Experiments on a typical dynamic test benchmark problem provide a guideline for setting the involved parameters and show that PSO-CP is efficient in comparison with several state-of-the-art PSO algorithms for dynamic optimization problems.This work was supported in part by the Key Program of the National Natural Science Foundation (NNSF) of China under Grant 70931001 and 70771021, the Science Fund for Creative Research Group of the NNSF of China under Grant 60821063 and 70721001, the Ph.D. Programs Foundation of the Ministry of education of China under Grant 200801450008, and by the Engineering and Physical Sciences Research Council of U.K. under Grant EP/E060722/1
    corecore