论文信息 - Flows Finding in Networks in Fuzzy Conditions

Flows Finding in Networks in Fuzzy Conditions

The following chapter deals with flow problems in transportation networks in terms of fuzziness. Literature review considering flows and basic problem statements is given. The task of maximum flow finding in transportation network with lower flow bounds in fuzzy conditions is described and solved. The necessity of considering dynamic transportation networks is explained. The task of maximum flow finding with lower flow bounds in fuzzy conditions in dynamic network is solved. Peculiarity of the considered task is in fuzzy and transit nature of the network parameters.

Alexander V. Bozhenyuk | Evgeniya Gerasimenko | A. Bozhenyuk | E. Gerasimenko

[1] James Evans,et al. Optimization algorithms for networks and graphs , 1992 .

[2] Vardges Melkonian. Flows in dynamic networks with aggregate arc capacities , 2007, Inf. Process. Lett..

[3] Katta G. Murty,et al. Network programming , 1992 .

[4] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[5] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .

[6] Andrew V. Goldberg,et al. Beyond the flow decomposition barrier , 1998, JACM.

[7] Dmitrii Lozovanu,et al. The maximum flow in dynamic networks , 2004, Comput. Sci. J. Moldova.

[8] S. Vajda,et al. Integer Programming and Network Flows , 1970 .

[9] Ismail Chabini,et al. The Minimum Cost Flow Problem in Capacitated Dynamic Networks , 2003 .

[10] Ebrahim Nasrabadi,et al. Minimum cost time-varying network flow problems , 2010, Optim. Methods Softw..

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

[12] Warren B. Powell,et al. Stochastic and dynamic networks and routing , 1995 .

[13] Evgeniya Gerasimenko,et al. THE TASK OF MINIMUM COST FLOW FINDING IN TRANSPORTATION NETWORKS IN FUZZY CONDITIONS , 2013 .