東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Flow networks = analysis and optimiz...

Todinov, M. T.

FindBook

Google Book

Amazon

博客來

Flow networks = analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Flow networks/ Michael T. Todinov.
其他題名:	analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks /
作者:	Todinov, M. T.
出版者:	Amsterdam ;Elsevier, : 2013.,
面頁冊數:	xviii, 247 p. :ill. ;24 cm.
標題:	Network analysis (Planning) -
電子資源:	http://www.sciencedirect.com/science/book/9780123983961
ISBN:	9780123983961 (electronic bk.)

Flow networks = analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks /
Todinov, M. T.

Flow networksanalysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks /[electronic resource] :Michael T. Todinov. - 1st ed. - Amsterdam ;Elsevier,2013. - xviii, 247 p. :ill. ;24 cm. - Elsevier insights. - Elsevier insights..

Includes bibliographical references (p. [243]-247).

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.

ISBN: 9780123983961 (electronic bk.)

LCCN: 2012285669Subjects--Topical Terms:

630901
Network analysis (Planning)

LC Class. No.: T57.85 / .T63 2013

Dewey Class. No.: 658.4032

Flow networks = analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks /
LDR:02824cmm a2200265 a 4500 001 1952146
005 20140629172528.0
008 150102s2013 ne a sb 000 0 eng d
010 $a 2012285669
020 $a 9780123983961 (electronic bk.)
020 $a 9780123983961
035 $a (OCoLC)ocn840485519
035 $a 14000172
040 $a IND $c IND $d BDX $d DLC
041 0 $a eng
042 $a lccopycat
050 4 $a T57.85 $b .T63 2013
082 0 4 $a 658.4032 $2 22
100 1 $a Todinov, M. T. $3 1641050
245 1 0 $a Flow networks $h [electronic resource] : $b analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks / $c Michael T. Todinov.
250 $a 1st ed.
260 $a Amsterdam ; $a Boston : $b Elsevier, $c 2013.
300 $a xviii, 247 p. : $b ill. ; $c 24 cm.
490 1 $a Elsevier insights
504 $a Includes bibliographical references (p. [243]-247).
520 $a 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.
650 0 $a Network analysis (Planning) $3 630901
650 0 $a Programming (Mathematics) $3 547124
830 0 $a Elsevier insights. $3 1306077
856 4 0 $u http://www.sciencedirect.com/science/book/9780123983961