Evolutionary Mesh Numbering: Preliminary Results - Archive ouverte HAL Access content directly
Conference Papers Year : 1998

Evolutionary Mesh Numbering: Preliminary Results

(1) , (1)


Mesh numbering is a critical issue in Finite Element Methods, as the computational cost of one analysis is highly dependent on the order of the nodes of the mesh. This paper presents some preliminary investigations on the problem of mesh numbering using Evolutionary Algorithms. Three conclusions can be drawn from these experiments. First, the results of the up-to-date method used in all FEM softwares (Gibb's method) can be consistently improved; second, none of the crossover operators tried so far (either general or problem specific) proved useful; third, though the general tendency in Evolutionary Computation seems to be the hybridization with other methods (deterministic or heuristic), none of the presented attempt did encounter any success yet. The good news, however, is that this algorithm allows an improvement over the standard heuristic method between 12% and 20% for both the 1545 and 5453-nodes meshes used as test-bed. Finally, some strange interaction between the selection scheme and the use of problem specific mutation operator was observed, which appeals for further investigation.
Fichier principal
Vignette du fichier
maillage.pdf (415.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00153379 , version 1 (11-06-2007)
inria-00153379 , version 2 (11-06-2007)


  • HAL Id : inria-00153379 , version 2
  • ARXIV : 0706.1410


Francis Sourd, Marc Schoenauer. Evolutionary Mesh Numbering: Preliminary Results. Adaptive Computing in Design and Manufacture, ACDM'98, Apr 1998, Plymouth, pp.137-150. ⟨inria-00153379v2⟩
210 View
182 Download



Gmail Facebook Twitter LinkedIn More