Efficient Runner Networks for Investment Castings

Journal Article · Tue Jul 18 00:00:00 EDT 2000 · International Journal for Numerical Methods in Engineering

DOI:https://doi.org/10.1002/1097-0207(20000820)48:11<1601::AID-NME894>3.0.CO;2-0· OSTI ID:759963

GIVLER, RICHARD C ^[1]; SAYLORS, DAVID B

---

1. Sandia National Laboratories

We present a computational method that finds an efficient 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.

• Research Organization: Sandia National Labs., Albuquerque, NM (US); Sandia National Labs., Livermore, CA (US)
• Sponsoring Organization: US Department of Energy (US)
• DOE Contract Number: AC04-94AL85000
• OSTI ID: 759963
• Report Number(s): SAND2000-1758J
• Journal Information: International Journal for Numerical Methods in Engineering, Journal Name: International Journal for Numerical Methods in Engineering
• Country of Publication: United States
• Language: English

Related Subjects

36 MATERIALS SCIENCE
ALGORITHMS
CASTING
CASTINGS
COMBINATORIAL OPTIMIZATION
INVESTMENT
INVESTMENT CASTING
RUNNER NETWORK
SHORTEST PATHS