An Optimization Framework for Power Infrastructure Planning

01/09/2021
by   Nina Wiedemann, et al.
0

The ubiquitous expansion and transformation of the energy supply system involves large-scale power infrastructure construction projects. In the view of investments of more than a million dollars per kilometre, planning authorities aim to minimise the resistances posed by multiple stakeholders. Mathematical optimisation 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 flexibility and functionality. Our methods are demonstrated in a simple and intuitive graphical user interface, and an open-source package (LION) is available at https://pypi.org/project/lion-sp.

READ FULL TEXT

page 2

page 6

page 10

page 11

page 12

research
09/20/2018

L_1 Shortest Path Queries in Simple Polygons

Let P be a simple polygon of n vertices. We consider two-point L_1 short...
research
03/20/2021

Preprocessing power weighted shortest path data using a s-Well Separated Pair Decomposition

For s > 0, we consider an algorithm that computes all s-well separated p...
research
09/11/2018

Path Planning Algorithms for a Car-Like Robot visiting a set of Waypoints with Field of View Constraints

This article considers two variants of a shortest path problem for a car...
research
12/06/2018

A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks

Answering exact shortest path distance queries is a fundamental task in ...
research
06/24/2022

Approximating 1-Wasserstein Distance with Trees

Wasserstein distance, which measures the discrepancy between distributio...
research
05/01/2023

Fast Path Planning Through Large Collections of Safe Boxes

We present a fast algorithm for the design of smooth paths (or trajector...

Please sign up or login with your details

Forgot password? Click here to reset