Scribd
Upload
20 views1 page

Phase Balancing Optimization Methods

The document discusses various algorithms for phase balancing problems, highlighting that Simulated Annealing (SA) is time-consuming but effective in avoiding local minima, while Quenching and Greedy algorithms offer faster solutions with reasonable optimality. Phase swapping is emphasized as a method for utilities to reduce costs and improve quality, particularly in large-scale feeder systems. Although traditional methods struggle with non-linear integer programming, SA provides a viable approach despite not guaranteeing optimal solutions.

Uploaded by

Nathalie Caro Ramirez
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views1 page

Phase Balancing Optimization Methods

The document discusses various algorithms for phase balancing problems, highlighting that Simulated Annealing (SA) is time-consuming but effective in avoiding local minima, while Quenching and Greedy algorithms offer faster solutions with reasonable optimality. Phase swapping is emphasized as a method for utilities to reduce costs and improve quality, particularly in large-scale feeder systems. Although traditional methods struggle with non-linear integer programming, SA provides a viable approach despite not guaranteeing optimal solutions.

Uploaded by

Nathalie Caro Ramirez
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

15081513

However SA is a time-consuming approach for phase


balancing problems than other methods. Quenching algorithm
is faster and its solution is reasonable goo4. Greedy algorithm
is slightly worse than Quenching algorithm from optimality
point of view. Quenching algorithm and Greedy algorithm
are also good methods to solve large-scale phase balancing
optimization problems if the optimality is not a critical issue.
Even SA, quenching algorithm, and greedy algorithm do not
guarantee the optimality but they provide solutions that are
close to the optimal one. But only Simulated Annealing has
potential to avoid the local minima.

7. Conclusion
Growing pressures on competition have forced utilities
to seek any opportunity to reduce cost and to improve quality.
Phase swapping is one of effective way to reach their goal.
But if phase balancing problems are modeled as non-linear
integer programming, then it is difficult to solve by the
traditional methods such as Mixed Integer Programming.
Simulated Aruiealing ts a promising approach to solve the
large-scale feeder systems. It can not guarantee the optimal
solution but it has potential to avoid local minimum. It is
time-consuming method but it can provide a better solution
than other heuristic methods (e,g. Greedy algorithm,
Quenching algorithm). It can solve the phase swapping
problems considering voltage drops and energy losses, which
optimization methods are not afford to solve large scale phase
balancing problems.

Authorized licensed use limited to: Universidad Tecnologica de Pereira. Downloaded on December 02,2021 at 21:02:45 UTC from IEEE Xplore. Restrictions apply.

You might also like