Algorithm for Solving the Complicated Maximum Flow in Networks Based on the Interrelationship Tables
Xu-ying Zhu (),
Kai-hu Hou (),
Jin-yuan Zhong and
Lin Yang
Additional contact information
Xu-ying Zhu: Kunming University of Science and Technology
Kai-hu Hou: Kunming University of Science and Technology
Jin-yuan Zhong: Kunming University of Science and Technology
Lin Yang: Kunming University of Science and Technology
Chapter Chapter 82 in Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012), 2013, pp 823-833 from Springer
Abstract:
Abstract In this paper, we focused on the weighted networks system balance relationship between supply and demand to solve the network maximum flow problem under giant complicated environment. A heuristic solution method was proposed which was based on the interrelationship tables. The data was stored in the interrelationship tables according to the method which was defined and discussed on the model whose main part was list structure. The algorithm calculating showed a high efficiency in the condition of many disturbed factors were included while analyzing weighted networks. This algorithm was effectively proved by designed calculating examples. It could improve the visual degree of inherent relationship network and show superiority on solving complex network problems. This algorithm can supply model structure and operating basis on the aspect of solving maximum flow problems with the help of a computer. And it can also expand the researching methods of intelligent network system.
Keywords: Heuristic algorithm; Maximum flow; Mutual relationship tables; Weighted networks (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-33012-4_82
Ordering information: This item can be ordered from
http://www.springer.com/9783642330124
DOI: 10.1007/978-3-642-33012-4_82
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().