A mixed integer program for the spanning distribution forest of a power network

Michael Palk, Raka Jovanovic, Stefan Vob

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we focus on solving the graph problem of the spanning distribution forest of a power network (SDFPN). The interest for the SDFPN comes from the fact that it well represents practical problems related to the partitioning of power distribution systems. It is closely related to the problem of maximal partitioning of supply demand graphs (MPGSD) and the capacitated spanning forest (CSF) problem that are used for modeling similar real-world systems. It has an advantage, compared to these problems, that it incorporates constraints related to ampacity, radiality, and the balance of consumption/generation in a partition. In this work, a mixed integer program (MIP) is developed for finding optimal solutions for the SDFPN. Next, a greedy constructive algorithm is designed for finding feasible solutions for large problem instances at low computational costs. In the computational experiments, we evaluate the size of graphs that can be solved to optimality using the MIP. The solutions acquired in this way are used to assess the performance of the proposed greedy algorithm.

Original languageEnglish
Title of host publication2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages48-55
Number of pages8
ISBN (Electronic)9781538664452
DOIs
Publication statusPublished - 31 Jan 2019
Event2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019 - Doha, Qatar
Duration: 1 Jan 20194 Jan 2019

Publication series

Name2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019

Conference

Conference2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019
CountryQatar
CityDoha
Period1/1/194/1/19

Fingerprint

Costs
Experiments

Keywords

  • Graph partitioning
  • Greedy algorithm
  • Mixed integer programming
  • Power network
  • Spanning distribution forest

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Industrial and Manufacturing Engineering

Cite this

Palk, M., Jovanovic, R., & Vob, S. (2019). A mixed integer program for the spanning distribution forest of a power network. In 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019 (pp. 48-55). [8632783] (2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/AIAIM.2019.8632783

A mixed integer program for the spanning distribution forest of a power network. / Palk, Michael; Jovanovic, Raka; Vob, Stefan.

2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 48-55 8632783 (2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Palk, M, Jovanovic, R & Vob, S 2019, A mixed integer program for the spanning distribution forest of a power network. in 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019., 8632783, 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019, Institute of Electrical and Electronics Engineers Inc., pp. 48-55, 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019, Doha, Qatar, 1/1/19. https://doi.org/10.1109/AIAIM.2019.8632783
Palk M, Jovanovic R, Vob S. A mixed integer program for the spanning distribution forest of a power network. In 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 48-55. 8632783. (2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019). https://doi.org/10.1109/AIAIM.2019.8632783
Palk, Michael ; Jovanovic, Raka ; Vob, Stefan. / A mixed integer program for the spanning distribution forest of a power network. 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 48-55 (2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019).
@inproceedings{faaf0f984a0e4b18a4ab9edf16e32496,
title = "A mixed integer program for the spanning distribution forest of a power network",
abstract = "In this paper we focus on solving the graph problem of the spanning distribution forest of a power network (SDFPN). The interest for the SDFPN comes from the fact that it well represents practical problems related to the partitioning of power distribution systems. It is closely related to the problem of maximal partitioning of supply demand graphs (MPGSD) and the capacitated spanning forest (CSF) problem that are used for modeling similar real-world systems. It has an advantage, compared to these problems, that it incorporates constraints related to ampacity, radiality, and the balance of consumption/generation in a partition. In this work, a mixed integer program (MIP) is developed for finding optimal solutions for the SDFPN. Next, a greedy constructive algorithm is designed for finding feasible solutions for large problem instances at low computational costs. In the computational experiments, we evaluate the size of graphs that can be solved to optimality using the MIP. The solutions acquired in this way are used to assess the performance of the proposed greedy algorithm.",
keywords = "Graph partitioning, Greedy algorithm, Mixed integer programming, Power network, Spanning distribution forest",
author = "Michael Palk and Raka Jovanovic and Stefan Vob",
year = "2019",
month = "1",
day = "31",
doi = "10.1109/AIAIM.2019.8632783",
language = "English",
series = "2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "48--55",
booktitle = "2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019",

}

TY - GEN

T1 - A mixed integer program for the spanning distribution forest of a power network

AU - Palk, Michael

AU - Jovanovic, Raka

AU - Vob, Stefan

PY - 2019/1/31

Y1 - 2019/1/31

N2 - In this paper we focus on solving the graph problem of the spanning distribution forest of a power network (SDFPN). The interest for the SDFPN comes from the fact that it well represents practical problems related to the partitioning of power distribution systems. It is closely related to the problem of maximal partitioning of supply demand graphs (MPGSD) and the capacitated spanning forest (CSF) problem that are used for modeling similar real-world systems. It has an advantage, compared to these problems, that it incorporates constraints related to ampacity, radiality, and the balance of consumption/generation in a partition. In this work, a mixed integer program (MIP) is developed for finding optimal solutions for the SDFPN. Next, a greedy constructive algorithm is designed for finding feasible solutions for large problem instances at low computational costs. In the computational experiments, we evaluate the size of graphs that can be solved to optimality using the MIP. The solutions acquired in this way are used to assess the performance of the proposed greedy algorithm.

AB - In this paper we focus on solving the graph problem of the spanning distribution forest of a power network (SDFPN). The interest for the SDFPN comes from the fact that it well represents practical problems related to the partitioning of power distribution systems. It is closely related to the problem of maximal partitioning of supply demand graphs (MPGSD) and the capacitated spanning forest (CSF) problem that are used for modeling similar real-world systems. It has an advantage, compared to these problems, that it incorporates constraints related to ampacity, radiality, and the balance of consumption/generation in a partition. In this work, a mixed integer program (MIP) is developed for finding optimal solutions for the SDFPN. Next, a greedy constructive algorithm is designed for finding feasible solutions for large problem instances at low computational costs. In the computational experiments, we evaluate the size of graphs that can be solved to optimality using the MIP. The solutions acquired in this way are used to assess the performance of the proposed greedy algorithm.

KW - Graph partitioning

KW - Greedy algorithm

KW - Mixed integer programming

KW - Power network

KW - Spanning distribution forest

UR - http://www.scopus.com/inward/record.url?scp=85062839993&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062839993&partnerID=8YFLogxK

U2 - 10.1109/AIAIM.2019.8632783

DO - 10.1109/AIAIM.2019.8632783

M3 - Conference contribution

AN - SCOPUS:85062839993

T3 - 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019

SP - 48

EP - 55

BT - 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -