SlackNodePlacementStrategy.java 896 B

1234567891011121314151617181920212223242526272829
  1. package holeg;
  2. public enum SlackNodePlacementStrategy {
  3. /**
  4. * The first node is always replaced as a slack node. The grid is only solved once.
  5. */
  6. FirstNode,
  7. /**
  8. * A random node is chosen as the slack node. The grid is solved multiple times.
  9. */
  10. RandomNode,
  11. /**
  12. * A random producer is chosen as the slack node. The grid is solved multiple times.
  13. */
  14. RandomProducer,
  15. /**
  16. * The largest producer is chosen as the slack node. The grid is only solved once.
  17. */
  18. LargestProducer,
  19. /**
  20. * The largest consumer is chosen as the slack node. The grid is only solved once.
  21. */
  22. LargestConsumer,
  23. /**
  24. * The grid is solved multiple times. For each try another node is the slack node. The minimum solution to
  25. * the problem in terms of the slack power is chosen as the final solved grid.
  26. */
  27. MinimizeSlack
  28. }