ScholarLens Back to search
1977•Unpublished venueRequires access

AUTOMATED PIPE ROUTING FOR MINIMUM COST

A. B. Cleveland, Sigrid Close

Open publisher page 2 citations

Abstract

A computer method is suggested for determining the optimum layout of piping systems. Using dynamic programming, the Authors have developed a program which will route small-scale piping systems for minimum material cost while satisfying various design requirements. Its use is demonstrated for a number of simple examples of two- and three-dimensional piping systems. Difficults yet to be overcome before the method can be used on a full-scale production basis are outlined, with suggestions for their removal. At present, the program as outlined can route piping only between two points, and cannot deal with branch lines.

About this research paper

What this paper is about

A computer method is suggested for determining the optimum layout of piping systems. Using dynamic programming, the Authors have developed a program which will route small-scale piping systems for minimum material cost while satisfying various design requirements. Its use is demonstrated for a number of simple examples of two- and three-dimensional piping systems. Difficults yet to be overcome before the method can be used on a full-scale production basis are outlined, with suggestions for their removal. At present, the program as outlined can route piping only between two points, and cannot deal with branch lines.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A computer method is suggested for determining the optimum layout of piping systems. Using dynamic programming, the Authors have developed a program which will route small-scale piping systems for minimum material cost while satisfying various design requirements. Its use is demonstrated for a number of simple examples of two- and three-dimensional piping systems. Difficults yet to be overcome before the method can be used on a full-scale production basis are outlined, with suggestions for their removal. At present, the program as outlined can route piping only between two points, and cannot deal with branch lines.

Key concepts: Piping, Routing (electronic design automation), Scale (ratio), Simple (philosophy), Production (economics), Computer science, Engineering, Reliability engineering

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
AUTOMATED PIPE ROUTING FOR MINIMUM COST — Research Paper | ScholarLens