The algorithm runs fast on the relatively simple geometries we have tried so far and the results from the computations seem very reasonable. Our system can of course not compete with the advanced commercial systems available from e.g. Moldflow, I-DEAS, and C-MOLD, since they offer a system for all stages in the design and not only, as we do, analyze the filling stage. However, some critical parameters can be investigated in a preliminary study by using our program. Further, the designers can, by using our program, gain a rough but very quick understanding of the problems in the mould design phase and thus hopefully avoid some later problems.
Recommendations for further study
Further investigations regarding execution time on more complex
geometries and the performance of alternative algorithms for solving
the WRP can be done. Methods for increasing the computational speed by
improving our algorithm are also available, currently we have not
found this to be urgent since the program is fast enough on the
geometries we have investigated so far.
Thermal effects like viscous heating and cooling from the mould can probably be incorporated in our method, but at the cost of a more complex algorithm. The question is then: how severe complications are necessary for having a meaningful thermal analysis? As usual, it will be a trade-off between simplicity and accuracy.
More systematic comparisons with results from both experiments and simulations using commercial or research packages are also recommended. Besides the well known commercial packages for possible comparisons, there are research programs written at several European universities. One example is Hele-Shaw Fill within the Diffpack project at SINTEF, Oslo, Norway.
It seems that only the biggest research centres have resources for really systematic investigations here. We have not had such big resources.
The most important improvement would anyhow be to develop a thermal calculation that does not destroy the simplicity of the distance model.
Peter Johansson (pejoh@mai.liu.se)