Nodal ordering using graph theory and a genetic algorithm

Authors:
H. A. Rahimi Bondarabady;A. Kaveh
Affiliations:
Unirersity of Yazd, Yazd Iran;Iran University of Science and Technoloqy, Tehran 16, Iran
Venue:
Finite Elements in Analysis and Design
Year:
2004

Citing 2
Cited 1

An Implementation of a Pseudoperipheral Node Finder

ACM Transactions on Mathematical Software (TOMS)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Optimal priority functions for profile reduction using ant colony optimization

Finite Elements in Analysis and Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, ordering is performed using graph theory for defining the node priority, as a function of vectors containing the graph properties. The coefficients corresponding to these vectors are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present approach.