| Edition |
First edition. |
| Description |
1 online resource (xviii, 247 pages) : illustrations |
|
text txt rdacontent |
|
computer c rdamedia |
|
online resource cr rdacarrier |
| Series |
Elsevier insights |
|
Elsevier insights.
|
| Bibliography |
Includes bibliographical references (pages 243-247). |
| Summary |
Repairable flow networks are a new area of research, which analyzes the repair and flow disruption caused by failures of components in static flow networks. This book addresses a gap in current network research by developing the theory, algorithms and applications related to repairable flow networks and networks with disturbed flows. The theoretical results presented in the book lay the foundations of a new generation of ultra-fast algorithms for optimizing the flow in networks after failures or congestion, and the high computational speed creates the powerful possibility of optimal control of very large and complex networks in real time. Furthermore, the possibility for re-optimizing the network flows in real time increases significantly the yield from real production networks and reduces to a minimum the flow disruption caused by failures. The potential application of repairable flow networks reaches across many large and complex systems, including active power networks, telecommunication networks, oil and gas production networks, transportation networks, water supply networks, emergency evacuation networks, and supply networks. The book reveals a fundamental flaw in classical algorithms for maximising the throughput flow in networks, published since the creation of the theory of flow networks in 1956. Despite the years of intensive research, the classical algorithms for maximising the throughput flow leave highly undesirable directed loops of flow in the optimised networks. These flow loops are associated with wastage of energy and resources and increased levels of congestion in the optimised networks. Includes theory and practical examples to build a deep understanding of the issuesWritten by the leading scholar and researcher in this emerging fieldFeatures powerful software tools for analysis, optimization and control of repairable flow networks. |
| Note |
Print version record. |
| Contents |
Front Cover; Flow Networks: Analysis and Optimizationof Repairable Flow Networks, Networks with Disturbed Flows, Static Flow Networks andReliability Networks; Copyright Page; Contents; Preface; 1 Flow Networks -- Existing Analysis Approaches and Limitations; 1.1 Repairable Flow Networks and Static Flow Networks; 1.2 Repairable Flow Networks and Stochastic Flow Networks; 1.3 Networks with Disturbed Flows and Stochastic Flow Networks; 1.4 Performance of Repairable Flow Networks; 2 Flow Networks and Paths -- Basic Concepts, Conventions and Algorithms. |
|
2.1 Basic Concepts and Conventions: Data Structures for Representing Flow Networks2.2 Pseudo-Code Conventions Used in the Algorithms; 2.3 Efficient Representation of Flow Networks with Complex Topology; 2.3.1 Representing the Topology of a Complex Flow Network by an Adjacency Matrix; 2.3.2 Representing the Topology of a Complex Flow Network by Adjacency Arrays; 2.4 Paths: Algorithms Related to Paths in Flow Networks; 2.4.1 Determining the Shortest Path from the Source to the Sink; 2.4.2 Determining All Possible Source-to-Sink Minimal Paths. |
|
2.5 Determining the Smallest-Cost Paths from the Source2.6 Topological Sorting of Networks Without Cycles; 2.7 Transforming Flow Networks; 3 Key Concepts, Results and Algorithms Related to Static Flow Networks; 3.1 Path Augmentation in Flow Networks; 3.2 Bounding the Maximum Throughput Flow by the Capacity of s-t Cuts; 3.3 A Necessary and Sufficient Condition for a Maximum Throughput Flow in a Static Network: The Max-Flow Min-Cut Theorem; 3.4 Classical Augmentation Algorithms for Determining the Maximum Throughput Flow in Networks. |
|
3.5 General Push-Relabel Algorithm for Maximising the Throughput Flow in a Network3.6 Applications; 3.7 Successive Shortest-Path Algorithm for Determining the Maximum Throughput Flow at a Minimum Cost; 3.7.1 Solved Example; 4 Maximising the Throughput Flow in Single- and Multi-Commodity Networks: Removing Parasitic Directed Loops of Flow in Netw ... ; 4.1 Eliminating Parasitic Directed Loops of Flow in Networks Optimised by Classical Algorithms; 4.2 A Two-Stage Augmentation Algorithm for Determining the Maximum Throughput Flow in a Network. |
|
4.3 A New, Efficient Algorithm for Maximising the Throughput Flow of the Useful Commodity in a Multi-Commodity Flow Network4.4 Network Flow Transformation Along Cyclic Paths; 5 Networks with Disturbed Flows Dual Network Theorems for Networks with Disturbed Flows: Reoptimising the Power Flows in Act ... ; 5.1 Reoptimising the Flow in Networks with Disturbed Flows After Edge Failures and After Choking the Edge Flows; 5.2 A Fast Augmentation Algorithm for Reoptimising the Flow in a Repairable Network After an Edge Failure. |
| Subject |
Network analysis (Planning)
|
|
Programming (Mathematics)
|
|
Analyse de réseau (Planification)
|
|
Programmation (Mathématiques)
|
|
TECHNOLOGY & ENGINEERING -- Mechanical.
|
|
Network analysis (Planning)
|
|
Programming (Mathematics)
|
| Other Form: |
Print version: Todinov, M.T. Flow networks. 1st ed. Amsterdam ; Boston : Elsevier, 2013 9780123983961 (OCoLC)840485519 |
| ISBN |
9780123984067 (electronic bk.) |
|
0123984068 (electronic bk.) |
|
1283975122 |
|
9781283975124 |
|
9780123983961 |
|
0123983967 |
| Standard No. |
AU@ 000050859309 |
|
AU@ 000059642801 |
|
AU@ 000063003063 |
|
CHNEW 000600237 |
|
CHNEW 001011025 |
|
DEBBG BV042315117 |
|
DEBSZ 405347030 |
|
DEBSZ 431306702 |
|
DEBSZ 449343634 |
|
NLGGC 356871037 |
|
NZ1 15187665 |
|
