Search results for Discrete Approaches for Optimal Routing of High Pressure...
Seller Image
Discrete Approaches for Optimal Routing of High Pressure Pipes
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9783737563734
Seller Image
Discrete Approaches for Optimal Routing of High Pressure Pipes
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Seller Inventory # 385607377
Buy New
£ 35.62
£ 42.36 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Discrete Approaches for Optimal Routing of High Pressure Pipes
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9783737563734