Abstract
Designing electrical power network grids is a challenging and complex issue. We investigate two different problems: connecting a new point to an existing electrical grid based on Euclidean distances in a non-uniform weighted space and choosing the cost-optimum design for a new electrical network in which we are given information about the producers, the consumers and the possible connections between points in the network.
For the first problem we show that Dijkstra’s algorithm combined with a point sampling approach can be used to find an approximate solution.
The second problem is modeled as a maximum network flow problem for which connections do not only have a cost for each unit of flow sent, but also a fixed cost, which has to be paid if the connection is used in the network. We propose two different approaches for solving this problem: a branch-and-bound (BB) algorithm and a cost-function slope (CFS) heuristic.
For the first problem we show that Dijkstra’s algorithm combined with a point sampling approach can be used to find an approximate solution.
The second problem is modeled as a maximum network flow problem for which connections do not only have a cost for each unit of flow sent, but also a fixed cost, which has to be paid if the connection is used in the network. We propose two different approaches for solving this problem: a branch-and-bound (BB) algorithm and a cost-function slope (CFS) heuristic.
| Original language | English |
|---|---|
| Pages | 98 |
| Publication status | Published - 2014 |
| Event | OR: International conference on Operations Research 2014 - Aachen, Germany Duration: 2 Sept 2014 → 5 Sept 2014 |
Conference
| Conference | OR: International conference on Operations Research 2014 |
|---|---|
| Country/Territory | Germany |
| City | Aachen |
| Period | 2/09/14 → 5/09/14 |