Optimal design of metal forming die surfaces with evolution strategies

被引:43
作者
Schenk, O
Hillmann, M
机构
[1] Univ Basel, Dept Comp Sci, CH-4056 Basel, Switzerland
[2] AutoForm Engn Inc, CH-8005 Zurich, Switzerland
关键词
optimization; structural optimization; metal forming process; integrated evolution strategies; distributed computing; finite-element simulation;
D O I
10.1016/j.compstruc.2004.03.055
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A common characteristics in the simulation of automotive sheet metal forming processes is that nearly all die surfaces are manually created within conventional computer-aided design systems (CAD). The solutions produced using these CAD systems are undoubtedly valuable from the point of view of applicability in sheet metal forming practice. However, this approach is time consuming and most of the design time is spent within these CAD systems. This paper presents the development of a computer-based approach for the evolutionary automatic design (EAD) of geometry and process parameters for industrial metal forming processes. The main characteristics of the solution methodology are the use of evolution strategies within the optimizer, the use of sheet metal formability as objective functions and a parameterization of die surfaces. The results of a comparative study of our EAD die surface generation against conventional CAD die surface generation for a representative structural design problem show the efficiency of the former. It is observed that EAD often finds the region of the search space containing the global optimum, thus supporting engineers in practice with automatic generated sheet metal forming tools. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1695 / 1705
页数:11
相关论文
共 19 条
[1]   A fully asynchronous multifrontal solver using distributed dynamic scheduling [J].
Amestoy, PR ;
Duff, IS ;
L'Excellent, JY ;
Koster, J .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2001, 23 (01) :15-41
[2]  
ANDERHEGGEN E, 1992, P 1 EUR C NUM METH E
[3]  
ANDERHEGGEN E, 1991, VDI BER, V894, P894
[4]  
*AUT ENG INC, 2003, AUT FOR INCR REF MAN
[5]  
Back T., 1996, EVOLUTIONARY COMPUTA
[6]  
BATHE KJ, 1996, FINITE ELEMENT PROCE
[7]   The design and use of algorithms for permuting large entries to the diagonal of sparse matrices [J].
Duff, IS ;
Koster, J .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1999, 20 (04) :889-901
[8]   Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices [J].
Gupta, A .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2002, 24 (02) :529-552
[9]   Recent advances in direct methods for solving unsymmetric sparse systems of linear equations [J].
Gupta, A .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2002, 28 (03) :301-324
[10]  
HAMMEL U, 1997, IEEE T EVOLUTIONARY, V1, P3