The Resource Flow networks : analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks, Michael T. Todinov, Oxford Brookes University, Oxford, UK
Flow networks : analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks, Michael T. Todinov, Oxford Brookes University, Oxford, UK
 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 ultrafast 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 reoptimizing 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
 Language
 eng
 Edition
 First edition.
 Extent
 1 online resource (xviii, 247 pages)
 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 PseudoCode 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 SourcetoSink Minimal Paths
 2.5 Determining the SmallestCost 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 st Cuts; 3.3 A Necessary and Sufficient Condition for a Maximum Throughput Flow in a Static Network: The MaxFlow MinCut Theorem; 3.4 Classical Augmentation Algorithms for Determining the Maximum Throughput Flow in Networks
 3.5 General PushRelabel Algorithm for Maximising the Throughput Flow in a Network3.6 Applications; 3.7 Successive ShortestPath Algorithm for Determining the Maximum Throughput Flow at a Minimum Cost; 3.7.1 Solved Example; 4 Maximising the Throughput Flow in Single and MultiCommodity 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 TwoStage 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 MultiCommodity 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
 Isbn
 9780123984067
 Label
 Flow networks : analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks
 Title
 Flow networks
 Title remainder
 analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks
 Statement of responsibility
 Michael T. Todinov, Oxford Brookes University, Oxford, UK
 Language
 eng
 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 ultrafast 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 reoptimizing 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
 Cataloging source
 E7B
 Illustrations
 illustrations
 Index
 no index present
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 Series statement
 Elsevier insights
 Label
 Flow networks : analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks, Michael T. Todinov, Oxford Brookes University, Oxford, UK
 Bibliography note
 Includes bibliographical references (pages 243247)
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 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 PseudoCode 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 SourcetoSink Minimal Paths
 2.5 Determining the SmallestCost 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 st Cuts; 3.3 A Necessary and Sufficient Condition for a Maximum Throughput Flow in a Static Network: The MaxFlow MinCut Theorem; 3.4 Classical Augmentation Algorithms for Determining the Maximum Throughput Flow in Networks
 3.5 General PushRelabel Algorithm for Maximising the Throughput Flow in a Network3.6 Applications; 3.7 Successive ShortestPath Algorithm for Determining the Maximum Throughput Flow at a Minimum Cost; 3.7.1 Solved Example; 4 Maximising the Throughput Flow in Single and MultiCommodity 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 TwoStage 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 MultiCommodity 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
 http://library.link/vocab/cover_art
 https://contentcafe2.btol.com/ContentCafe/Jacket.aspx?Return=1&Type=S&Value=9780123984067&userID=ebscotest&password=ebscotest
 Dimensions
 unknown
 http://library.link/vocab/discovery_link
 {'f': 'http://opac.lib.rpi.edu/record=b4170803'}
 Edition
 First edition.
 Extent
 1 online resource (xviii, 247 pages)
 Form of item
 online
 Isbn
 9780123984067
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other physical details
 illustrations.
 Specific material designation
 remote
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.lib.rpi.edu/portal/Flownetworksanalysisandoptimizationof/3TRV4UDS0iE/" typeof="WorkExample http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.rpi.edu/portal/Flownetworksanalysisandoptimizationof/3TRV4UDS0iE/">Flow networks : analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks, Michael T. Todinov, Oxford Brookes University, Oxford, UK</a></span>  <span property="offers" typeOf="Offer"><span property="offeredBy" typeof="Library ll:Library" resource="http://link.lib.rpi.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.rpi.edu/">Rensselaer Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Flow networks : analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks, Michael T. Todinov, Oxford Brookes University, Oxford, UK
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.lib.rpi.edu/portal/Flownetworksanalysisandoptimizationof/3TRV4UDS0iE/" typeof="WorkExample http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.rpi.edu/portal/Flownetworksanalysisandoptimizationof/3TRV4UDS0iE/">Flow networks : analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks, Michael T. Todinov, Oxford Brookes University, Oxford, UK</a></span>  <span property="offers" typeOf="Offer"><span property="offeredBy" typeof="Library ll:Library" resource="http://link.lib.rpi.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.rpi.edu/">Rensselaer Libraries</a></span></span></span></span></div>