scholarly journals A Minimum-Cost Flow Model for Workload Optimization on Cloud Infrastructure

2017 ◽  
Author(s):  
Frederick Nwanganga ◽  
Mandana Saebi ◽  
Gregory Madey ◽  
Nitesh Chawla
Keyword(s):  
Flow Model ◽  
Minimum Cost ◽  
Cloud Infrastructure ◽  
Minimum Cost Flow ◽  
Cost Flow

scholarly journals A Generalized Minimum Cost Flow Model for Multiple Emergency Flow Routing

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jianxun Cui ◽  
Shi An ◽  
Meng Zhao
Keyword(s):  
Flow Model ◽  
Time Window ◽  
Programming Model ◽  
Real Life ◽  
Minimum Cost ◽  
Emergency Evacuation ◽  
Mixed Integer ◽  
Fixed Cost ◽  
Minimum Cost Flow ◽  
Cost Flow

During real-life disasters, that is, earthquakes, floods, terrorist attacks, and other unexpected events, emergency evacuation and rescue are two primary operations that can save the lives and property of the affected population. It is unavoidable that evacuation flow and rescue flow will conflict with each other on the same spatial road network and within the same time window. Therefore, we propose a novel generalized minimum cost flow model to optimize the distribution pattern of these two types of flow on the same network by introducing the conflict cost. The travel time on each link is assumed to be subject to a bureau of public road (BPR) function rather than a fixed cost. Additionally, we integrate contraflow operations into this model to redesign the network shared by those two types of flow. A nonconvex mixed-integer nonlinear programming model with bilinear, fractional, and power components is constructed, and GAMS/BARON is used to solve this programming model. A case study is conducted in the downtown area of Harbin city in China to verify the efficiency of proposed model, and several helpful findings and managerial insights are also presented.

The Minimum Cost Flow Problem of Uncertain Random Network

2018 ◽  
Vol 35 (03) ◽  
pp. 1850016
Author(s):  
Soheila Abdi ◽  
Fahimeh Baroughi ◽  
Behrooz Alizadeh
Keyword(s):  
Flow Model ◽  
Flow Problem ◽  
Random Network ◽  
Minimum Cost ◽  
Random Variable ◽  
Minimum Cost Flow ◽  
Feasible Set ◽  
Uncertain Random Network ◽  
Minimum Cost Flow Problem ◽  
Cost Flow

The aim of this paper is to present a novel method for solving the minimum cost flow problem on networks with uncertain-random capacities and costs. The objective function of this problem is an uncertain random variable and the constraints of the problem do not make a deterministic feasible set. Under the framework of uncertain random programming, a corresponding [Formula: see text]-minimum cost flow model with a prespecified confidence level [Formula: see text], is formulated and its main properties are analyzed. It is proven that there exists an equivalence relationship between this model and the classical deterministic minimum cost flow model. Then an algorithm is proposed to find the maximum amount of [Formula: see text] such that for it, the feasible set of [Formula: see text]-minimum cost flow model is nonempty. Finally, a numerical example is presented to illustrate the efficiency of our proposed method.

scholarly journals A minimum cost flow model for level of repair analysis

2011 ◽  
Vol 133 (1) ◽  
pp. 233-242 ◽  
Author(s):  
R.J.I. Basten ◽  
M.C. van der Heijden ◽  
J.M.J. Schutten
Keyword(s):  
Flow Model ◽  
Minimum Cost ◽  
Minimum Cost Flow ◽  
Cost Flow ◽  
Level Of Repair Analysis

Practical extensions to a minimum cost flow model for level of repair analysis

2011 ◽  
Vol 211 (2) ◽  
pp. 333-342 ◽  
Author(s):  
R.J.I. Basten ◽  
M.C. van der Heijden ◽  
J.M.J. Schutten
Keyword(s):  
Flow Model ◽  
Minimum Cost ◽  
Minimum Cost Flow ◽  
Cost Flow ◽  
Level Of Repair Analysis

Minimum cost flow problem with conflicts

Networks ◽  
2021 ◽  
Author(s):  
Zeynep Şuvak ◽  
İ. Kuban Altınel ◽  
Necati Aras
Keyword(s):  
Flow Problem ◽  
Minimum Cost ◽  
Minimum Cost Flow ◽  
Minimum Cost Flow Problem ◽  
Cost Flow

scholarly journals Efficient Algorithms for Identifying Loop Formation and Computing θ Value for Solving Minimum Cost Flow Network Problems

2021 ◽  
Vol 20 ◽  
pp. 107-117
Author(s):  
TIMOTHY MICHAEL CHÁVEZ ◽  
DUC THAI NGUYEN
Keyword(s):  
Real Life ◽  
Minimum Cost ◽  
Simplex Algorithm ◽  
Efficient Algorithms ◽  
Computer Implementation ◽  
Loop Formation ◽  
Minimum Cost Flow ◽  
Flow Network ◽  
Network Problems ◽  
Cost Flow

While the minimum cost flow (MCF) problems have been well documented in many publications, due to its broad applications, little or no effort have been devoted to explaining the algorithms for identifying loop formation and computing the θ value needed to solve MCF network problems. This paper proposes efficient algorithms, and MATLAB computer implementation, for solving MCF problems. Several academic and real-life network problems have been solved to validate the proposed algorithms; the numerical results obtained by the developed MCF code have been compared and matched with the built-in MATLAB function Linprog() (Simplex algorithm) for further validation.

Sign in / Sign up

Export Citation Format

Share Document