Articoli correlati a Discrete Approaches for Optimal Routing of High Pressure...
Risultati della ricerca per Discrete Approaches for Optimal Routing of High Pressure...
Immagini fornite dal venditore
Discrete Approaches for Optimal Routing of High Pressure Pipes
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The planning of a whole power plant involves diversified specializations in engineering and can take up to several years. Within the planning procedure the routing of the high pressure pipes transporting the hot steam from the main boiler to the steam turbines exerts a strong influence on efficiency of the power plant. The design of pipe routing is usually done by a specially trained and experienced engineer with the aid of CAE software. The starting point of the problem is given by a rough outline of the design space and specified points where steam is produced and expended. In addition to the routing, the placement of hangers has to be specified to hold the pipe in place and meet technical restrictions. Even with the help of engineering software the planning procedure often involves trial and error, which makes the design phase cumbersome - especially if unforeseen obstacles have to be incorporated in a late stage of the project. This thesis lays a first foundation of an algorithmic engineering aid to help speed up the routing of the pipe and suggest a placing for the hangers. After deriving a mixed-integer nonlinear model that captures all the problem's combinatorial and nonlinear aspects different approaches to tackle real-world instances are investigated. These include linear and convex reformulations, as well as a decomposition approach which is further improved by cutting planes. Moreover, hardness results are proven and real-world instances show the effectiveness of the different models and algorithms. 200 pp. Englisch. Codice articolo 9783737563734
Compra nuovo
EUR 40,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Discrete Approaches for Optimal Routing of High Pressure Pipes
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Codice articolo 385607377
Compra nuovo
EUR 40,00
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Discrete Approaches for Optimal Routing of High Pressure Pipes
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The planning of a whole power plant involves diversified specializations in engineering and can take up to several years. Within the planning procedure the routing of the high pressure pipes transporting the hot steam from the main boiler to the steam turbines exerts a strong influence on efficiency of the power plant. The design of pipe routing is usually done by a specially trained and experienced engineer with the aid of CAE software. The starting point of the problem is given by a rough outline of the design space and specified points where steam is produced and expended. In addition to the routing, the placement of hangers has to be specified to hold the pipe in place and meet technical restrictions. Even with the help of engineering software the planning procedure often involves trial and error, which makes the design phase cumbersome - especially if unforeseen obstacles have to be incorporated in a late stage of the project. This thesis lays a first foundation of an algorithmic engineering aid to help speed up the routing of the pipe and suggest a placing for the hangers. After deriving a mixed-integer nonlinear model that captures all the problem's combinatorial and nonlinear aspects different approaches to tackle real-world instances are investigated. These include linear and convex reformulations, as well as a decomposition approach which is further improved by cutting planes. Moreover, hardness results are proven and real-world instances show the effectiveness of the different models and algorithms. Codice articolo 9783737563734
Compra nuovo
EUR 40,00
Spedizione EUR 63,09
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili