arrow
Return

An Optimization Framework for Power Infrastructure Planning

delete2022-03-01
delete3
delete
OA
AI
N
Nina Wiedemann *
DOI:10.1109/TPWRS.2021.3099445delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The ubiquitous expansion and transformation of the energy supply system involves large-scale power infrastructure construction projects. In view of investments of more than a million dollars per kilometre, planning authorities aim to minimize the resistances posed by multiple stakeholders. Mathematical optimization research offers efficient algorithms to compute globally optimal routes based on geographic input data. We propose a framework that utilizes a graph model where vertices represent possible locations of transmission towers, and edges are placed according to the feasible distance between neighbouring towers. In order to cope with the specific challenges arising in linear infrastructure layout, we first introduce a variant of the Bellman-Ford algorithm that efficiently computes the minimal-angle shortest path. Secondly, an iterative procedure is proposed that yields a locally optimal path at considerably lower memory requirements and runtime. Third, we discuss and analyse methods to output k diverse path alternatives. Experiments on real data show that compared to previous work, our approach reduces the resistances by more than 10% in feasible time, while at the same time offering much more flexibility and functionality. Our methods are demonstrated in a simple and intuitive graphical user interface, and an open-source package (LION), available at https://pypi.org/project/lion-sp/.
Keywords:
Power system planning
shortest path problem
geospatial analysis

Journal

IEEE Transactions on Power Systems cover
IEEE Transactions on Power Systems
IF:
7.2
Papers:
1.1W
Citations:
5.0W

Organization

S
swiss federal institutes of technology domain
Scholars:
9.0W
Papers: 8.0W
Citations: 163
Cited Papers

Cited Papers

Finding Top-k Shortest Paths with Diversity
err2018-03-01
err89
PREAI
errLiu, Huiping; Jin, Cheqing; Yang, Bin; Zhou, Aoying
errShare
errSave
On finding dissimilar paths
err2000-03-01
err148
PREAI
errAkgün, V; Erkut, E; Batta, R
errShare
errSave
errShare
errSave
errShare
errSave
The quadratic shortest path problem: complexity, approximability, and solution methods
err2018-07-01
err32
errOAAI
errRostami, Borzou; Chassein, Andre; Hopf, Michael; Frey, Davide; Buchheim, Christoph; Malucelli, Federico; Goerigk, Marc
errShare
errSave
researcher View more