scholarly journals Real-Time Multifault Rush Repairing Strategy Based on Utility Theory and Multiagent System in Distribution Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-12
Author(s):  
Zhao Hao ◽  
Zhang Jing ◽  
Lu Zhi-gang ◽  
Yang Li-jun ◽  
Cheng Hui-lin
Keyword(s):  
Real Time ◽  
Utility Theory ◽  
Multiagent System ◽  
Mathematical Optimization ◽  
Combinatorial Problem ◽  
Distribution Networks ◽  
Two Stage ◽  
Optimal Sequence ◽  
Bacterial Colony ◽  
Second Stage

The problem of multifault rush repair in distribution networks (DNs) is a multiobjective dynamic combinatorial problem with topology constraints. The problem consists of archiving an optimal faults’ allocation strategy to squads and an admissible multifault rush repairing strategy with coordinating switch operations. In this article, the utility theory is introduced to solve the first problem and a new discrete bacterial colony chemotaxis (DBCC) algorithm is proposed for the second problem to determine the optimal sequence for each squad to repair faults and the corresponding switch operations. The above solution is called the two-stage approach. Additionally, a double mathematical optimization model based on the fault level is proposed in the second stage to minimize the outage loss and total repairing time. The real-time adjustment multiagent system (RA-MAS) is proposed to provide facility to achieve online multifault rush repairing strategy in DNs when there are emergencies after natural disasters. The two-stage approach is illustrated with an example from a real urban distribution network and the simulation results show the effectiveness of the two-stage approach.

Two-Stage Algorithm for Rapid Determination of the Bending Sequence in Sheet Metal Products

1996 ◽  
Author(s):  
B. Radin ◽  
M. Shpitalni ◽  
I. Hartman
Keyword(s):  
Sheet Metal ◽  
Rapid Determination ◽  
Low Cost ◽  
Combinatorial Problem ◽  
Two Stage ◽  
Practical Applications ◽  
Second Stage ◽  
Bending Sequence ◽  
Time Limitations

Abstract This paper presents an algorithm for solving the complex and critical problem of bending sequence in sheet metal manufacturing. Finding the bending sequence and required tool assignment presents a large combinatorial problem which is impossible to solve optimally for practical applications within a reasonable period of time. The paper presents a two-stage algorithm. The first stage finds a feasible solution based upon collision avoidance heuristics. The second stage rapidly seeks an alternative feasible sequence with a lower cost without exceeding time limitations. The algorithm is very practical because it reaches a low-cost solution quickly within computer memory limitations. In this paper, the problem is defined, the approach is presented formally, and finally, the power of the algorithm is demonstrated by solving bending sequences for real products.

Two-Stage Algorithm for Determination of the Bending Sequence in Sheet Metal Products

1997 ◽  
Vol 119 (2) ◽  
pp. 259-266 ◽  
Author(s):  
B. Radin ◽  
M. Shpitalni ◽  
I. Hartman
Keyword(s):  
Sheet Metal ◽  
Low Cost ◽  
Combinatorial Problem ◽  
Two Stage ◽  
Practical Applications ◽  
Second Stage ◽  
Metal Products ◽  
Bending Sequence ◽  
Time Limitations

This paper presents an algorithm for solving the complex and critical problem of bending sequence in sheet metal manufacturing. Finding the bending sequence and required tool assignment presents a large combinatorial problem which is impossible to solve optimally for practical applications within a reasonable period of time. The paper presents a two-stage algorithm. The first stage finds a feasible solution based upon collision avoidance heuristics. The second stage rapidly seeks an alternative feasible sequence with a lower cost without exceeding time limitations. The algorithm is very practical because it reaches a low-cost solution quickly within computer memory limitations. In this paper, the problem is defined, the approach is presented formally, and finally, the power of the algorithm is demonstrated by solving bending sequences for real products.

scholarly journals Optimal Placement and Sizing of Capacitors in Radial Distribution Systems: A Two-Stage Method

2020 ◽  
pp. 31-43
Author(s):  
Sunday Adeleke Salimon ◽  
Abiodun Aderemi Baruwa ◽  
Saheed Oluwasina Amuda ◽  
Hafiz Adesupo Adeleke
Keyword(s):  
Radial Distribution ◽  
Power Loss ◽  
Reactive Power ◽  
Distribution Networks ◽  
Loss Reduction ◽  
Two Stage ◽  
Second Stage ◽  
Power Loss Reduction ◽  
Radial Distribution Networks ◽  
Shunt Capacitors

