Development and research of the algorithm for determining the maximum flow at distribution in the network

An upgraded version of Ford-Fulkerson algorithm is proposed, which allows to determine the maximum flow and the distribution flow in branches of the network. Results of simulation using this algorithm are given. They show its effectiveness in comparison with the other variants of flow distribution i...

Full description

Saved in:
Bibliographic Details
Published in:Open computer science 2016-01, Vol.6 (1), p.213-218
Main Authors: Akhmediyarova, Ainur, Kassymova, Dinara, Utegenova, Anar, Utepbergenov, Irbulat
Format: Article
Language:English
Subjects:
algorithm of reducing transit flows
Flows of cars
Ford- Fulkerson theorem
Ford-Fulkerson algorithm
maximum flow
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An upgraded version of Ford-Fulkerson algorithm is proposed, which allows to determine the maximum flow and the distribution flow in branches of the network. Results of simulation using this algorithm are given. They show its effectiveness in comparison with the other variants of flow distribution in the network at change of the capacity of branches randomly in time.
ISSN:2299-1093
2299-1093
DOI:10.1515/comp-2016-0017