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 programming. Furthermore, the results of two algorithms will be compared. An illustrative example is also provided to clarify the concept.
منابع مشابه
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 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.
متن کاملA Fuzzy Residual Network Approach to Minimum Cost Flow Problem with Fuzzy Parameters
968 A Fuzzy Residual Network Approach to Minimum Cost Flow Problem with Fuzzy Parameters M. Bagherian Department of Applied Mathematics, Faculty of Mathematical Science, University of Guilan, Rasht, Iran. [email protected] . ABSTRACT The Minimum Cost Flow (MCF) problem has been defined as to determine a least cost shipment of a commodity through a network in order to satisfy demands at ce...
متن کامل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.
متن کاملCapacity inverse minimum cost flow problem
Given a directed graph G = (N,A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector û for the arc set A such that a given feasible flow x̂ is optimal with respect to the modified capacities. Among all capacity vectors û satisfying this condition, we would like to find one with minimum ‖û− u‖ value....
متن کامل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...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 6 شماره 1
صفحات 34- 47
تاریخ انتشار 2012-04-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023