Comparative approach: Electric distribution optimization with loss minimization algorithm and particle swarm optimization

• URL: http://arxiv.org/abs/2405.00680v1
• Date: Mon, 19 Feb 2024 18:37:27 GMT
• Title: Comparative approach: Electric distribution optimization with loss minimization algorithm and particle swarm optimization
• Authors: Soufiane Bouabbadi,
• Abstract summary: Power systems are very large and complex, it can be influenced by many unexpected events. This review presents an overview of important mathematical comparaison of loss minimization algorithm and particle swarm optimization algorithm in terms of the performances of electric distribution.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Power systems are very large and complex, it can be influenced by many unexpected events this makes power system optimization problems difficult to solve, hence methods for solving these problems ought to be an active research topic. This review presents an overview of important mathematical comparaison of loss minimization algorithm and particle swarm optimization algorithm in terms of the performances of electric distribution.

Related papers

• Quantum Circuit Optimization: Current trends and future direction [0.0]
  Recent advancements in quantum circuit optimization are explored. analytical algorithms, quantum algorithms, machine learning-based algorithms, and hybrid quantum-classical algorithms are discussed.
  arXiv  Detail & Related papers  (2024-08-16T15:07:51Z)
• Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization [50.38518771642365]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an optimization problem, which often lacks a closed form. This paper provides theoretical insights into the backward pass of unrolled optimization, showing that it is equivalent to the solution of a linear system by a particular iterative method. A system called Folded Optimization is proposed to construct more efficient backpropagation rules from unrolled solver implementations.
  arXiv  Detail & Related papers  (2023-12-28T23:15:18Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• Socio-cognitive Optimization of Time-delay Control Problems using Evolutionary Metaheuristics [89.24951036534168]
  Metaheuristics are universal optimization algorithms which should be used for solving difficult problems, unsolvable by classic approaches. In this paper we aim at constructing novel socio-cognitive metaheuristic based on castes, and apply several versions of this algorithm to optimization of time-delay system model.
  arXiv  Detail & Related papers  (2022-10-23T22:21:10Z)
• Amortized Implicit Differentiation for Stochastic Bilevel Optimization [53.12363770169761]
  We study a class of algorithms for solving bilevel optimization problems in both deterministic and deterministic settings. We exploit a warm-start strategy to amortize the estimation of the exact gradient. By using this framework, our analysis shows these algorithms to match the computational complexity of methods that have access to an unbiased estimate of the gradient.
  arXiv  Detail & Related papers  (2021-11-29T15:10:09Z)
• Particle Swarm Optimization: Fundamental Study and its Application to Optimization and to Jetty Scheduling Problems [0.0]
  The advantages of evolutionary algorithms with respect to traditional methods have been greatly discussed in the literature. While particle swarms share such advantages, they outperform evolutionary algorithms in that they require lower computational cost and easier implementation. This paper does not intend to study their tuning, general-purpose settings are taken from previous studies, and virtually the same algorithm is used to optimize a variety of notably different problems.
  arXiv  Detail & Related papers  (2021-01-25T02:06:30Z)
• Optimization and benchmarking of the thermal cycling algorithm [0.5879782260984691]
  Most of the optimization problems have inordinately complex structures that render finding their daunting task. In this paper we benchmark and improve an algorithm that is designed to overcome energy barriers in non optimization problems by temperature. We demonstrate that it competes closely with other state-of-the-art algorithms such as parallel cycling with isoenergetic moves.
  arXiv  Detail & Related papers  (2020-12-17T18:07:04Z)
• Divide and Learn: A Divide and Conquer Approach for Predict+Optimize [50.03608569227359]
  The predict+optimize problem combines machine learning ofproblem coefficients with a optimization prob-lem that uses the predicted coefficients. We show how to directlyexpress the loss of the optimization problem in terms of thepredicted coefficients as a piece-wise linear function. We propose a novel divide and algorithm to tackle optimization problems without this restriction and predict itscoefficients using the optimization loss.
  arXiv  Detail & Related papers  (2020-12-04T00:26:56Z)
• Follow the bisector: a simple method for multi-objective optimization [65.83318707752385]
  We consider optimization problems, where multiple differentiable losses have to be minimized. The presented method computes descent direction in every iteration to guarantee equal relative decrease of objective functions.
  arXiv  Detail & Related papers  (2020-07-14T09:50:33Z)
• A Particle Swarm Optimization hyper-heuristic for the Dynamic Vehicle Routing Problem [0.0]
  This paper presents a method for choosing a Particle Swarm Optimization based for the Dynamic Vehicle Routing Problem. The algorithm is chosen on the basis of a prediction made by a linear model trained on that data. The achieved results suggest that such a model can be used in a hyper-heuristic approach.
  arXiv  Detail & Related papers  (2020-06-15T22:34:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.