An efficient optimization procedure for tetrahedral meshes by chaos search algorithm

A simple and efficient local optimization-based procedure for node repositioning/smoothing of three-dimensional tetrahedral meshes is presented. The initial tetrahedral mesh is optimized with respect to a specified element shape measure by chaos search algorithm, which is very effective for the optimization problems with only a few design variables. Examples show that the presented smoothing procedure can provide favorable conditions for local transformation approach and the quality of mesh can be significantly improved by the combination of these two procedures with respect to a specified element shape measure. Meanwhile, several commonly used shape measures for tetrahedral element, which are considered to be equivalent in some weak sense over a long period of time, are briefly re-examined in this paper. Preliminary study indicates that using different measures to evaluate the change of element shape will probably lead to inconsistent result for both well shaped and poorly shaped elements. The proposed smoothing approach can be utilized as an appropriate and effective tool for evaluating element shape measures and their influence on mesh optimization process and optimal solution.

[1]  Gustavo C. Buscaglia,et al.  OPTIMIZATION STRATEGIES IN UNSTRUCTURED MESH GENERATION , 1996 .

[2]  M. Ortiz,et al.  Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation , 2000 .

[3]  Barry Joe,et al.  Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations , 1995, SIAM J. Sci. Comput..

[4]  George S. Dulikravich,et al.  Generation of computational grids using optimization , 1986 .

[5]  S. H. Lo,et al.  OPTIMIZATION OF TETRAHEDRAL MESHES BASED ON ELEMENT SHAPE MEASURES , 1997 .

[6]  Carl Ollivier-Gooch,et al.  Tetrahedral mesh improvement using swapping and smoothing , 1997 .

[7]  S. Lo.  Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach , 1991 .

[8]  L. Freitag,et al.  Local optimization-based simplicial mesh untangling and improvement. , 2000 .

[9]  Bing Li,et al.  Optimizing Complex Functions by Chaos Search , 1998, Cybern. Syst..

[10]  Carl Ollivier-Gooch,et al.  A Cost/Benefit Analysis of Simplicial Mesh Improvement Techniques as Measured by Solution Efficiency , 2000, Int. J. Comput. Geom. Appl..

[11]  Mark T. Jones,et al.  A Parallel Algorithm for Mesh Smoothing , 1999, SIAM J. Sci. Comput..

[12]  Jean-Yves Trépanier,et al.  An algorithm for the optimization of directionally stretched triangulations , 1994 .

[13]  K. Kondo,et al.  THREE‐DIMENSIONAL FINITE ELEMENT MESHING BY INCREMENTAL NODE INSERTION , 1996 .

[14]  Xu Hai.  Application of mutative scale chaos optimization algorithm in power plant units economic dispatch , 2000 .

[15]  D. A. Field.  Laplacian smoothing and Delaunay triangulations , 1988 .

[16]  B. Joe,et al.  Relationship between tetrahedron shape measures , 1994 .

[17]  Barry Joe,et al.  Delaunay versus max‐min solid angle triangulations for three‐dimensional mesh generation , 1991 .

[18]  S. Lo.  A NEW MESH GENERATION SCHEME FOR ARBITRARY PLANAR DOMAINS , 1985 .