|
@@ -3,6 +3,7 @@ package holeg;
|
|
import holeg.model.Grid;
|
|
import holeg.model.Grid;
|
|
import holeg.model.GridEdge;
|
|
import holeg.model.GridEdge;
|
|
import holeg.model.GridNode;
|
|
import holeg.model.GridNode;
|
|
|
|
+import holeg.model.NodeType;
|
|
import holeg.power_flow.*;
|
|
import holeg.power_flow.*;
|
|
import holeg.ui.PowerFlowAnalysisMenu;
|
|
import holeg.ui.PowerFlowAnalysisMenu;
|
|
|
|
|
|
@@ -16,42 +17,100 @@ import java.util.*;
|
|
public class HolegPowerFlow {
|
|
public class HolegPowerFlow {
|
|
private Random random = new Random();
|
|
private Random random = new Random();
|
|
|
|
|
|
- public GridSolverResult solve(Grid grid) {
|
|
|
|
- List<Grid> islands = findIslands(grid);
|
|
|
|
|
|
+ public GridSolverResult solve(Grid grid, PowerFlowSettings settings) {
|
|
|
|
+ if (grid == null)
|
|
|
|
+ throw new IllegalArgumentException("grid is null");
|
|
|
|
+ if (settings == null)
|
|
|
|
+ throw new IllegalArgumentException("settings is null");
|
|
|
|
|
|
- // Use default settings
|
|
|
|
- SolverSettings settings = new SolverSettings();
|
|
|
|
|
|
+ List<Grid> islands = findIslands(grid);
|
|
|
|
|
|
boolean anySolved = false;
|
|
boolean anySolved = false;
|
|
GridSolverResult sumResult = GridSolverResult.Solved;
|
|
GridSolverResult sumResult = GridSolverResult.Solved;
|
|
|
|
+ double minSlackPower = Double.MAX_VALUE;
|
|
|
|
|
|
// Try to solve each island
|
|
// Try to solve each island
|
|
for (Grid island : islands) {
|
|
for (Grid island : islands) {
|
|
boolean solved = false;
|
|
boolean solved = false;
|
|
|
|
|
|
- // Try to solve problem 6 times -> each time the slack node has a new position (random)
|
|
|
|
- for (int i = 0; i < 6; i++) {
|
|
|
|
|
|
+ // Calculate number of calculation tries
|
|
|
|
+ int solveTryCount;
|
|
|
|
+ if (island.getNodes().stream().anyMatch(n -> n.getType() == NodeType.Slack))
|
|
|
|
+ solveTryCount = 1;
|
|
|
|
+ else if (settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.MinimizeSlack)
|
|
|
|
+ solveTryCount = island.getNodes().size();
|
|
|
|
+ else if (settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.RandomNode
|
|
|
|
+ || settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.RandomProducer)
|
|
|
|
+ solveTryCount = island.getNodes().size() / 2;
|
|
|
|
+ else
|
|
|
|
+ solveTryCount = 1;
|
|
|
|
+
|
|
|
|
+ PowerFlowProblem bestProblem = null;
|
|
|
|
+ SolverResult bestResult = null;
|
|
|
|
+
|
|
|
|
+ for (int i = 0; i < solveTryCount; i++) {
|
|
// Build problem and solve it
|
|
// Build problem and solve it
|
|
- PowerFlowProblem problem = buildProblem(island);
|
|
|
|
|
|
+ PowerFlowProblem problem = buildProblem(island, i, settings);
|
|
|
|
+
|
|
|
|
+ // See if we can skip the problem
|
|
|
|
+ if (problem.buses.length <= 1) {
|
|
|
|
+ solved = true;
|
|
|
|
+ break;
|
|
|
|
+ }
|
|
|
|
+ if (settings.skipGridsWithNoProducers && problem.getProducers().isEmpty()) {
|
|
|
|
+ solved = true;
|
|
|
|
+ break;
|
|
|
|
+ }
|
|
|
|
+
|
|
Solver solver = new NewtonRaphsonSolver();
|
|
Solver solver = new NewtonRaphsonSolver();
|
|
- SolverResult result = solver.solve(problem, settings);
|
|
|
|
|
|
+ SolverResult result = solver.solve(problem, settings.solverSettings);
|
|
|
|
|
|
// Debug message
|
|
// Debug message
|
|
- if (PowerFlowAnalysisMenu.getInstance().shouldShowDebug() && (result.solved || i == 3))
|
|
|
|
|
|
+ if (PowerFlowAnalysisMenu.getInstance().shouldShowDebug() && (result.solved || i == solveTryCount - 1))
|
|
debugShowResultAsMessageBox(problem, result);
|
|
debugShowResultAsMessageBox(problem, result);
|
|
|
|
|
|
- // Update grid if solved
|
|
|
|
if (result.solved) {
|
|
if (result.solved) {
|
|
- updateGrid(island, problem, result);
|
|
|
|
solved = true;
|
|
solved = true;
|
|
- break;
|
|
|
|
|
|
+
|
|
|
|
+ // Simply use the first solved result
|
|
|
|
+ if (settings.slackNodePlacementStrategy != SlackNodePlacementStrategy.MinimizeSlack) {
|
|
|
|
+ bestProblem = problem;
|
|
|
|
+ bestResult = result;
|
|
|
|
+ break;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // Is this result better?
|
|
|
|
+ double slackPower = result.flowData.busInjection[0].lenSquared();
|
|
|
|
+ if (slackPower < minSlackPower) {
|
|
|
|
+ minSlackPower = slackPower;
|
|
|
|
+ bestProblem = problem;
|
|
|
|
+ bestResult = result;
|
|
|
|
+ }
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
- if (!solved)
|
|
|
|
- sumResult = GridSolverResult.Error;
|
|
|
|
|
|
+ // Update grid if solved
|
|
|
|
+ if (solved) {
|
|
|
|
+ // Check limits
|
|
|
|
+ boolean error = false;
|
|
|
|
+ if (bestResult != null) {
|
|
|
|
+ if (bestResult.flowData.busInjection[0].len() > settings.maxSlackPowerUntilInvalid)
|
|
|
|
+ error = true;
|
|
|
|
+ if (Arrays.stream(bestResult.voltages).anyMatch(u -> u.real < settings.minVoltageUntilInvalid))
|
|
|
|
+ error = true;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ // Update grid or set error
|
|
|
|
+ if (!error) {
|
|
|
|
+ if (bestProblem != null)
|
|
|
|
+ updateGrid(island, bestProblem, bestResult);
|
|
|
|
+ anySolved = true;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ sumResult = GridSolverResult.Error;
|
|
|
|
+ }
|
|
else
|
|
else
|
|
- anySolved = true;
|
|
|
|
|
|
+ sumResult = GridSolverResult.Error;
|
|
}
|
|
}
|
|
|
|
|
|
// Check if some islands failed, but not all
|
|
// Check if some islands failed, but not all
|
|
@@ -108,7 +167,7 @@ public class HolegPowerFlow {
|
|
return islands;
|
|
return islands;
|
|
}
|
|
}
|
|
|
|
|
|
- private PowerFlowProblem buildProblem(Grid grid) {
|
|
|
|
|
|
+ private PowerFlowProblem buildProblem(Grid grid, int tryCount, PowerFlowSettings settings) {
|
|
List<Bus> buses = new ArrayList<>();
|
|
List<Bus> buses = new ArrayList<>();
|
|
List<Line> lines = new ArrayList<>();
|
|
List<Line> lines = new ArrayList<>();
|
|
|
|
|
|
@@ -119,11 +178,11 @@ public class HolegPowerFlow {
|
|
createGridLine(grid, lines, edge);
|
|
createGridLine(grid, lines, edge);
|
|
|
|
|
|
// Scale voltages and scale power
|
|
// Scale voltages and scale power
|
|
- double scaleVoltage = scaleVoltages(buses);
|
|
|
|
|
|
+ double scaleVoltage = 1.0 / 230.0;
|
|
double scalePower = scalePower(buses);
|
|
double scalePower = scalePower(buses);
|
|
|
|
|
|
// Find position for slack node
|
|
// Find position for slack node
|
|
- addSlackNode(buses, lines);
|
|
|
|
|
|
+ addSlackNode(buses, lines, tryCount, settings);
|
|
|
|
|
|
// Sort lines
|
|
// Sort lines
|
|
lines.sort(Comparator.comparingInt(a -> a.from));
|
|
lines.sort(Comparator.comparingInt(a -> a.from));
|
|
@@ -136,20 +195,24 @@ public class HolegPowerFlow {
|
|
Bus bus = new Bus();
|
|
Bus bus = new Bus();
|
|
bus.delta = 0;
|
|
bus.delta = 0;
|
|
bus.voltage = 1;
|
|
bus.voltage = 1;
|
|
- bus.Pl = node.getPowerConsumption().real;
|
|
|
|
- bus.Ql = node.getPowerConsumption().imaginary;
|
|
|
|
|
|
+ bus.Pl = Math.abs(node.getPowerConsumption().real);
|
|
|
|
+ bus.Ql = Math.abs(node.getPowerConsumption().imaginary);
|
|
bus.tag = node;
|
|
bus.tag = node;
|
|
|
|
|
|
- if (node.getPowerGeneration().isZero()) {
|
|
|
|
|
|
+ if (node.getType() == NodeType.Slack)
|
|
|
|
+ bus.type = BusType.Slack;
|
|
|
|
+ else if (node.getPowerGeneration().isZero()) {
|
|
bus.Pg = 0;
|
|
bus.Pg = 0;
|
|
bus.Qg = 0;
|
|
bus.Qg = 0;
|
|
bus.type = BusType.PQ;
|
|
bus.type = BusType.PQ;
|
|
}
|
|
}
|
|
else {
|
|
else {
|
|
- bus.Pg = node.getPowerGeneration().real;
|
|
|
|
- bus.Qg = node.getPowerGeneration().imaginary;
|
|
|
|
|
|
+ bus.Pg = Math.abs(node.getPowerGeneration().real);
|
|
|
|
+ bus.Qg = Math.abs(node.getPowerGeneration().imaginary);
|
|
bus.type = BusType.PV;
|
|
bus.type = BusType.PV;
|
|
}
|
|
}
|
|
|
|
+ bus.Qmin = -1000000;
|
|
|
|
+ bus.Qmax = 1000000;
|
|
|
|
|
|
buses.add(bus);
|
|
buses.add(bus);
|
|
}
|
|
}
|
|
@@ -158,32 +221,19 @@ public class HolegPowerFlow {
|
|
Line line = new Line();
|
|
Line line = new Line();
|
|
line.tag = edge;
|
|
line.tag = edge;
|
|
// Calculate values for line based on sample datasheet
|
|
// Calculate values for line based on sample datasheet
|
|
- line.R = 0.01938; //0.791 * edge.getLengthKilometers();
|
|
|
|
- line.X = 0.1; //0.11 * edge.getLengthKilometers();
|
|
|
|
- line.B_2 = 0.1; //0.5 * 0.350141 * edge.getLengthKilometers();
|
|
|
|
|
|
+ line.R = 0.000194 * edge.getLengthKilometers();
|
|
|
|
+ line.X = 0.000592 * edge.getLengthKilometers();
|
|
|
|
+ line.B_2 = 0.000528;
|
|
line.a = 1;
|
|
line.a = 1;
|
|
- line.from = grid.getNodes().indexOf(edge.getFrom());
|
|
|
|
- line.to = grid.getNodes().indexOf(edge.getTo());
|
|
|
|
- lines.add(line);
|
|
|
|
- }
|
|
|
|
|
|
|
|
- private double scaleVoltages(List<Bus> buses) {
|
|
|
|
- double decimal = 1;
|
|
|
|
- while(true) {
|
|
|
|
- boolean nextDecimal = false;
|
|
|
|
- for (Bus bus : buses) {
|
|
|
|
- if (bus.voltage > decimal) {
|
|
|
|
- nextDecimal = true;
|
|
|
|
- break;
|
|
|
|
- }
|
|
|
|
- }
|
|
|
|
- if (!nextDecimal)
|
|
|
|
- break;
|
|
|
|
- decimal *= 10;
|
|
|
|
- }
|
|
|
|
- for (Bus bus : buses)
|
|
|
|
- bus.voltage /= decimal;
|
|
|
|
- return 1.0 / decimal;
|
|
|
|
|
|
+ // Calculate from/to, swap if needed
|
|
|
|
+ int from = grid.getNodes().indexOf(edge.getFrom());
|
|
|
|
+ int to = grid.getNodes().indexOf(edge.getTo());
|
|
|
|
+ line.reverse = from > to;
|
|
|
|
+ line.from = Math.min(from, to);
|
|
|
|
+ line.to = Math.max(from, to);
|
|
|
|
+
|
|
|
|
+ lines.add(line);
|
|
}
|
|
}
|
|
|
|
|
|
private double scalePower(List<Bus> buses) {
|
|
private double scalePower(List<Bus> buses) {
|
|
@@ -205,53 +255,148 @@ public class HolegPowerFlow {
|
|
bus.Pg /= decimal;
|
|
bus.Pg /= decimal;
|
|
bus.Ql /= decimal;
|
|
bus.Ql /= decimal;
|
|
bus.Qg /= decimal;
|
|
bus.Qg /= decimal;
|
|
|
|
+ bus.Qmin /= decimal;
|
|
|
|
+ bus.Qmax /= decimal;
|
|
}
|
|
}
|
|
return 1.0 / decimal;
|
|
return 1.0 / decimal;
|
|
}
|
|
}
|
|
|
|
|
|
- private void addSlackNode(List<Bus> buses, List<Line> lines) {
|
|
|
|
- // Find possible positions
|
|
|
|
- List<Integer> possiblePositions = new ArrayList<>();
|
|
|
|
- for (int i = 0; i < buses.size(); i++)
|
|
|
|
- if (buses.get(i).Pg > 0)
|
|
|
|
- possiblePositions.add(i);
|
|
|
|
-
|
|
|
|
- // No generators? Add all positions
|
|
|
|
- if (possiblePositions.size() == 0) {
|
|
|
|
- for (int i = 0; i < buses.size(); i++)
|
|
|
|
- possiblePositions.add(i);
|
|
|
|
|
|
+ private void addSlackNode(List<Bus> buses, List<Line> lines, int tryCount, PowerFlowSettings settings) {
|
|
|
|
+ // Skip if have already slack node
|
|
|
|
+ int slackNodePosition = -1;
|
|
|
|
+ for (int i = 0; i < buses.size(); i++) {
|
|
|
|
+ if (buses.get(i).type == BusType.Slack) {
|
|
|
|
+ slackNodePosition = i;
|
|
|
|
+ break;
|
|
|
|
+ }
|
|
}
|
|
}
|
|
|
|
|
|
- // Choose position in grid
|
|
|
|
- int position = possiblePositions.get(random.nextInt(possiblePositions.size()));
|
|
|
|
-
|
|
|
|
- // Create slack node
|
|
|
|
- Bus slack = new Bus();
|
|
|
|
- slack.voltage = 1;
|
|
|
|
- slack.delta = 0;
|
|
|
|
- slack.type = BusType.Slack;
|
|
|
|
|
|
+ // Position
|
|
|
|
+ int position;
|
|
|
|
+ if (slackNodePosition >= 0)
|
|
|
|
+ position = slackNodePosition;
|
|
|
|
+ else if (settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.FirstNode)
|
|
|
|
+ position = 0;
|
|
|
|
+ else if (settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.RandomNode
|
|
|
|
+ || settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.RandomProducer) {
|
|
|
|
+
|
|
|
|
+ // Find possible positions
|
|
|
|
+ List<Integer> possiblePositions = new ArrayList<>();
|
|
|
|
+ if (settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.RandomProducer) {
|
|
|
|
+ for (int i = 0; i < buses.size(); i++)
|
|
|
|
+ if (buses.get(i).isProducer())
|
|
|
|
+ possiblePositions.add(i);
|
|
|
|
+ }
|
|
|
|
|
|
- buses.add(slack);
|
|
|
|
|
|
+ // Choose position in grid
|
|
|
|
+ if (possiblePositions.size() == 0) // No generators or strategy not random producer? Add all positions
|
|
|
|
+ position = random.nextInt(buses.size());
|
|
|
|
+ else
|
|
|
|
+ position = possiblePositions.get(random.nextInt(possiblePositions.size()));
|
|
|
|
+ }
|
|
|
|
+ else if (settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.LargestProducer) {
|
|
|
|
+ position = 0;
|
|
|
|
+
|
|
|
|
+ // Find producer with max Pg value
|
|
|
|
+ double maxPower = -Double.MAX_VALUE;
|
|
|
|
+ for (int i = 0; i < buses.size(); i++) {
|
|
|
|
+ double power = buses.get(i).Pg;
|
|
|
|
+ if (power > maxPower) {
|
|
|
|
+ position = i;
|
|
|
|
+ maxPower = power;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else if (settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.LargestConsumer) {
|
|
|
|
+ position = 0;
|
|
|
|
+
|
|
|
|
+ // Find producer with max Pl value
|
|
|
|
+ double maxPower = -Double.MAX_VALUE;
|
|
|
|
+ for (int i = 0; i < buses.size(); i++) {
|
|
|
|
+ double power = buses.get(i).Pl;
|
|
|
|
+ if (power > maxPower) {
|
|
|
|
+ position = i;
|
|
|
|
+ maxPower = power;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else if (settings.slackNodePlacementStrategy == SlackNodePlacementStrategy.MinimizeSlack) {
|
|
|
|
+ position = tryCount;
|
|
|
|
+ double power = buses.get(position).Pg + buses.get(position).Qg + buses.get(position).Pl + buses.get(position).Ql;
|
|
|
|
+ if (Math.abs(power) < 0.01)
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+ else
|
|
|
|
+ throw new UnsupportedOperationException("SlackNodePlacementStrategy not implemented");
|
|
|
|
+
|
|
|
|
+ // Already contains slack node or we should replace one node with a new slack node
|
|
|
|
+ if (slackNodePosition >= 0 || settings.replaceNodeWithSlackNode) {
|
|
|
|
+ Bus slack = buses.get(position);
|
|
|
|
+ slack.type = BusType.Slack;
|
|
|
|
+
|
|
|
|
+ if (position > 0) {
|
|
|
|
+ // Swap position with first element
|
|
|
|
+ Bus zeroNode = buses.get(0);
|
|
|
|
+ buses.set(0, slack);
|
|
|
|
+ buses.set(position, zeroNode);
|
|
|
|
+
|
|
|
|
+ // Fix indices of lines (we changed the order in the list)
|
|
|
|
+ for (Line line : lines) {
|
|
|
|
+ if (line.from == position)
|
|
|
|
+ line.from = 0;
|
|
|
|
+ else if (line.from == 0)
|
|
|
|
+ line.from = position;
|
|
|
|
+
|
|
|
|
+ if (line.to == position)
|
|
|
|
+ line.to = 0;
|
|
|
|
+ else if (line.to == 0)
|
|
|
|
+ line.to = position;
|
|
|
|
+
|
|
|
|
+ // We need to swap from/to
|
|
|
|
+ if (line.from > line.to) {
|
|
|
|
+ int t = line.from;
|
|
|
|
+ line.from = line.to;
|
|
|
|
+ line.to = t;
|
|
|
|
+ line.reverse = !line.reverse;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else {
|
|
|
|
+ // Create slack node
|
|
|
|
+ Bus slack = new Bus();
|
|
|
|
+ slack.voltage = 1;
|
|
|
|
+ slack.delta = 0;
|
|
|
|
+ slack.type = BusType.Slack;
|
|
|
|
+
|
|
|
|
+ buses.add(0, slack);
|
|
|
|
+
|
|
|
|
+ // Fix line indices
|
|
|
|
+ for (Line line : lines) {
|
|
|
|
+ line.from += 1;
|
|
|
|
+ line.to += 1;
|
|
|
|
+ }
|
|
|
|
|
|
- // Create short line
|
|
|
|
- Line line = new Line();
|
|
|
|
- line.from = position;
|
|
|
|
- line.to = buses.indexOf(slack);
|
|
|
|
- line.R = 0.01938;
|
|
|
|
- line.X = 0.1;
|
|
|
|
- line.B_2 = 0.1;
|
|
|
|
- line.a = 1;
|
|
|
|
|
|
+ // Create short line
|
|
|
|
+ Line line = new Line();
|
|
|
|
+ line.from = position + 1;
|
|
|
|
+ line.to = buses.indexOf(slack);
|
|
|
|
+ line.R = 0.01938;
|
|
|
|
+ line.X = 0.1;
|
|
|
|
+ line.B_2 = 0.1;
|
|
|
|
+ line.a = 1;
|
|
|
|
|
|
- lines.add(line);
|
|
|
|
|
|
+ lines.add(line);
|
|
|
|
+ }
|
|
}
|
|
}
|
|
|
|
|
|
private void debugShowResultAsMessageBox(PowerFlowProblem problem, SolverResult result) {
|
|
private void debugShowResultAsMessageBox(PowerFlowProblem problem, SolverResult result) {
|
|
- try (ByteArrayOutputStream baos = new ByteArrayOutputStream()) {
|
|
|
|
|
|
+ try (ByteArrayOutputStream stream = new ByteArrayOutputStream()) {
|
|
final String utf8 = StandardCharsets.UTF_8.name();
|
|
final String utf8 = StandardCharsets.UTF_8.name();
|
|
- try (PrintStream ps = new PrintStream(baos, true, utf8)) {
|
|
|
|
|
|
+ try (PrintStream ps = new PrintStream(stream, true, utf8)) {
|
|
result.printTo(problem, ps);
|
|
result.printTo(problem, ps);
|
|
}
|
|
}
|
|
- String data = baos.toString(utf8);
|
|
|
|
|
|
+ String data = stream.toString(utf8);
|
|
JOptionPane.showMessageDialog(null, data,"Debug output", JOptionPane.INFORMATION_MESSAGE);
|
|
JOptionPane.showMessageDialog(null, data,"Debug output", JOptionPane.INFORMATION_MESSAGE);
|
|
} catch (IOException e) {
|
|
} catch (IOException e) {
|
|
e.printStackTrace();
|
|
e.printStackTrace();
|
|
@@ -265,8 +410,11 @@ public class HolegPowerFlow {
|
|
if (node == null)
|
|
if (node == null)
|
|
continue;
|
|
continue;
|
|
|
|
|
|
- node.setVoltage(result.voltages[i].real / problem.scaleVoltage);
|
|
|
|
|
|
+ node.setVoltage(result.voltages[i].len() / problem.scaleVoltage);
|
|
|
|
+ node.setPhase(Math.toDegrees(result.voltages[i].angle()));
|
|
node.setCurrent(result.flowData.busCurrent[i] / currentScale);
|
|
node.setCurrent(result.flowData.busCurrent[i] / currentScale);
|
|
|
|
+ if (problem.buses[i].type == BusType.Slack)
|
|
|
|
+ node.setType(NodeType.Slack);
|
|
}
|
|
}
|
|
|
|
|
|
for (int i = 0; i < problem.lines.length; i++) {
|
|
for (int i = 0; i < problem.lines.length; i++) {
|
|
@@ -274,9 +422,10 @@ public class HolegPowerFlow {
|
|
if (edge == null)
|
|
if (edge == null)
|
|
continue;
|
|
continue;
|
|
|
|
|
|
- edge.setPowerFlow(result.flowData.linePower[i].multiply(1 / problem.scalePower));
|
|
|
|
- edge.setLineLoss(result.flowData.linePowerLoss[i].multiply(1 / problem.scalePower));
|
|
|
|
- edge.setCurrent(result.flowData.lineCurrent[i] / currentScale);
|
|
|
|
|
|
+ double reverseFactor = problem.lines[i].reverse ? -1 : 1;
|
|
|
|
+ edge.setPowerFlow(result.flowData.linePower[i].multiply(1 / problem.scalePower).multiply(reverseFactor));
|
|
|
|
+ edge.setLineLoss(result.flowData.linePowerLoss[i].multiply(1 / problem.scalePower).multiply(reverseFactor));
|
|
|
|
+ edge.setCurrent(result.flowData.lineCurrent[i] / currentScale * reverseFactor);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|