Optimal Flow Trees for Networks with General Nonlinear Arc Costs
نویسندگان
چکیده
This paper describes the application of a dynamic programming approach to find minimum flow cost spanning trees on a network with general nonlinear arc costs. Thus, this problem is an extension of the Minimum Spanning Tree (MST) problem since we also consider flows that must be routed in order to satisfy user needs. In fact, the MST, usually, considers fixed arc costs and in our case the arc cost functions are nonlinear, having in addition to the fixed cost a flow dependent component. The arc cost functions involved may be of any type of form as long as they are separable and additive. This is a new problem, which is NP-Hard and a dynamic programming approach was developed to solve it exactly for small and medium size problems. We also report computational experiments on over 1200 problem instances taken from the OR-Library. AMS Subject Classification: 90C27, 90C35, 90C39
منابع مشابه
Optimal Trees for General Nonlinear Network Flow Problems: A Dynamic Programming Approach
In this paper, we describe a dynamic programming approach to find optimal trees to the singlesource minimum cost network flow problem with general nonlinear costs. This class of problems is known to be NP-Hard and there is a scarcity of methods to address them. The algorithms previously developed have considered only two particular types of cost functions: “staircase” and “sawtooth”. Here, a dy...
متن کاملDiameter-Constrained Trees for General Nonlinear Cost Flow Networks∗
In this work we propose a dynamic programming approach to the problem of finding a diameter-constrained minimum cost spanning tree on a flow network. The tree to be found must be rooted at the single source vertex and span all other vertices designated by demand vertices, of the given flow network. Furthermore, a constraint on the number of arcs to be used on the longest path is imposed. Since ...
متن کاملOptimal Two-Commodity Flows with Nonlinear Cost Functions
We consider networks in which two diierent commodities have to be transported across undirected arcs, subject to a shared capacity constraint on the arcs. For each arc and commodity there is an associated nonlinear cost which depends on the amount of the commodity transported across the arc. The aim is to minimize the sum of the costs over all arcs and commodities. EEcient algorithms for solvin...
متن کاملThe Optimal Power Flow of Multiple Energy Carriers in Networked Multi-Carrier Microgrid
The future distribution network comprising different energy carriers will include small-scale energy resources (SSERs) and loads, known as a Networked multi-carrier microgrid (NMCMG). This concept not only leads to an efficient reduction in operation costs, but also encompasses the energy transformation between gas and electric networks at combined nodes, as well as district heating networks. I...
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کامل