Uncertain minimum cost flow problem

The aim of this paper is to give an uncertainty distribution of the least cost of shipment of a commodity through a network with uncertain capacities. Uncertainty theory is used to deal with uncertain capacities, and an $$\alpha $$α-minimum cost flow problem model is proposed. After defining the $$\alpha $$α-minimum cost flow, the properties of the model are analyzed, and then an algorithm for uncertain minimum cost flow problem is developed. The algorithm can be considered as a general solution to the uncertain minimum cost flow problem. To demonstrate the efficiency of the proposed algorithm, a numerical example is illustrated.

[1]  L. Zadeh Fuzzy sets as a basis for a theory of possibility , 1999 .

[2]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[3]  Jinwu Gao,et al.  Uncertain term structure model of interest rate , 2013, Soft Comput..

[4]  Yuan Gao,et al.  Connectedness Index of uncertain Graph , 2013, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[5]  M. Iri A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .

[6]  A. Williams A Stochastic Transportation Problem , 1963 .

[7]  Stephen D. Boyles,et al.  A mean-variance model for the minimum cost flow problem with stochastic arc costs , 2010, Networks.

[8]  Wansheng Tang,et al.  An uncertain price discrimination model in labor market , 2013, Soft Comput..

[9]  G. Minty Monotone networks , 1960, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[10]  Baoding Liu Why is There a Need for Uncertainty Theory , 2012 .

[11]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[12]  Kakuzo Iwamura,et al.  A sufficient and necessary condition of uncertainty distribution , 2010 .

[13]  Yuan Gao,et al.  Shortest path problem with uncertain arc lengths , 2011, Comput. Math. Appl..

[14]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[15]  Angelo Sifaleras,et al.  An exterior simplex type algorithm for the Minimum Cost Network Flow Problem , 2009, Comput. Oper. Res..

[16]  Endre Boros,et al.  On the Existence of a Feasible Flow in a Stochastic Transportation Network , 1991, Oper. Res..

[17]  Baoding Liu,et al.  Theory and Practice of Uncertain Programming , 2003, Studies in Fuzziness and Soft Computing.

[18]  D. Bertsekas Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

[19]  Baoding Liu,et al.  Uncertainty Theory - A Branch of Mathematics for Modeling Human Uncertainty , 2011, Studies in Computational Intelligence.

[20]  Yuhan Liu,et al.  Expected Value of Function of Uncertain Variables , 2010 .

[21]  M. Klein A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

[22]  Baoding Liu,et al.  Uncertain Multiobjective Programming and Uncertain Goal Programming , 2015 .

[23]  Robert G. Busacker,et al.  A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .

[24]  Baoding Liu Some Research Problems in Uncertainty Theory , 2009 .

[25]  Shengwei Han,et al.  The maximum flow problem of uncertain network , 2014, Inf. Sci..

[26]  Eleonor Ciurea,et al.  Sequential and parallel algorithms for minimum flows , 2004 .

[27]  Dimitri P. Bertsekas,et al.  A generic auction algorithm for the minimum cost network flow problem , 1993, Comput. Optim. Appl..

[28]  Richard D. Wollmer,et al.  Investment in stochastic minimum cost generalized multicommodity networks with application to coal transport , 1980, Networks.

[29]  Baoding Liu,et al.  Uncertain multilevel programming: Algorithm and applications , 2015, Comput. Ind. Eng..

[30]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[31]  Baoding Liu,et al.  Uncertainty Theory - A Branch of Mathematics for Modeling Human Uncertainty , 2011, Studies in Computational Intelligence.

[32]  Willard I. Zangwill,et al.  Cost Minimization in Networks with Discrete Stochastic Requirements , 1971, Oper. Res..

[33]  D. R. Fulkerson,et al.  An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

[34]  Yuan Gao Uncertain models for single facility location problems on networks , 2012 .