On The Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network
نویسنده
چکیده مقاله:
A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illustrative example is solved to prove the efficiency of the proposed formulation.
منابع مشابه
A Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملThe maximum flow problem of uncertain network
The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. T...
متن کاملUncertain minimum cost multicommodity flow problem
This paper investigates the minimum cost multicommodity flow problem with uncertain costs and uncertain capacities. Uncertainty theory is used to deal with indeterminacy factors in uncertain network. An (α, β)-minimum cost multicommodity flow model is formulated. Some properties of the model are analyzed. An equivalence relationship between the (α, β)-minimum cost multicommodity flow and the mi...
متن کاملthe effects of changing roughness on the flow structure in the bends
flow in natural river bends is a complex and turbulent phenomenon which affects the scour and sedimentations and causes an irregular bed topography on the bed. for the reason, the flow hydralics and the parameters which affect the flow to be studied and understand. in this study the effect of bed and wall roughness using the software fluent discussed in a sharp 90-degree flume bend with 40.3cm ...
The Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 11 شماره 2
صفحات 111- 118
تاریخ انتشار 2019-04-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023