Efficient runner networks for investment castings

We present a computational method that "nds an e$cient runner network for an investment casting, once the gate locations have been established. The method seeks to minimize a cost function that is based on total network volume. The runner segments are restricted to lie in the space not occupied by the part itself. The collection of algorithms has been coded in C and runner designs have been computed for several real parts, demonstrating substantial reductions in rigging volume