Minimum-Trajectory Pipe Routing

Abstract

A dynamic programming method for routing pipe between two specified terminal points is developed and demonstrated. This method, modified to meet requirements of practical piping runs, could be an important contribution toward a totally computerized piping arrangement method.