153 research outputs found

    Metaheuristic optimization of power and energy systems: underlying principles and main issues of the 'rush to heuristics'

    Get PDF
    In the power and energy systems area, a progressive increase of literature contributions containing applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods based on weak comparisons. This 'rush to heuristics' does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter, but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems, and aims at providing a comprehensive view of the main issues concerning the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls found in literature contributions are identified, and specific guidelines are provided on how to prepare sound contributions on the application of metaheuristic algorithms to specific problems

    Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the `Rush to Heuristics'

    Get PDF
    In the power and energy systems area, a progressive increase of literature contributions that contain applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods that are based on weak comparisons. This ‘rush to heuristics’ does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems and aims at providing a comprehensive view of the main issues that concern the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls that are found in literature contributions are identified, and specific guidelines are provided regarding how to prepare sound contributions on the application of metaheuristic algorithms to specific problems

    Recent trends of the most used metaheuristic techniques for distribution network reconfiguration

    Get PDF
    Distribution network reconfiguration (DNR) continues to be a good option to reduce technical losses in a distribution power grid. However, this non-linear combinatorial problem is not easy to assess by exact methods when solving for large distribution networks, which requires large computational times. For solving this type of problem, some researchers prefer to use metaheuristic techniques due to convergence speed, near-optimal solutions, and simple programming. Some literature reviews specialize in topics concerning the optimization of power network reconfiguration and try to cover most techniques. Nevertheless, this does not allow detailing properly the use of each technique, which is important to identify the trend. The contributions of this paper are three-fold. First, it presents the objective functions and constraints used in DNR with the most used metaheuristics. Second, it reviews the most important techniques such as particle swarm optimization (PSO), genetic algorithm (GA), simulated annealing (SA), ant colony optimization (ACO), immune algorithms (IA), and tabu search (TS). Finally, this paper presents the trend of each technique from 2011 to 2016. This paper will be useful for researchers interested in knowing the advances of recent approaches in these metaheuristics applied to DNR in order to continue developing new best algorithms and improving solutions for the topi

    Reconfiguration of Distribution Networks with Presence of DGs to Improving the Reliability

    Full text link
    In this paper, the network reconfiguration in the presence of distributed generation units with the aim of improving the reliability of the network is studied. For this purpose four reliability parameters in the objective function are considered, which is average energy not supplied system average interruption frequency index, system average interruption duration index and momentary average interruption frequency index. The new method will be normalized objective function. Another suggestion of this paper are considering the different fault rates, locating time of faults type and prioritization of customers based on their importance. This nonlinear problem has optimized by particle swarm optimization (PSO) algorithm

    Reconfiguration of Distribution Networks with Presence of DGs to improving the Reliability

    Get PDF
    In this paper, the network reconfiguration in the presence of distributed generation units with the aim of improving the reliability of the network is studied. For this purpose four reliability parameters in the objective function are considered, which is average energy not supplied system average interruption frequency index, system average interruption duration index and momentary average interruption frequency index. The new method will be normalized objective function. Another suggestion of this paper are considering the different fault rates, locating time of faults type and prioritization of customers based on their importance. This nonlinear problem has optimized by particle swarm optimization (PSO) algorithm

    An improved multiple classifier combination scheme for pattern classification

    Get PDF
    Combining multiple classifiers are considered as a new direction in the pattern recognition to improve classification performance. The main problem of multiple classifier combination is that there is no standard guideline for constructing an accurate and diverse classifier ensemble. This is due to the difficulty in identifying the number of homogeneous classifiers and how to combine the classifier outputs. The most commonly used ensemble method is the random strategy while the majority voting technique is used as the combiner. However, the random strategy cannot determine the number of classifiers and the majority voting technique does not consider the strength of each classifier, thus resulting in low classification accuracy. In this study, an improved multiple classifier combination scheme is proposed. The ant system (AS) algorithm is used to partition feature set in developing feature subsets which represent the number of classifiers. A compactness measure is introduced as a parameter in constructing an accurate and diverse classifier ensemble. A weighted voting technique is used to combine the classifier outputs by considering the strength of the classifiers prior to voting. Experiments were performed using four base classifiers, which are Nearest Mean Classifier (NMC), Naive Bayes Classifier (NBC), k-Nearest Neighbour (k-NN) and Linear Discriminant Analysis (LDA) on benchmark datasets, to test the credibility of the proposed multiple classifier combination scheme. The average classification accuracy of the homogeneous NMC, NBC, k-NN and LDA ensembles are 97.91%, 98.06%, 98.09% and 98.12% respectively. The accuracies are higher than those obtained through the use of other approaches in developing multiple classifier combination. The proposed multiple classifier combination scheme will help to develop other multiple classifier combination for pattern recognition and classification

    Extended mixed integer quadratic programming for simultaneous distributed generation location and network reconfiguration

    Get PDF
    Introduction. To minimise power loss, maintain the voltage within the acceptable range, and improve power quality in power distribution networks, reconfiguration and optimal distributed generation placement are presented. Power flow analysis and advanced optimization techniques that can handle significant combinatorial problems must be used in distribution network reconfiguration investigations. The optimization approach to be used depends on the size of the distribution network. Our methodology simultaneously addresses two nonlinear discrete optimization problems to construct an intelligent algorithm to identify the best solution. The proposed work is novel in that it the Extended Mixed-Integer Quadratic Programming (EMIQP) technique, a deterministic approach for determining the topology that will effectively minimize power losses in the distribution system by strategically sizing and positioning Distributed Generation (DG) while taking network reconfiguration into account. Using an efficient Quadratic Mixed Integer Programming (QMIP) solver (IBM ®), the resulting optimization problem has a quadratic form. To ascertain the range and impact of various variables, our methodology outperforms cutting-edge algorithms described in the literature in terms of the obtained power loss reduction, according to extensive numerical validation carried out on typical IEEE 33- and 69-bus systems at three different load factors. Practical value. Examining the effectiveness of concurrent reconfiguration and DG allocation versus sole reconfiguration is done using test cases. According to the findings, network reconfiguration along with the installation of a distributed generator in the proper location, at the proper size, with the proper loss level, and with a higher profile, is effective.  Вступ. Для мінімізації втрат потужності, підтримки напруги в допустимому діапазоні та покращення якості електроенергії у розподільчих мережах представлена реконфігурація та оптимальне розміщення розподіленої генерації. При дослідженнях реконфігурації розподільної мережі необхідно використовувати аналіз потоку потужності та передові методи оптимізації, які можуть вирішувати серйозні комбінаторні проблеми. Підхід до оптимізації, що використовується, залежить від розміру розподільної мережі. Наша методологія одночасно вирішує дві задачі нелінійної дискретної оптимізації, щоби побудувати інтелектуальний алгоритм для визначення найкращого рішення. Пропонована робота є новою, оскільки вона використовує метод розширеного змішано-цілочисельного квадратичного програмування (EMIQP), детермінований підхід до визначення топології, що ефективно мінімізує втрати потужності в системі розподілу за рахунок стратегічного визначення розмірів та позиціонування розподіленої генерації (DG) з урахуванням реконфігурації мережі. При використанні ефективного солвера Quadratic Mixed Integer Programming (QMIP) (IBM®) результуюча задача оптимізації має квадратичну форму. Щоб з'ясувати діапазон та вплив різних змінних, наша методологія перевершує передові алгоритми, описані в літературі, з точки зору одержаного зниження втрат потужності, згідно з великою числовою перевіркою, проведеною на типових системах з шинами IEEE 33 і 69 при трьох різних коефіцієнтах навантаження. Практична цінність. Вивчення ефективності одночасної реконфігурації та розподілу DG у порівнянні з єдиною реконфігурацією проводиться з використанням тестових прикладів. Відповідно до результатів, реконфігурація мережі разом із установкою розподіленого генератора в потрібному місці, належного розміру, з належним рівнем втрат і з більш високим профілем є ефективною

    Real-Time Implementation of an Intelligent Algorithm for Electric Ship Power System Reconfiguration

    Get PDF
    The naval electric ship is often subject to severe damages under battle conditions. The damages or faults might even affect the generators and as a result, critical loads might suffer from power deficiency which may lead to an eventual collapse of rest of the system. In order to serve the critical loads and maintain a proper power balance without excessive generation, the ship power system requires a fast reconfiguration of the remaining system under fault conditions. A fast intelligent algorithm using the Small Population based Particle Swarm Optimization (SPPSO) for dynamic reconfiguration of the available generators and loads when a fault in the ship power system is detected is presented in this paper. SPPSO is a variant of PSO which operates with fewer particles and a regeneration concept, where new potential solutions are generated every few iterations. This concept of regeneration makes the algorithm fast and enhances its exploration capability to a large extent. The strength of the proposed reconfiguration strategy is first illustrated with Matlab results and then with a real-time implementation on a real time digital simulator and a digital signal processor

    Distribution network reconfiguration considering DGs using a hybrid CS-GWO algorithm for power loss minimization and voltage profile enhancement

    Get PDF
    This paper presents an implementation of the hybrid Cuckoo search and Grey wolf (CS-GWO) optimization algorithm for solving the problem of distribution network reconfiguration (DNR) and optimal location and sizing of distributed generations (DGs) simultaneously in radial distribution systems (RDSs). This algorithm is being used significantly to minimize the system power loss, voltage deviation at load buses and improve the voltage profile. When solving the high-dimensional datasets optimization problem using the GWO algorithm, it simply falls into an optimum local region. To enhance and strengthen the GWO algorithm searchability, CS algorithm is integrated to update the best three candidate solutions. This hybrid CS-GWO algorithm has a more substantial search capability to simultaneously find optimal candidate solutions for problem. Furthermore, to validate the effectiveness and performances of the proposed hybrid CS-GWO algorithm is being tested and evaluated for standard IEEE 33-bus and 69-bus RDSs by considering different scenarios
    corecore