A thesis submitted in partial fulfillment of the thesis requirement for the degree of Master of Engineering, School of Engineering and Technology

Thesis (M.Eng.) - Asian Institute of Technology, 2003

Meshless methods have become very attractive and efficient for the development of adaptive methods for solving boundary value problems because nodes can be easily added and removed without a burdensome remeshing of element. The meshless local PetrovGalerkin method approach, based on the local symmetric weak form and the moving least squares approximation, is a truly numerical meshless method for solving boundary value problems. This work employs polygonal nodal sub-domains constructed from several triangular patches rather than the typically used circular sub-domains is presented. The moving least-squares approximation and lagrange interpolation functions are used as the trial function and test functions respectively. This method aims to decrease the error of solution but many parameters of MLPG have an effect to the accuracy of the numerical solution such as x and y coordinates of nodal points, radius of influence. The presence of many parameters and complex process for obtaining the solution make finding difficult or possibility to solve using traditional algorithms. GAs has emerged as an efficient technique in handling for many parameters and complex process for obtaining the solution of elastostatic 2D problem. GAs is a search optimal solution process which is set by objective functions. The objective function consists of the L2 norm of displacement error and the ratio between gauss integration points in problem domain with node have effect on this gauss point integration because aim of this work want to reduce computation time and increase accuracy.