Optimal allocation of shunt capacitors in the radial distribution networks results in both technical and economic benefits. This paper presents a two-stage method of Loss Sensitivity Factor (LSF) and Cuckoo Search Algorithm (CSA) to find the optimal size and location of shunt capacitors with the objective of minimizing cost due to power loss and reactive power compensation of the distribution networks. The first stage utilizes the LSF to predict the potential candidate buses for shunt capacitor placement thereby reducing the search space of the second stage and avoiding unnecessary repetitive load flow while the second stage uses the CSA to find the size and actual placement of the shunt capacitors satisfying the operating constraints. The applicability of the proposed two stage method is tested on the standard IEEE 33-bus and Ayepe 34-bus Nigerian radial distribution networks of the Ibadan Electricity Distribution Company. After running the algorithm, the simulation results gave percentage real and reactive power loss reduction of 34.28% and 28.94% as compared to the base case for the IEEE 33-bus system while the percentage real and reactive power loss reduction of 22.89% and 21.40% was recorded for the Ayepe 34-bus system. Comparison of the obtained results with other techniques in literatures for the standardized IEEE 33-bus reveals the efficiency of the proposed method as it achieved technical benefits of reduced total power loss, improved voltage profile and bus voltage stability, and the economic benefit of reduced total cost due to electrical power loss and compensation.

Real-Time Pricing for Smart Grid with Multiple Companies and Multiple Users Using Two-Stage Optimization

2018 ◽  
Vol 6 (5) ◽  
pp. 435-446 ◽  
Author(s):  
Li Tao ◽  
Yan Gao
Keyword(s):  
Smart Grid ◽  
Real Time ◽  
Optimization Problem ◽  
Statistical Approach ◽  
Electricity Price ◽  
Two Stage ◽  
Second Stage ◽  
Multiple Users ◽  
Utility Companies ◽  
Analytic Expression

AbstractIn this paper, we focus on the real-time interactions among multiple utility companies and multiple users and formulate real-time pricing (RTP) as a two-stage optimization problem. At the first stage, based on cost function, we propose a continuous supply function bidding mechanism to model the utility companies’ profit maximization problem, by which the analytic expression of electricity price is further derived. At the second stage, considering that individually optimal solution may not be socially optimal, we employ convex optimization with linear constraints to model the price anticipating users’ daily payoff maximum. Substitute the analytic expression of electricity price obtained at the first stage into the optimization problem at the second stage. Using customized proximal point algorithm (C-PPA), the optimization problem at the second stage is solved and electricity price is obtained accordingly. We also prove the existence and uniqueness of the Nash equilibrium in the mentioned two-stage optimization and the convergence of C-PPA. In addition, in order to make the algorithm more practical, a statistical approach is used to obtain the function of price only through online information exchange, instead of solving it directly. The proposed approach offers RTP, power production and load scheduling for multiple utility companies and multiple users in smart grid. Statistical approach helps to protect the company’s privacy and avoid the interference of random factors, and C-PPA has an advantage over Lagrangian algorithm because the former need not obtain the objection function of the dual optimization problem by solving an optimization problem with parameters. Simulation results show that the proposed framework can significantly reduce peak time loading and efficiently balance system energy distribution.

An Enhanced Two Stage MMSE Equalizer for Coded FBMC/OQAM Systems

2019 ◽  
Vol 10 (1) ◽  
pp. 69-82 ◽  
Author(s):  
Mohammad Rizk Assaf ◽  
Abdel-Nasser Assimi
Keyword(s):  
Error Propagation ◽  
Channel Model ◽  
Error Correcting Codes ◽  
Two Stage ◽  
Probability Of Error ◽  
Second Stage ◽  
Different Types ◽  
Mmse Equalizer ◽  
And Performance ◽  
Ici Cancellation

In this article, the authors investigate the enhanced two stage MMSE (TS-MMSE) equalizer in bit-interleaved coded FBMC/OQAM system which gives a tradeoff between complexity and performance, since error correcting codes limits error propagation, so this allows the equalizer to remove not only ICI but also ISI in the second stage. The proposed equalizer has shown less design complexity compared to the other MMSE equalizers. The obtained results show that the probability of error is improved where SNR gain reaches 2 dB measured at BER compared with ICI cancellation for different types of modulation schemes and ITU Vehicular B channel model. Some simulation results are provided to illustrate the effectiveness of the proposed equalizer.

Sign in / Sign up

Export Citation Format

Share Document