A compaction scheme and generator for distribution networks

I-Lin Wang, Ju Chun Lin

Research output: Contribution to journalArticle

Abstract

In a distribution network, materials or products that go through a decomposition process can be considered as ows entering a specialized node, called D-node, which distributes each decomposed ow along an outgoing arc. Flows on each arc emanating from a D-node have to obey a pre-specified proportional relationship, in addition to the capacity constraints. The solution procedures for calculating optimal ows over distribution networks in litera- ture often assumes D-nodes to be disjoint, whereas in reality D-nodes may often connect to each other and complicate the problem. In this paper, we proposea polynomial-time network compaction scheme that compresses a distribution network into an equivalent one of smaller size, which can then be directly solved by conventional solution methods in related literature. In order to provide test cases of distribution networks containing D-nodes for computational tests in related research, we implement a random network generator that produces a connected and acyclic distribution network in a compact form. Mathematical properties together with their proofs are also discussed to provide more insights in the design of our generator.

Original languageEnglish
Pages (from-to)117-140
Number of pages24
JournalJournal of Industrial and Management Optimization
Volume12
Issue number1
DOIs
Publication statusPublished - 2016 Jan 1

Fingerprint

Compaction
Distribution Network
Electric power distribution
Generator
Vertex of a graph
Arc of a curve
Capacity Constraints
Random Networks
Distribution network
Node
Polynomials
Polynomial time
Disjoint
Decomposition
Directly proportional
Decompose

All Science Journal Classification (ASJC) codes

  • Business and International Management
  • Strategy and Management
  • Control and Optimization
  • Applied Mathematics

Cite this

@article{00ae1fdc45f34b8c875020b08a705fd3,
title = "A compaction scheme and generator for distribution networks",
abstract = "In a distribution network, materials or products that go through a decomposition process can be considered as ows entering a specialized node, called D-node, which distributes each decomposed ow along an outgoing arc. Flows on each arc emanating from a D-node have to obey a pre-specified proportional relationship, in addition to the capacity constraints. The solution procedures for calculating optimal ows over distribution networks in litera- ture often assumes D-nodes to be disjoint, whereas in reality D-nodes may often connect to each other and complicate the problem. In this paper, we proposea polynomial-time network compaction scheme that compresses a distribution network into an equivalent one of smaller size, which can then be directly solved by conventional solution methods in related literature. In order to provide test cases of distribution networks containing D-nodes for computational tests in related research, we implement a random network generator that produces a connected and acyclic distribution network in a compact form. Mathematical properties together with their proofs are also discussed to provide more insights in the design of our generator.",
author = "I-Lin Wang and Lin, {Ju Chun}",
year = "2016",
month = "1",
day = "1",
doi = "10.3934/jimo.2016.12.117",
language = "English",
volume = "12",
pages = "117--140",
journal = "Journal of Industrial and Management Optimization",
issn = "1547-5816",
publisher = "American Institute of Mathematical Sciences",
number = "1",

}

A compaction scheme and generator for distribution networks. / Wang, I-Lin; Lin, Ju Chun.

In: Journal of Industrial and Management Optimization, Vol. 12, No. 1, 01.01.2016, p. 117-140.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A compaction scheme and generator for distribution networks

AU - Wang, I-Lin

AU - Lin, Ju Chun

PY - 2016/1/1

Y1 - 2016/1/1

N2 - In a distribution network, materials or products that go through a decomposition process can be considered as ows entering a specialized node, called D-node, which distributes each decomposed ow along an outgoing arc. Flows on each arc emanating from a D-node have to obey a pre-specified proportional relationship, in addition to the capacity constraints. The solution procedures for calculating optimal ows over distribution networks in litera- ture often assumes D-nodes to be disjoint, whereas in reality D-nodes may often connect to each other and complicate the problem. In this paper, we proposea polynomial-time network compaction scheme that compresses a distribution network into an equivalent one of smaller size, which can then be directly solved by conventional solution methods in related literature. In order to provide test cases of distribution networks containing D-nodes for computational tests in related research, we implement a random network generator that produces a connected and acyclic distribution network in a compact form. Mathematical properties together with their proofs are also discussed to provide more insights in the design of our generator.

AB - In a distribution network, materials or products that go through a decomposition process can be considered as ows entering a specialized node, called D-node, which distributes each decomposed ow along an outgoing arc. Flows on each arc emanating from a D-node have to obey a pre-specified proportional relationship, in addition to the capacity constraints. The solution procedures for calculating optimal ows over distribution networks in litera- ture often assumes D-nodes to be disjoint, whereas in reality D-nodes may often connect to each other and complicate the problem. In this paper, we proposea polynomial-time network compaction scheme that compresses a distribution network into an equivalent one of smaller size, which can then be directly solved by conventional solution methods in related literature. In order to provide test cases of distribution networks containing D-nodes for computational tests in related research, we implement a random network generator that produces a connected and acyclic distribution network in a compact form. Mathematical properties together with their proofs are also discussed to provide more insights in the design of our generator.

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

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

U2 - 10.3934/jimo.2016.12.117

DO - 10.3934/jimo.2016.12.117

M3 - Article

VL - 12

SP - 117

EP - 140

JO - Journal of Industrial and Management Optimization

JF - Journal of Industrial and Management Optimization

SN - 1547-5816

IS - 1

ER -