\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Optimized Mesh-free Analysis for the Singularity Subtraction Technique of Linear Elastic Fracture Mechanics},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2021 2021-01-15 (revised: 49 Year 2021 15 January 2021)}
\def\TheID{10.34257/GJREIVOL21IS1PG23\makeatother }
\def\TheDate{2021 2021-01-15}
\title{Optimized Mesh-free Analysis for the Singularity Subtraction Technique of Linear Elastic Fracture Mechanics}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Tiago  Oliveira}

             \author[2]{Artur  Portela}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2020 Accepted: 3 January 2021 Published: 15 January 2021}

\maketitle


\begin{abstract}
        


In linear elastic fracture mechanics, the stress field is singular at the tip of a crack. Since the representation of this singularity in a numerical model raises considerable numerical difficulties, the paper uses a strategy that regularizes the elastic field, subtracting the singularity from the stress field, known as the singularity subtraction technique (SST). In this paper, the SST is implemented in a local mesh-free numerical model, coupled with modern optimization schemes, used for solving twodimensional problems of the linear elastic fracture mechanics.The mesh-free numerical model (ILMF) considers the approximation of the elastic field with moving least squares (MLS) and implements a reduced numerical integration. Since the ILMF model implements the singularity subtraction technique that performs a regularization of the stress field, the mesh-free analysis does not require a refined discretization to obtain accurate results and therefore, is a very efficient numerical analysis.

\end{abstract}


\keywords{local mesh-free, singularity subtraction technique, stress intensity factors and genetic algorithm.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\begin{textblock*}{10cm}(1.05cm,3cm)
{{\textit{CrossRef DOI of original article:}} \underline{10.34257/GJREIVOL21IS1PG23}}
\end{textblock*}\let\tabcellsep& 	 	 		 \par
In a linear elastic analysis, it is well known that, at the tip of a crack the stress field becomes infinite and thus, is singular. The strength of this singularity is measured by the SIF that is thus defined at the crack tip. The presence of the stress singularity in the numerical model raises considerable numerical difficulties, by virtue of the need of simultaneously representing the singular and the finite stresses in the numerical model. Instead of representing the stress singularity in the numerical model, Oliveira and Portela \hyperref[b26]{[26]} used an elegant strategy that subtracts the singularity from the elastic field which is known as the singularity subtraction technique (SST). Hence, the SST performs a regularization of the stress field, which introduces the SIF as primary unknowns of the numerical method used in the analysis. These two features, which are the analysis of the regularized stress field and the direct computation of SIF, make very efficient the SST solution strategy. The paper considers the SST, a very efficient and accurate technique for solving twodimensional problems of linear elastic fracture mechanics, as reported by Oliveira et al. \hyperref[b27]{[27]}, implemented in the ILMF mesh-free model of numerical analysis.\par
Mesh-free numerical methods eliminate the mesh of the discretization, an intrinsic feature of the finite element and finite difference numerical methods of the first-generation in computational mechanics. On the other hand, the development of the boundary element method, as a second-generation numerical method, was motivated by the reduction of the analysis dependency on the mesh discretization, I. Introduction used only on the boundary of the domain. Mesh-free methods are third-generation numerical methods which consider only a nodal discretization and completely overcome the difficulties posed by the mesh of the first and second-generation numerical methods in computational mechanics. This paper considers a domain mesh-free method of analysis, with the MLS approximation of the elastic field, coupled with a multi-objective optimization process that automatically generates optimal nodal arrangements of the mesh-free discretization, to compute the SIF of two-dimensional linear elastic fracture mechanics problems.\par
Thorough reviews of mesh-free methods and their applications in science and engineering were recently presented by Chen et al. \hyperref[b5]{[6]} and Huerta et al. \hyperref[b17]{[17]}. The most popular of local mesh-free methods is the MLPG method, presented by Atluri and Zhu \hyperref[b1]{[2]} to Atluri and Shen \hyperref[b0]{[1]}, which implements the MLS approximation. Other local mesh-free methods of reference are the LPIM method, see Liu and Gu \hyperref[b21]{[21]} and the LRPIM method, see Liu et al. \hyperref[b22]{[22]}. The ILMF linearly integrated local mesh-free method, presented by Oliveira et al. \hyperref[b27]{[27]}, performs a linear reduced integration, which leads to an increase of the solution accuracy with high efficiency.\par
Until now, the discretization process of local mesh-free methods has been heuristically implemented, which requires an expensive and time consuming calibration of the nodal arrangements or parameters of the discretization that refer to the size of the compact supports and the size of the integration domain of each node. This is a huge drawback since the definition of these discretization parameters is not unique and therefore cannot be easily implemented into an automatic process.\par
Some researchers tried to overcome the drawback of heuristically defined meshfree discretization parameters, as is the case of Baradaran and Mahmoodabadi \hyperref[b3]{[4]}, Bagheri et al. \hyperref[b2]{[3]} and Ebrahimnejad et al. \hyperref[b12]{[12]}. The successful attempts of these authors required an analytical solution to be performed and therefore their modeling process is not efficient. Recently, Santana et al. \hyperref[b30]{[31]} and Oliveira and Portela \hyperref[b26]{[26]}, presented a strategy that performs the optimization of the size of compact supports and the size of the local integration domain of given mesh-free nodal distributions.\par
Thus, there is room for the alternative modeling strategy of this paper, that is the automatic generation of optimal mesh-free parameters and nodal discretization, through an optimization process that completely overcomes the issues of the heuristic process of discretization. As a consequence, the modeling strategy of this paper ensures robustness, accuracy and efficiency of the analysis, features required to be able to make reliable statements in the high fidelity modeling of engineering applications.\par
The use of optimization has been applied in many different areas, such as elastostatics, see Denk et al. \hyperref[b9]{[10]}, Proos et al. \hyperref[b37]{[29]} and Zolfagharian et al. \hyperref[b36]{[37]}, heat conduction, see Dede \hyperref[b7]{[8]}, Denk et al. \hyperref[b11]{[11]}, Gersborg-Hansen et al. \hyperref[b14]{[14]} and Kim et al. \hyperref[b20]{[20]}, fluid mechanics, see Dede et al. \hyperref[b8]{[9]}, electrostatics, see Gupta et al. \hyperref[b15]{[15]}, or structural dynamics, see  {\ref Kim et al. [20]} and Proos et al. \hyperref[b37]{[29]}.\par
The field of optimization is expansive, and the choice of a suitable algorithm is highly problem dependent, as reported by Zingg et al. \hyperref[b35]{[36]}. The No free lunch theorems for optimization, presented by Wolpert and Macready \hyperref[b34]{[35]}, suggests that different algorithms are better than others for particular classes of problems. The multi-objective optimization of mesh-free numerical models deals with two main difficulties. The first one concerns the number of optimal solutions, generated by competing goals, instead of a single optimal solution. The second difficulty regards the large and complex search space that cannot be dealt with classic optimization methods. Consequently, to overcome these difficulties, non-gradient methods of optimization must be used, instead of classic methods. Evolutionary algorithms are non-gradient methods, quite robust in locating the global optimum, that do not require continuity or predictability over the design space. This paper considers the use of evolutionary genetic algorithms (GA), for the multi-objective optimization of nodal arrangements of the mesh-free discretization. GA perform a search and optimization procedure motivated by the principles of natural genetics and natural selection, originally proposed by Holland \hyperref[b16]{[16]}. They are a robust and flexible approach that can be applied to a wide range of optimization problems, as as reported for instance by Kelner and Leonard \hyperref[b19]{[19]}, McCall \hyperref[b23]{[23]} and Ebrahimnejad et al. \hyperref[b12]{[12]}.\par
The paper organization is as follows. The modeling of the structural body and the local mesh-free method is presented in Section 2 that is followed by the implementation of the SST in the mesh-free formulation, presented in Section 3. Section 4 presents the multi-objective optimization implementation and algorithm formulation. Numerical results, obtained for benchmark problems, in order to illustrate the accuracy, efficiency and robustness of the strategies adopted in this work, are presented in Section 5. Finally, the concluding remarks are presented in Section 6.\par
The local mesh-free numerical analysis of the structural body is carried out by the ILMF model presented by Oliveira et al. \hyperref[b27]{[27]}. It is defined in a body with domain ? and boundary Î?" = Î?" u ? Î?" t , with constrained displacements u prescribed on the kinematic boundary Î?" u and loaded by an external system of distributed surface and body forces, with densities represented respectively by t, applied on the static boundary Î?" t , and b, applied in ?, as Figure 1 schematically represents. Assign to Mesh-free discretization of a body with domain ? and boundary Î?" = Î?" u ? Î?" t ; ? P , ? Q and ? R are local domains assigned to reference nodes P , Q and R; The work theorem is used to formulate the ILMF model. The mechanical equilibrium of the local domain ? Q can be defined through the rigid-body kinematic formulation of the work theorem, as presented by Oliveira et al. \hyperref[b27]{[27]}, which is II. Mesh-free Modeling of the Structural Body written, in the case of no body forces, as? Q has boundary Î?" Q = Î?" Qi ? Î?" Qt ? Î?" Qu , in which Î?" Qi is the interior local boundary and Î?" Qt ? Î?" t and Î?" Qu ? Î?" u . point Q an arbitrary local domain ? Q , such that Q ? ? Q ? ? ? Î?", with boundary Î?" Q = Î?" Qi ? Î?" Qt ? Î?" Qu ,Î?" Q ?Î?" Qt t dÎ?" = ? Î?" Qt t dÎ?" (1)\par
and describes the equilibrium of boundary tractions in ? Q . This equation, used to generate the stiffness matrix of each node of a mesh-free discretization, is integrated by Gauss quadrature. Finally, in order to allow for a unique solution of the elastic field, displacement boundary conditions must be enforced, on the kinematic boundary Î?" u , asu = u. (\textbf{2})\par
Since ILMF is a local model, each node of the discretization has assigned its local integration domain, as schematically represented in Figure 1, which has rectangular or circular shape, as Figure 2 schematically represents. Whenever a linear q (a) Rectangular q (b) Circular Schematic representation of local integration domains, with 1 integration point per boundary, or quadrant, of the local domain, for the computation of local equilibrium equations. variation of tractions is defined, along each segment of the boundary of the local domain, equilibrium equations (1) can be exactly evaluated with 1 integration point, centered on each segment of the local boundary, as represented in Figure 2, which leads to a point-wise discrete form of mechanical equilibrium, represented byL i n i n i j=1 t x j = ? L t n t nt k=1 t x k ,\textbf{(3)}\par
where the number of integration points, or segments, defined on, respectively the interior boundary Î?" Qi = Î?" Q ? Î?" Qt ? Î?" Qu , of length L i , and the static boundary Î?" Qt , of length L t , are denoted, respectively by n i and n t . The MLS approximation of variables is used with the ILMF model. Therefore, traction components are evaluated in terms of the unknown nodal parameters û and thus, equations (1) lead to the system of algebraic equations of the order 2 × 2n (n is the number of nodes of the influence domain of the reference node Q), given byÎ?" Q ?Î?" Qt nDB dÎ?" û = ? Î?" Qt t dÎ?"\textbf{(4)}\par
represented by in which K Q is the stiffness matrixK Q û = F Q ,\textbf{(5)}K Q = Î?" Q ?Î?" Qt nDB dÎ?" (6)\par
and F Q is the vector of forcesF Q = ? Î?" Qt t dÎ?".\textbf{(7)}\par
For a nodal arrangement with N nodes, in which M are interior and static-boundary nodes, the assembly of equations ( \hyperref[formula_6]{5}) leads to the system of equations of the order2M × 2N K û = F.\textbf{(8)}\par
The remaining algebraic equations are generated from the N ? M kinematicboundary nodes, through the direct interpolation of the boundary condition (2) prescribed asu k = ? k û = u k ,\textbf{(9)}\par
with k = 1, 2, where u k is the constrained displacement component. Equations ( \hyperref[formula_10]{9}) are directly assembled into the global system \hyperref[b7]{(8)}.\par
For each node of a local mesh-free discretization there are two key parameters, respectively the size r ?s of the compact support ? s and the size r ?q of the local integration domain ? q that strongly affect the performance of the solution. For a generic node i, these parameters are defined through arbitrary constants, ? s and ? q , respectively as r ?s = ? s c i \hyperref[b9]{(10)} andr ?q = ? q c i ,\textbf{(11)}\par
in which c i is the distance of the node i to the nearest neighboring node. Equations \hyperref[b9]{(10)} and \hyperref[b11]{(11)} show that the accuracy of a mesh free numerical application can be controlled through a proper specification of the discretization parameters ? s and ? q .\par
It is important to enhance the different roles that these parameters play, in any numerical application. The size of the influence domain of a point, determined by the size of the compact support of each node, completely defines the number of nodes used to build MLS shape functions of that point. Consequently, the parameter ? s , sometimes referred to as MLS discretization parameter, is primarily linked to the accuracy of the numerical application. On the other hand, since the integration domain of each node is used to compute the respective nodal stiffness matrix, it must be entirely defined within the domain of the body, without intersecting the respective boundary. Consequently, the parameter ? q , sometimes referred to as the local domain parameter, is linked primarily to the efficiency of the application.\par
Until now, these parameters have been heuristically defined with values that depend on the pattern of the nodal distribution of each mesh-free application. When changes are made to the nodal distribution of a problem, these parameters also change, becoming an interactive process. In general, they have been considered in the range, respectively of ? s > 1.0 and ? q < 1.0, as reported by Oliveira et al. \hyperref[b27]{[27]}. In this paper, the appropriate values of ? s , ? q and the nodal distribution of nodes are obtained automatically, through a multi-objective optimization process.\par
To overcome difficulties raised by the presence of unbounded stress in the numerical method, an alternative strategy which considers the subtraction of singularities from the original elastic field is used. The leading feature of this formulation is the regularization the elastic field, through the subtraction of the crack tip singularity from the original elastic field, which introduces the SIF as additional primary unknowns of the regularized numerical model.\par
In the linear elastic fracture mechanics, the stress field is singular at a crack tip and therefore, it is convenient to modify the original problem before its solution by the ILMF numerical model. As the linear behavior allows the principle of superposition, the elastic field can be decomposed into a regular (R) and a singular (S) component as? ij = (? ij ? ? S ij ) + ? S ij = ? R ij + ? S ij\textbf{(12)}\par
andu i = (u i ? u S i ) + u S i = u R i + u S i ,\textbf{(13)}\par
where ? R ij = ? ij ?? S ij and u R i = u i ?u S i represent the regular parts, respectively of the stress and displacement of the initial problem; ? S ij and u S i denote, respectively the stress and displacement of a particular solution, of the initial problem, which represent the singular field. When suitable functions are used for the particular singular field, equations ( \hyperref[formula_12]{12}) and ( \hyperref[formula_13]{13}) regularize the initial problem, since the stress ? R ij become non-singular. With this regularization, the analysis of the initial problem can be performed with the regular elastic field only, since the components ? S ij and u S i automatically satisfy the field equations identically, because they represent a particular solution of the initial problem. Therefore, the elasticity equations are written asL T ? R = 0 (14) ? R = L u R (15) ? R = D ? R\textbf{(16)}\par
in domain ?, with boundary conditionsu R = u ? u S on Î?" u (\textbf{17}) and t R = t ? t S on Î?" t .\textbf{(18)}\par
Note that the boundary conditions ( \hyperref[formula_15]{17}) and ( \hyperref[formula_16]{18}) include additional terms, respectively u S and t S , components of a singular particular solution of the initial problem.\par
Components ? S ij and u S i of the particular solution, used in equations ( \hyperref[formula_12]{12}) and ( \hyperref[formula_13]{13}), represent the singular field around the crack tip, which can be defined through the first term of the William's \hyperref[b33]{[34]} eigen-expansion, derived for a semi-infinite edge crack. The stress components areIII. The Singularity Subtraction Technique -SST a) Regularized Elastic Field b) William's Singular Solution ? S 11 = K I ? 2?r cos ? 2 1 ? sin ? 2 sin 3? 2 + K II ? 2?r sin ? 2 2 + cos ? 2 cos 3? 2 ,\textbf{(19)}? S 22 = K I ? 2?r cos ? 2 1 + sin ? 2 sin 3? 2 ? K II ? 2?r sin ? 2 cos ? 2 cos 3? 2\textbf{(20)}\par
and? S 12 = K I ? 2?r cos ? 2 sin ? 2 cos 3? 2 + K II ? 2?r cos ? 2 1 ? sin ? 2 sin 3? 2\textbf{(21)}\par
and the displacements areu S 1 = K I 4µ r 2? (2? ? 1) cos ? 2 ? cos 3? 2 + + K II 4µ r 2? (2? + 3) sin ? 2 + sin 3? 2\textbf{(22)}\par
andu S 2 = K I 4µ r 2? (2? + 1) sin ? 2 ? sin 3? 2 + + K II 4µ r 2? (2? ? 3) cos ? 2 + cos 3? 2 ,\textbf{(23)}\par
where K I and K II represent the SIF, respectively of the opening and sliding modes; the constant ? = 3 ? 4? is defined for plain strain and ? = (3 ? ?)/(1 + ?) for plain stress, in which ? is Poisson's ratio; the constant µ is the shear modulus. A polar coordinate reference system (r, ?), centered at the crack tip, is defined such that ? = 0 is the crack axis, ahead of the crack tip. Note that the order r ?1/2 of the stress field becomes singular when r tends to zero. Caicedo and Portela \hyperref[b4]{[5]} demonstrated that the first term of the William's eigen-expansion, derived for an edge crack, can also be used to represent the elastic field around the crack-tip, for the case of internal piecewise-flat multi-cracked finite plates, under mixed-mode deformation. At a boundary point, the singular stress components, of equations ( \hyperref[formula_17]{19}) to \hyperref[b21]{(21)}, are used in the definition of traction components ast S = t S 1 t S 2 = ? S 11 ? S 21 ? S 12 ? S 22 n 1 n 2 = g 11 g 12 g 21 g 22 K I K II = g k,\textbf{(24)}\par
where n i refers to the i-th component of the unit normal to the boundary, outwardly directed; functions g ij = g ij (r ?1/2 , ?) were introduced for a simple notation of equations ( \hyperref[formula_17]{19}) to \hyperref[b21]{(21)} and the vector k contains the SIF components.\par
The displacement field, of equations ( \hyperref[formula_20]{22}) and \hyperref[b23]{(23)}, can be similarly defined in a vector form asu S = u S 1 u S 2 = f 11 f 12 f 21 f 22 K I K II = f k,\textbf{(25)}\par
where functions f ij = f ij (r 1/2 , ?) are a simple notation of equations ( \hyperref[formula_20]{22}) and \hyperref[b23]{(23)}. An approximate solution of the regularized problem, equations (  {\ref 14}) to ( \hyperref[formula_14]{16}) with boundary conditions ( \hyperref[formula_15]{17}) and ( \hyperref[formula_16]{18}), obtained with the ILMF numerical model, is now considered. The equilibrium equations (1), of the domain ? Q associated with the nodeQ ? ? Q ? Î?" Q , are now rewritten as Î?" Q ?Î?" Qt t R dÎ?" = ? Î?" Qt t ? t S dÎ?",\textbf{(26)}\par
in which the static boundary conditions \hyperref[b18]{(18)}, of the regularized problem, are considered. For a linear reduced integration, along each boundary segment of the local domain, equation ( \hyperref[formula_24]{26}) simply leads toL i n i n i j=1 t R x j = ? L t n t nt k=1 t x k + Î?" Qt t S dÎ?",\textbf{(27)}\par
in which n i and n t denote the total number of integration points, or boundary segments, defined on, respectively the interior local boundary  \hyperref[formula_25]{27}) is done with the MLS approximation, see Oliveira et al. \hyperref[b25]{[25]}, in terms of the unknown nodal parameters ûR , which leads to the system of two linear algebraic equationsÎ?" Qi = Î?" Q ? Î?" Qt ? Î?" Qu ,L i n i n i j=1 n x j DB x j ûR = ? L t n t nt k=1 t x k + Î?" Qt g dÎ?" k\textbf{(28)}\par
that can be written asK Q ûR + G Q k = F Q ,\textbf{(29)}\par
in which the stiffness matrix K Q , of the order 2 × 2n (n is the number of nodes included in the influence domain of the node Q) is given byK Q = L i n i n i j=1 n x j DB x j ,\textbf{(30)}\par
matrix G Q , of the order 2 × 2, computed from equations \hyperref[b24]{(24)}, is given byG Q = ? Î?" Qt g dÎ?"\textbf{(31)}\par
and F Q is the force vector given byF Q = ? L t n t nt k=1 t x k . (\textbf{32})\par
Note that, in the case of an interior node, matrix G Q and vector F Q are null. For a problem with N nodes, the assembly of equations equations ( \hyperref[formula_28]{29}) for all M interior and static-boundary nodes generates the global system of 2M ×(2N +2) equations The N ? M kinematic-boundary nodes, are used to generate the remaining equations of the discretization, implementing the kinematic boundary conditions of the regularized problem, equations \hyperref[b17]{(17)}. Thus, for a kinematic-boundary node, the boundary conditions of the regularized problem are enforced by a direct interpolation method asK ûR + G k = F.\textbf{(33}u R k = ? k ûR = u k ? u S k = u k ? f k k,\textbf{(34)}\par
with k = 1, 2, where u k denotes the specified displacement component and u S k = f k k is the displacement component of the singular solution, obtained from equations \hyperref[b25]{(25)}. For the sake of simplicity, equations \hyperref[b33]{(34)} are written in the same form of equations ( \hyperref[formula_28]{29}), for a point Q, asK Q k ûR + G Q k k = F Q k ,\textbf{(35)}\par
in which \hyperref[formula_35]{35}) are assembled into the global system of equations ( \hyperref[formula_33]{33}) which, after this operation, is written asK Q k = ? k , while G Q k = f k and F Q k = u k . Local equations (K G ûR k = F ,\textbf{(36)}\par
in which K is a matrix of the order 2N × 2N , G is a matrix of the order 2N × 2 and F is a vector of the order 2N ; the unknowns are the vector ûR , of the order 2N , and the vector k of the order 2. Note that this global system of equations introduce the SIF K I and K II , in the vector k, as additional unknowns of the numerical method. Therefore, to have a well-posed problem, with a unique solution, it is necessary to specify additional constraint equations, one for each mode of deformation considered in the analysis. These additional constraint equations can be specified in two additional bottom rows in the system of equations \hyperref[b35]{(36)}.\par
The required additional constraints enforce the singularity cancellation in the regularized problem and can be implemented by the cancellation of the regular regular stress components, as? R ij = 0 ? ? ij = ? S ij\textbf{(37)}\par
which ensure that, at the crack tip, the initial problem is singular. In order to be effective, the additional constraints must be defined in terms of the unknown regularized nodal parameters of ûR . Conditions (37) can be redefined, in terms of the respective traction components at the crack tip, ast R j = ? R ij n i = 0 ? t j = t S j ,\textbf{(38)}\par
where n i denotes the unit normal components of the crack faces. After the MLS approximation, conditions (38), defined at the crack tip x tip , are written ast R x tip = n x tip D B x tip ûR = 0,\textbf{(39)}\par
orC ûR = 0,\textbf{(40)}\par
in which matrix C = n x tip D B x tip and can now be included in the global system of equations \hyperref[b35]{(36)}, leading to the final system of equations of the order(2N + 2) × (2N + 2) K G C 0 ûR k = F 0 ,\textbf{(41)} 
\section[{Additional Constraints d)}]{Additional Constraints d)}\par
which represents a generalized saddle point problem that can be solved, since the stiffness matrix K, of the ILMF local mesh free model is always non singular, with very low condition numbers, as reported by Oliveira and Portela \hyperref[b26]{[26]}.\par
The optimization literature contains the basic concepts and terminology required to carry out the optimization process presented in this work, here formally represented by Sawaragi et al. \hyperref[b31]{[32]}, Hwang and Masud \hyperref[b18]{[18]}, Ringuest \hyperref[b29]{[30]} and Steuer \hyperref[b32]{[33]}.\par
Multi-objective optimization of the mesh-free model is carried out through an automated procedure that modifies the design or decision variables which are the mesh-free discretization parameters and the nodal distribution. Hence, the optimization process incrementally updates the design variables, carries out a meshfree numerical analysis of the updated model and scans the results of each increment to check if an optimized solution has been reached. In this process, the objective functions define the goal of the optimization, while constraints keep within bounds the value of a design response. The goal of the optimization aims to minimize the objective functions by finding feasible solutions, which are arrangements of mesh-free discretization satisfying the constraints of the problem. It is important to note that the optimizer never deals with solution errors of the generated arrangements of the mesh-free model. Genetic Algorithm (GA) belongs to a class of evolutionary algorithms, defined as a non-derivative global search heuristic, motivated by the principles of natural genetics and natural selection, presented by Holland \hyperref[b16]{[16]}. GA is an optimization technique that can be applied to a wide range of problems, as seen in Kelner and Leonard \hyperref[b19]{[19]} and McCall \hyperref[b23]{[23]}, and can also be applied to mesh-free methods, as seen in Bagheri et al. \hyperref[b2]{[3]} and Ebrahimnejad et al. \hyperref[b12]{[12]}.\par
The GA keep a population of P(t) individuals, for generation t. Each of these individuals contain a potential solution to the posed problem that need to be evaluated and its fitness measured. Some of these individuals are randomly selected to undergo a stochastic transformation and become new individuals (genetic operation). Likewise natural genetics, this transformation can be a mutation, which creates new individuals by making changes in a single individual, or crossover, which creates new individuals by combining parts from two others. The offspring from this process, the new individuals C(t), are evaluated and its fitness measured. A new population is created after selecting the more fit individuals from the parent and the offspring population. In the end, after several generations, the algorithm converges to the best individual, which is a possible optimal or sub-optimal solution to the problem, as stated by Gen and Cheng \hyperref[b13]{[13]}.\par
The genetic algorithm components need to be carefully addressed in order to provide a good search space and exploit the best solution. A good balance between exploration and exploitation is a must for complex and real-world problems.\par
In a mesh-free discretization, the size of the compact support, where nodal shape functions are defined, and the size of the domain of integration, where the nodal stiffness matrix of the numerical model is computed, must be conveniently defined in any application, since their values strongly affect the performance of the numerical solution. Therefore, the values of the size of the compact support and the values of the size of the local integration domain, are optimized in this paper. They are IV. Multi-Objective Optimization of the Mesh-free Model defined, respectively in Equations (  {\ref 10}) and \hyperref[b11]{(11)} which show that the accuracy of a mesh-free numerical application can be controlled through a proper specification of the discretization parameters ? s and ? q . Therefore, parameters ? s and ? q are both set as design variables of the multi-objective optimization process, in order to be automatically defined with optimal values. Additionally, in order to facilitate and automate the pre-processing phase of the mesh-free modeling, the nodal distribution need to be addressed. Therefore, for a bi-dimensional problem, the number of divisions in x and y direction are chosen as design variables. When the number of divisions in both directions are provided, the mesh-free numerical model, can define the nodal coordinates and distribute the nodes along the problem domain and boundary, including crack nodes. For this case, only regular nodal distributions are considered.\par
The use of efficient objective functions condition the overall performance of the multi-objective optimization process. The objective functions force, through meshfree numerical simulation, the minimum total mechanical energy of the structure and the conditioning of the final system of algebraic equations which, consequently enforce the solution accuracy of the mesh-free model. Note that solution errors of the mesh-free model are not included in any of the objective functions which, therefore are quite general and do not depend on any analytical solution.\par
The standing challenge in the application of numerical simulations in the optimization process is the accurate evaluation of objective functions which obviously is dependent upon the automatically generated mesh-free discretization. Since multiple iterations are required during the optimization process, it is necessary to maintain a balance between efficiency and accuracy through constraints of the design variables.\par
The definition of this objective function results from the features of the parameter ? s in combination with ? q . Considering a body with the actual elastic field in any state, the strain energy U , and the potential energy P , of external forces, respectively given byU = ? 1 2 ? T ? d?\textbf{(42)}\par
andP = ? Î?"t t T u dÎ?",\textbf{(43)}\par
can be used to obtain the total potential energy T . The work theorem, when applied to the global domain of the body, for the actual elastic field settled in the body, leads to P = ?2U and therefore T = ?U , as well as T = P/2. These results show that the minimum value of the total potential energy of the body corresponds to a minimum value of the potential energy P or a maximum value of the strain energy U . The energy can be measure both by strain energy U or potential energy P , although evaluation of U is computationally more expensive, since requires the computation of the stress field for all nodal values and derivatives of shape functions. Therefore, the potential energy P is used instead, since it requires the evaluation of displacement fields only at static boundary nodes, the ones with no-null ap- plied loads, and does not require the computation of derivatives of shape functions, which is computationally efficient in comparison.\par
Hence, the objective function can be defined with the structural compliance C,as C = 1 2 Î?"t t T u dÎ?" = ? 1 2 P.\textbf{(44)}\par
Consequently, the minimum value of the potential energy P corresponds to a maximum value of ?C that is equivalent to a minimum value of C.\par
The numerical problem optimization aims to minimize the objective function using the mesh-free numerical model, by finding optimum values for the design variables, in this case the geometrical parameters ? s , ? q and the nodal distribution, also satisfying the problem constraints.\par
The mathematical formulation of the multi-objective optimization scheme for linear elastic fracture mechanics problems is as follows minimize C(? s , ? q , n x , n y )\par
CPU time(? s , ? q , n x , n y )subject to e(? s ) = ? s min ? ? s ? ? s max e(? q ) = ? q min ? ? q ? ? q max e(n x ) = n x min ? n x ? n x max e(n y ) = n y min ? n y ? n y max\par
where ? s = (? s1 , ? s2 , ..., ? sn ) ? ? s ? q = (? q 1 , ? q 2 , ..., ? q n ) ? ? q n x = (n x1 , n x2 , ..., n xn ) ? (x)n y = (n y 1 , n y 2 , ..., n y n ) ? (y) ,\textbf{(45)}\par
in which C is the structural compliance, CPU time is the time required to generate and solve the global system of algebraic equations; ? s min /? q min and ? s max /? q max denote the minimum and the maximum allowable limits for the mesh free discretization parameters ? s and ? q , respectively. n min /n max denote the minimum and the maximum geometrical values for the number of divisions on both directions (x and y), limited by the geometrical constraint of the problem, for a regular nodal discretization of the posed problem. Therefore, the variable n also determine the total number of nodes for the problem and node coordinates, automatically defined for a regular nodal distribution. On this multi-objective optimization, the fitness function, that is the routine containing the mesh-free algorithm, define scalar values for ? s , ? q , n x and n y , yielding different objective function outputs. Since there are two objective functions, the Pareto front will be the final result of the optimization, which will provide non-dominant solutions.\par
The ILMF is the only mesh free method implemented in this paper, but this process can be easily applied to any desired local mesh free method. The whole optimization process is summarized in the flowchart presented in Figure 3. This section presents numerical results to demonstrate the accuracy and efficiency of the mesh-free numerical method with optimization, through different linear fracture mechanics problems previously presented by Oliveira and Portela \hyperref[b26]{[26]}. 
\section[{d) Algorithm Formulation}]{d) Algorithm Formulation} 
\section[{V. Numerical Results}]{V. Numerical Results}\par
For a regular mesh-free discretization of n x x n y nodes, the size of the local support ? s and the size of the local integration domain ? q , are respectively parameters ? s and ? q . Good results can be obtained with a mesh-free model if r ?s , r ?q and the arrangement of nodes are properly refined.\par
Usually, these parameters and the nodal distribution are heuristically defined. One key advantage of the ILMF modeling process is that it can provide appropriate Flowchart of the multi-objective optimization scheme for mesh-free numerical methods. values for ? s and ? q using genetic algorithms, as initially presented by Santana et al. \hyperref[b30]{[31]}, which greatly improves the model accuracy. Additionally, this work also optimize the nodal distribution, resulting in a fully automated optimization routine for the entire pre-processing phase of traditional numerical methods, which is the definition of the mesh.\par
Three cases of edge-cracked square plates, respectively under mode-I, mode-II and mixed-mode deformation are considered.\par
The discontinuity generated by the presence of the crack requires a special treatment in order to be carried out in this non-convex domain. Therefore, the crack faces are modeled with two lines of overlapping nodes, where the MLS approximation is acting only in their respective influence size, while the crack tip is modeled with one node that can influence both sides of the crack. The visibility criterion is implemented around the crack during the definition of the compact support of each node. Hence, the compact support and the local integration domain of each node of the crack faces are defined as in the case of a traction-free boundary node.\par
The size of the local integration domain of the crack tip node is defined as ? k = ? q /2, to ensure the local aspect of the discretization of the crack. The computation of matrices g and f , of the Williams' singular solution at each crack tip is carried out with Gaussian quadrature, with a single integration point.\par
The results obtained with the ILMF using the multi-objective optimization are compared with the results originally obtained by Oliveira and Portela \hyperref[b26]{[26]}, without optimization, and by Portela and Aliabadi \hyperref[b28]{[28]}, using the DBEM with the J-integral (J-DBEM) technique, which proved to be a very accurate method. The DBEM modeling strategy considers piecewise-straight cracks which are discretized with straight discontinuous quadratic boundary elements. Continuous quadratic boundary elements are used along the remaining boundaries of the problem, except at the intersection between a crack and an edge, where semi-discontinuous boundary elements are used on the edge. Self-point discontinuous boundary elements are integrated analytically, while Gaussian quadrature, with sub-element integration, is carried out for the remaining integrations.\par
The GA is set to minimize the Compliance C and CPU time or computational effort, chosen as objective functions for this optimization process. The design variables of the optimization, the number of nodes and the node coordinate are defined within the problem geometry, and the parameters ? s = 1.5 ? 10 and ? q = 0.1 ? 0.9, are defined as continuous in the intervals. Only the major computational cost that is the cost of generating and solving the global system of algebraic equations, was measured.\par
On this optimization scheme, the initial population is randomly generated according to the predefined population size of 25 individuals. Then, the fitness function is calculated for each member of the population and scaled using a rank process, which is used later in the selection process. The reproduction operator is implemented based on a tournament selection. Both mutation and crossover are constraint dependent. The genetic algorithm described above generates a stochastic values sequence of design variables which are evaluated through the objective functions. Finally, the optimization process is terminated if the number of generations exceeds the predefined maximum number, which is selected as 150 in this scheme, or if the average change in fitness function is less than 1 × 10 ?6 . The improved accuracy of the optimization process can be clearly seen on this benchmark problem, regardless of the loading.\par
A square edge-cracked plate, represented in Figure 4, is considered for the first analysis. The plate, with crack length a, width w and height h = w/2, is loadeda W 2 / W 2 / W\par
Square plate with a single edge crack under mode-I loading (h/w = 0.5). by a uniform traction t = ?, applied symmetrically at the ends. All the results presented are for h/w = 0.5, to be compared with the highly accurate values introduced by Civelek and Erdogan \hyperref[b6]{[7]}. Therefore, five cases were considered, with a/w = 0.2, 0.3, 0.4, 0.5 and 0.6.\par
The ILMF model was applied with rectangular local domains of integration, with discretization parameters and nodal configuration automatically defined though GA optimization. The MLS approximation considered a first-order polynomial basis with quartic spline weighting function. It is important to highlight that all nodal distributions were performed without considering any refinement of the discretization around the crack tip, always with regular distributions.\par
Figure 5 show the Pareto front obtained from the optimization process, containing all feasible solutions for the posed problem. From the frontier solutions, The multi-objective Pareto front of the square plate with a single edge crack under mode-I loading, for a/w = 0.5; ILMF with the automatic parameters optimization routine. a set of solutions were selected and the results presented in Figure 6 and Table  {\ref 1}; where it can be seen that the optimization lead to accurate results for all points The multi-objective Pareto front results of selected feasible solutions for the square plate with a single edge crack under mode-I loading, for a/w = 0.5. in the Pareto front, with minimum values for compliance and SIF close to reference values. For this case, ? s greatly varies depending on the nodal distribution, but the best values for ? q are usually closer to 0.5. Table  {\ref 2} show the results obtained for different a/w, where ILMF represents the values obtained in Oliveira and Portela \hyperref[b26]{[26]}, ILMF + represents the values presented in this work using the optimization routine, Portela and Aliabadi \hyperref[b28]{[28]} represents the values obtained with Table  {\ref 1}: The multi-objective Pareto front of selected feasible solutions for a square plate with a single edge crack under mode-I loading (a/w = 0.5). 
\section[{i. Mode-I Loading}]{i. Mode-I Loading}Index\par
Square plate with a single edge crack under mode-I loading.K I /(t ? ?a)\par
\% Error a/w ILMF ILMF + J-DBEM \hyperref[b28]{[28]} Reference \hyperref[b6]{[7]} ILMF + J-DBEM 0.2 1.520  \hyperref[b6]{[7]}. In this analysis, the SIF values of the mode-II are always below 10 ?7 , since this is a mode-I loading crack problem.\par
The results highlight the accuracy of ILMF, which was further improved after the optimization process, always very close to reference values and J-DBEM. Even for similar nodal distributions as originally conceived, like index 1 of the Pareto front of selected solutions, the optimization of ? s was enough to improve the overall accuracy. The nodal distribution obtained by the GA optimization scheme and the respective deformed configuration of the plate is schematically represented in Figures 7 and 8. Regular nodal distribution resulting from the optimization scheme, with a regular nodal distribution of 20 × 18 = 360 nodes and additional overlapping nodes on the crack faces, for a/w = 0.5, under mode-II loading. The red line represents the crack faces. 
\section[{Table 2:}]{Table 2:}\par
A square edge-cracked plate, with ratio between the height and the width of the plate as h/w = 0.5, schematically represented in Figure 9, is considered for this analysis.\par
The plate is loaded with a uniform traction t, parallel to the crack of length a and is applied anti-symmetrically on the sides which corresponds to a mode-II loading. There are no published benchmark results due to the complexity of the problem and, therefore, they are compared with the results obtained with the J-DBEM, using the software \hyperref[b28]{[28]}.  For this problem, five cases were considered, with corresponding ratios of a/w = 0.2, 0.3, 0.4, 0.5 and 0.6. Rectangular local domains of integration, firstorder polynomial basis and quartic spline weighting function are considered on the ILMF model. Like the previous problem, the regular nodal configuration and discretization parameters are automatically defined though GA optimization, without any special refinement around the crack tip.\par
The results obtained for this multi-objective optimization process are presented in Figure 10, Figure 11 and Table \hyperref[tab_3]{3}; with all point in the Pareto front leading to The multi-objective Pareto front of the square plate with a single edge crack under mode-II loading, for a/w = 0.5; ILMF with the automatic parameters optimization routine.\par
The multi-objective Pareto front results of selected feasible solutions for the square plate with a single edge crack under mode-II loading (a/w = 0.5).   accurate results and fast computations. It can be seen that SIF values are close to each other, depending on the minimum value of the compliance indicator. For this optimization, both ? s and ? q values are close to each other due to the similarity between nodal distributions obtained. Once more, ? q ? 0.5 and, for this case, ? s = 1.4 ? 4. The multi-objective Pareto front of selected feasible solutions for a square plate with a single edge crack under mode-II loading (a/w = 0.5). 
\section[{Index CPU Time}]{Index CPU Time}\par
For different values of a/w, Table  {\ref 4} show the results obtained from the anal-Square plate with a single edge crack under mode-II loading.  \hyperref[b28]{[28]}. In this problem, the SIF values obtained for the mode-I are always below 10 ?3 , since this is a mode-II crack problem.K I /(t\textbf{?}\par
Even though this problem is highly complex, accurate values were obtained after the optimization process, improving the previous results. The nodal distribution obtained by the GA optimization scheme and the respective deformed configuration of the plate is schematically represented in Figures 12 and 13.\par
Consider now a plate with an edge slant crack, as represented in Figure 14 schematically, in mixed-mode deformation. The length of the crack is denoted by a, the width and height of the plate is denoted by w. The plate is loaded by a uniform traction t = ?, applied symmetrically at the ends.\par
iii. Mixed-Mode Loading Table  {\ref 4}:   tios of a/w = 0.2, 0.4 and 0.6, for ? = 30 ? and two cases, with corresponding ratios of a/w = 0.2 and 0.4, for ? = 60 ? , as originally presented by Murakami \hyperref[b24]{[24]}. For MLS approximation of the elastic field, a first-order polynomial basis and a quartic spline weighting function were considered, along with rectangular local domains to perform the numerical integration of the ILMF model. The regular nodal configuration and discretization parameters are automatically defined though GA optimization, without any special refinement around the crack tip.\par
All the results presented are compared with the accurate values provided by Murakami \hyperref[b24]{[24]} and Portela and Aliabadi \hyperref[b28]{[28]}. The multi-objective optimization process resulted in the Pareto front of Figure 15, where all feasible solutions are presented. The selected multi-objective optimization are presented in Figure 16 and Tables \hyperref[tab_5]{5 and 6}; where a good accuracy can be seen related to minimum values The multi-objective Pareto front results of selected feasible solutions for the square plate with a single edge crack under mixed-mode loading, for a/w = 0.4 and ? = 30   The multi-objective Pareto front of selected feasible solutions for the square plate with an edge slant crack under mixed-mode loading (a/w = 0.4).\par
The multi-objective Pareto front results of selected feasible solutions for the square plate with a single edge crack under mixed-mode loading, for a/w = 0.4 and ? = 60 from the values obtained with the J-integral implemented in the DBEM, provided by Portela and Aliabadi \hyperref[b28]{[28]}, and Murakami \hyperref[b24]{[24]}. The nodal distribution obtained by the GA optimization scheme and the respective deformed configuration of the plate is schematically represented in Figures 17 and 18.\par
The compliance proved to be an efficient objective function for linear elastic fracture mechanics problems and complement the already efficient SST implementation, without any refinement around the crack tip due to the regularized stress field.\par
Square plate with a single edge crack under mixed-mode loading, for ? = 60 ? and K I /(t ? ?a).\par
K I /(t ? ?a) \% Error a/w ILMF ILMF + J-DBEM \hyperref[b28]{[28]} Reference \hyperref[b24]{[24]}     Deformed configuration of the plate resulting from the optimization scheme, for a/w = 0.6, under mixed-mode loading.\par
The ILMF local mesh free numerical method, implemented with SST, was improved through an optimization scheme that automatically define the nodal distribution and the discretization parameters, for solving two-dimensional problems of the linear elastic fracture mechanics.\par
The MLS and reduced numerical integrations are considered in the discretization of the elastic field, using a node-by-node process to generate the global system of equilibrium equations, which is very efficient and prone to parallel processing. Also, the reduced integration reduce the stiffness associated with local nodes, leading to an increase in the overall accuracy, without the well-known instabilities associated with the process.\par
The SST implemented for linear elastic fracture mechanics applications performs a regularization of the stress field, introducing the SIF as additional primary unknowns of the problem. As a consequence, the analysis does not require refined nodal distributions around crack tips, in contrast to other numerical methods. The numerical results are evidence of the efficiency of the modeling strategy, since accurate results were obtained for edge-cracked square plates under mode-I, mode-II and mixed-mode, always without any refinement around the crack tip and relatively small nodal distributions, automatically obtained by the optimization algorithm.\par
Historically, the nodal distribution, the size of the compact support and the size of the local integration domain are heuristically defined and need to be addressed for every mesh-free application. The ILMF model has the capability of the automatic definition of the discretization parameters and the nodal distribution, through a multi-objective optimization process, based on GA.\par
The definition of the objective function as a profound impact on the behavior of the optimization process and need to be carefully defined. In this paper, an appropriate objective function is derived from the classical structural theorem of the minimum total potential energy, carried out only at static boundary nodes that does not require the computation of derivatives of shape functions. Therefore, the optimization scheme is computationally very efficient and as the additional benefit of not requiring the analytical solution to be performed. 
\section[{VI. Conclusions}]{VI. Conclusions}\par
The results obtained with the optimization algorithm are in agreement with those of the reference values, where low compliance values are associated with accurate SIF values, as expected. This result show that the local Pareto-optimal is always quite close to the global Pareto-optimal solutions, which is always desirable from a computational point of view. The structural compliance objective function effectively optimized the discretization parameters and the nodal distribution, properly defining these geometrical properties with fast computations and without any user input.\par
This paper show that mesh-free methods, along with optimization processes, could provide stable and accurate solutions for fracture mechanics problems with minimal user input, contributing to a mainstream use of mesh-free numerical methods in the near future.                        \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.020858895705521473\textwidth}P{0.10429447852760736\textwidth}P{0.27116564417177913\textwidth}P{0.10429447852760736\textwidth}P{0.2450920245398773\textwidth}P{0.015644171779141104\textwidth}P{0.08865030674846625\textwidth}}
\tabcellsep \tabcellsep \multicolumn{2}{l}{(s) Compliance K I /(t ? ?a)}\tabcellsep ? s\tabcellsep ? q\tabcellsep Nodes\\
1\tabcellsep 0.394\tabcellsep 9.87E-04\tabcellsep 0.264\tabcellsep \multicolumn{2}{l}{2.662 0.511}\tabcellsep 237\\
2\tabcellsep 0.241\tabcellsep 0.204\tabcellsep 0.315\tabcellsep \multicolumn{2}{l}{1.485 0.501}\tabcellsep 299\\
3\tabcellsep 0.967\tabcellsep -0.115\tabcellsep 0.281\tabcellsep \multicolumn{2}{l}{3.903 0.503}\tabcellsep 251\\
4\tabcellsep 0.886\tabcellsep 0.791\tabcellsep 0.231\tabcellsep \multicolumn{2}{l}{3.885 0.828}\tabcellsep 359\end{longtable} \par
 
\caption{\label{tab_3}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5} \par 
\begin{longtable}{P{0.11158301158301157\textwidth}P{0.07876447876447876\textwidth}P{0.1411196911196911\textwidth}P{0.10501930501930502\textwidth}P{0.06563706563706563\textwidth}P{0.08204633204633205\textwidth}P{0.24942084942084944\textwidth}P{0.009845559845559845\textwidth}P{0.006563706563706564\textwidth}}
\multicolumn{2}{l}{Ind. CPU T.(s)}\tabcellsep C\tabcellsep K I /(t\tabcellsep \multicolumn{2}{l}{? ?a) K II /(t ? ?a)}\tabcellsep ? s\tabcellsep ? q\tabcellsep N.\\
1\tabcellsep 3.08\tabcellsep 2.48E-04\tabcellsep \multicolumn{2}{l}{1.667}\tabcellsep 0.505\tabcellsep \multicolumn{2}{l}{5.821 0.617 301}\\
2\tabcellsep 6.614\tabcellsep -4.68E-02\tabcellsep \multicolumn{2}{l}{1.518}\tabcellsep 0.455\tabcellsep \multicolumn{2}{l}{9.769 0.612 455}\\
3\tabcellsep 0.329\tabcellsep 4.46E-04\tabcellsep \multicolumn{2}{l}{1.645}\tabcellsep 0.494\tabcellsep \multicolumn{2}{l}{2.753 0.916 203}\\
4\tabcellsep 5.744\tabcellsep -1.34E-04\tabcellsep \multicolumn{2}{l}{1.937}\tabcellsep 0.587\tabcellsep \multicolumn{2}{l}{6.56 0.499 331}\\
5\tabcellsep 1.437\tabcellsep 2.54E-04\tabcellsep \multicolumn{2}{l}{1.579}\tabcellsep 0.479\tabcellsep \multicolumn{2}{l}{4.25 0.501 267}\\
\multicolumn{2}{l}{for compliance.}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
  {\small\itshape [Note: ? .]} 
\caption{\label{tab_5}Table 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{67} \par 
\begin{longtable}{P{0.39076620825147346\textwidth}P{0.07848722986247544\textwidth}P{0.06011787819253438\textwidth}P{0.07013752455795678\textwidth}P{0.02337917485265226\textwidth}P{0.05844793713163065\textwidth}P{0.008349705304518664\textwidth}P{0.1269155206286837\textwidth}P{0.03005893909626719\textwidth}P{0.0033398821218074653\textwidth}}
\multicolumn{2}{l}{Ind. CPU T. (s)}\tabcellsep C\tabcellsep K I /(t\tabcellsep \multicolumn{2}{l}{? ?a) K II /(t}\tabcellsep ? ?a)\tabcellsep ? s\tabcellsep ? q\tabcellsep N.\\
1\tabcellsep 0.909\tabcellsep 4.61E-04\tabcellsep \multicolumn{2}{l}{0.649}\tabcellsep \multicolumn{2}{l}{0.454}\tabcellsep \multicolumn{2}{l}{4.761 0.503 203}\\
2\tabcellsep 1.915\tabcellsep 6.84E-04\tabcellsep \multicolumn{2}{l}{0.701}\tabcellsep \multicolumn{2}{l}{0.491}\tabcellsep \multicolumn{2}{l}{8.58 0.501 165}\\
3\tabcellsep 8.217\tabcellsep 2.29E-04\tabcellsep \multicolumn{2}{l}{0.713}\tabcellsep \multicolumn{2}{l}{0.499}\tabcellsep \multicolumn{2}{l}{7.955 0.498 199}\\
4\tabcellsep 0.401\tabcellsep 7.08E-04\tabcellsep \multicolumn{2}{l}{0.511}\tabcellsep \multicolumn{2}{l}{0.482}\tabcellsep \multicolumn{2}{l}{3.659 0.495 199}\\
\multicolumn{9}{l}{compared to other examples or ? Square plate with a single edge crack under mixed-mode loading, for ? ?a). ? = 30 ? and K I /(t K I /(t ? ?a) \% Error}\\
\multicolumn{9}{l}{a/w ILMF ILMF + J-DBEM [28] Reference [24] ILMF + J-DBEM}\\
0.2\tabcellsep 1.164\tabcellsep 1.1\tabcellsep 1.082\tabcellsep \tabcellsep 1.100\tabcellsep \tabcellsep 0.009\tabcellsep 0.016\\
0.4\tabcellsep \multicolumn{2}{l}{1.513 1.579}\tabcellsep 1.545\tabcellsep \tabcellsep 1.550\tabcellsep \tabcellsep 0.018\tabcellsep 0.003\\
0.6\tabcellsep \multicolumn{2}{l}{2.732 2.743}\tabcellsep 2.572\tabcellsep \tabcellsep 2.550\tabcellsep \tabcellsep 0.08\tabcellsep 0.009\end{longtable} \par
  {\small\itshape [Note: ? .]} 
\caption{\label{tab_6}Table 6 :Table 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.24184100418410043\textwidth}P{0.1600418410041841\textwidth}P{0.11380753138075313\textwidth}P{0.017782426778242676\textwidth}P{0.010669456066945606\textwidth}P{0.08535564853556485\textwidth}P{0.14937238493723848\textwidth}P{0.0711297071129707\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep ILMF + J-DBEM\\
0.2\tabcellsep 0.543 0.520\tabcellsep \multicolumn{2}{l}{0.495}\tabcellsep \tabcellsep 0.500\tabcellsep 0.039\tabcellsep 0.010\\
0.4\tabcellsep 0.603 0.604\tabcellsep \multicolumn{2}{l}{0.592}\tabcellsep \tabcellsep 0.600\tabcellsep 0.005\tabcellsep 0.013\\
\tabcellsep \tabcellsep K II /(t\tabcellsep ? ?a)\tabcellsep \tabcellsep \tabcellsep \% Error\\
\multicolumn{7}{l}{a/w ILMF ILMF + J-DBEM [28] Reference [24] ILMF + J-DBEM}\\
0.2\tabcellsep 0.327 0.373\tabcellsep \multicolumn{2}{l}{0.356}\tabcellsep \tabcellsep 0.360\tabcellsep 0.035\tabcellsep 0.011\\
0.4\tabcellsep 0.439 0.422\tabcellsep \multicolumn{2}{l}{0.413}\tabcellsep \tabcellsep 0.420\tabcellsep 0.005\tabcellsep 0.017\\
\tabcellsep 0\tabcellsep \multicolumn{2}{l}{0.25}\tabcellsep 0.5\tabcellsep 0.75\tabcellsep 1\end{longtable} \par
 
\caption{\label{tab_7}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8910} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_8}Table 8 :Table 9 :Table 10 :}\end{figure}
 			\footnote{© 2021 Global Journals} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Zingg et al. ()]{b35}\label{b35} 	 		‘A comparative evaluation of genetic and gradient-based algorithms applied to aerodynamic optimization’.  		 			David W Zingg 		,  		 			Marian Nemec 		,  		 			Thomas H Pulliam 		.  	 	 		\textit{European Journal of Computational Mechanics}  		2008. 17  (1-2)  p. .  	 
\bibitem[Oliveira et al. ()]{b27}\label{b27} 	 		\textit{A local mesh free method for linear elasticity and fracture mechanics. Engineering Analysis with Boundary Elements},  		 			T Oliveira 		,  		 			W Vélez 		,  		 			E Santana 		,  		 			T Araújo 		,  		 			F Mendonça 		,  		 			A Portela 		.  		2019. 101 p. .  	 
\bibitem[Oliveira and Portela ()]{b26}\label{b26} 	 		‘A local mesh free method with the singularity subtraction technique’.  		 			T Oliveira 		,  		 			A Portela 		.  	 	 		\textit{Engineering Analysis with Boundary Elements}  		2019. 104 p. .  	 
\bibitem[Santana et al. ()]{b30}\label{b30} 	 		‘A local mesh free numerical method with automatic parameter optimization’.  		 			E Santana 		,  		 			T Oliveira 		,  		 			W Vélez 		,  		 			T Araújo 		,  		 			F Martins 		,  		 			A Portela 		.  	 	 		\textit{Engineering Analysis with Boundary Elements}  		2020. 113 p. .  	 
\bibitem[Liu and Gu ()]{b21}\label{b21} 	 		‘A local point interpolation method for stress analysis of two-dimensional solids’.  		 			G R Liu 		,  		 			Y T Gu 		.  	 	 		\textit{Structural Engineering and Mechanics}  		2001. 11  (2)  p. .  	 
\bibitem[Atluri and Zhu ()]{b1}\label{b1} 	 		‘A new meshless local petrov-galerkin (mlpg) approach in computational mechanics’.  		 			S N Atluri 		,  		 			T Zhu 		.  	 	 		\textit{Computational Mechanics}  		1998. 22  (2)  p. .  	 
\bibitem[Holland ()]{b16}\label{b16} 	 		\textit{Adaptation in Natural and Artificial Systems},  		 			J H Holland 		.  		1975. MIT press.  	 
\bibitem[Ebrahimnejad et al. ()]{b12}\label{b12} 	 		‘Adaptive refinement in the meshless finite volume method for elasticity problems’.  		 			M Ebrahimnejad 		,  		 			N Fallah 		,  		 			A R Khoei 		.  	 	 		\textit{Computers \& Mathematics with Applications}  		2015. 69  (12)  p. .  	 
\bibitem[Kelner and Leonard ()]{b19}\label{b19} 	 		‘Application of genetic algorithms to lubrication pump stacking design’.  		 			V Kelner 		,  		 			O Leonard 		.  	 	 		\textit{Journal of Computational and Applied Mathematics}  		2004. 168  (1)  p. .  	 
\bibitem[Portela and Aliabadi ()]{b28}\label{b28} 	 		‘Crack Growth Analysis Using Boundary Elements -Software’.  		 			A Portela 		,  		 			M H Aliabadi 		.  	 	 		\textit{Proceedings of the 23th International Conference on Engineering Design},  				 (the 23th International Conference on Engineering DesignSouthampton, UK and Boston, USA)  		1993. Design Society. p. .  	 
\bibitem[Civelek and Erdogan ()]{b6}\label{b6} 	 		‘Crack problems for a rectangular plate and an infinite strip’.  		 			M B Civelek 		,  		 			F Erdogan 		.  	 	 		\textit{International Journal of Fracture}  		1982. 19 p. .  	 
\bibitem[Caicedo and Portela ()]{b4}\label{b4} 	 		‘Cracked plate analysis with the dual boundary element method and williams' eigenexpansion’.  		 			J Caicedo 		,  		 			A Portela 		.  	 	 		\textit{J. of Engineering Analysis with Boundary Elements}  		2015. 52 p. .  	 
\bibitem[Gen and Cheng ()]{b13}\label{b13} 	 		\textit{Genetic Algorithms and Engineering Optimization},  		 			M Gen 		,  		 			R Cheng 		.  		2000. Wiley.  	 
\bibitem[Mccall ()]{b23}\label{b23} 	 		‘Genetic algorithms for modelling and optimisation’.  		 			J Mccall 		.  	 	 		\textit{Journal of Computational and Applied Mathematics}  		2005. 184  (1)  p. .  	 
\bibitem[Huerta et al. (ed.) ()]{b17}\label{b17} 	 		 			A Huerta 		,  		 			T Belytschko 		,  		 			S Fernández-Méndez 		,  		 			T Rabczuk 		,  		 			X Zhuang 		,  		 			M Arroyo 		.  		\textit{Meshfree methods. Encyclopedia of Computational Mechanics},  				 			Erwin Stein,  			René De Borst,  			Thomas J R Hughes 		 (ed.)  		2017. Wiley.  	 	 (Second Edition) 
\bibitem[Dede et al. ()]{b8}\label{b8} 	 		‘Isogeometric analysis for topology optimization with a phase field model’.  		 			L Dede 		,  		 			M J Borden 		,  		 			T J R Hughes 		.  	 	 		\textit{Archives of Computational Methods in Engineering}  		2012. 19 p. .  	 
\bibitem[Chen et al. ()]{b5}\label{b5} 	 		‘Meshfree methods: Progress made after 20 years’.  		 			J Chen 		,  		 			M Hillman 		,  		 			S Chi 		.  	 	 		\textit{Journal of Engineering Mechanics}  		2017. 143  (4)  p. 4017001.  	 
\bibitem[Proos et al. ()]{b37}\label{b37} 	 		‘Multicriterion evolutionary structural optimization using the weighting and the global criterion methods’.  		 			K Proos 		,  		 			G Steven 		,  		 			O Querin 		,  		 			Y Xie 		.  	 	 		\textit{AIAA J}  		2006-2012, 2001. 39.  	 
\bibitem[Kim et al. ()]{b20}\label{b20} 	 		‘Multiobjective evolutionary structural optimization using combined static/dynamic control parameters’.  		 			W Y Kim 		,  		 			R V Grandhi 		,  		 			M Haney 		.  	 	 		\textit{AIAA J}  		2006. 44 p. .  	 
\bibitem[Ringuest ()]{b29}\label{b29} 	 		\textit{Multiobjective Optimization: Behavioral and Computational Considerations},  		 			J L Ringuest 		.  		1992. Kluwer.  	 
\bibitem[Dede ()]{b7}\label{b7} 	 		‘Multiphysics topology optimization of heat transfer and fluid flow systems’.  		 			E Dede 		.  	 	 		\textit{Proceedings of the COMSOL Conference},  				 (the COMSOL ConferenceBoston)  		2009. COM-SOL.  	 
\bibitem[Steuer ()]{b32}\label{b32} 	 		\textit{Multiple Criteria Optimization: Theory, Computation, and Application},  		 			R E Steuer 		.  		1986. Wiley.  	 
\bibitem[Hwang and Masud ()]{b18}\label{b18} 	 		\textit{Multiple Objectives Decision Making-Methods and Applications},  		 			C L Hwang 		,  		 			A S M Masud 		.  		1979. Springer.  	 
\bibitem[Murakami ()]{b24}\label{b24} 	 		 			Y Murakami 		.  		\textit{Stress intensity factors handbook},  				1987. Pergamon Press. 2.  	 	 (1st edition) 
\bibitem[Wolpert and Macready ()]{b34}\label{b34} 	 		‘No free lunch theorems for optimization’.  		 			D H Wolpert 		,  		 			W G Macready 		.  	 	 		\textit{Transactions on Evolutionary Computation}  		1997. 1  (1)  p. .  	 
\bibitem[Denk et al. ()]{b11}\label{b11} 	 		\textit{Nodal cosine sine material interpolation in multi objective topology optimization with the global criteria method for linear elasto static},  		 			M Denk 		,  		 			K Rother 		,  		 			M Zinßer 		,  		 			C Petroll 		,  		 			K Paetzold 		.  		2021.  	 	 (heat transfer, potential flow and binary) 
\bibitem[Denk et al. ()]{b10}\label{b10} 	 		‘Nodal cosine sine material interpolation in multi objective topology optimization with the global criteria method for linear elasto static, heat transfer, potential flow and binary cross entropy sharpening’.  		 			M Denk 		,  		 			K Rother 		,  		 			M Zinßer 		,  		 			C Petroll 		,  		 			K Paetzold 		.  	 	 		\textit{Proceedings of the 23th International Conference on Engineering Design},  				 (the 23th International Conference on Engineering Design)  		2021. Design Society. p. .  	 
\bibitem[Baradaran and Mahmoodabadi ()]{b3}\label{b3} 	 		‘Optimal pareto parametric analysis of two dimensional steady-state heat conduction problems by mlpg method’.  		 			G H Baradaran 		,  		 			M J Mahmoodabadi 		.  	 	 		\textit{International Journal of Engineering}  		2009. 22  (4)  p. .  	 
\bibitem[Bagheri et al. ()]{b2}\label{b2} 	 		‘Optimization of meshless local petrov-galerkin using genetic algorithm for 3d elastostatic problems’.  		 			A Bagheri 		,  		 			R Ehsany 		,  		 			M J Mahmoodabadi 		,  		 			G H Baradaran 		.  	 	 		\textit{International Journal of Engineering}  		2011. 24  (2)  p. .  	 
\bibitem[Liu et al. ()]{b22}\label{b22} 	 		‘Point interpolation method based on local residual formulation using radial basis functions’.  		 			G R Liu 		,  		 			L Yan 		,  		 			J G Wang 		,  		 			Y T Gu 		.  	 	 		\textit{Structural Engineering and Mechanics}  		2002. 14 p. .  	 
\bibitem[References Références Referencias]{b9}\label{b9} 	 		\textit{References Références Referencias},  		 	 
\bibitem[Williams ()]{b33}\label{b33} 	 		‘Stress singularities resulting from various boundary conditions in angular corners of plates in extension’.  		 			M L Williams 		.  	 	 		\textit{Journal of Applied Mechanics}  		1952. p. .  	 
\bibitem[Atluri and Shen ()]{b0}\label{b0} 	 		‘The meshless local petrov-galerkin (mlpg) method: A simple and less-costly alternative to the finite element and boundary element methods’.  		 			S N Atluri 		,  		 			S Shen 		.  	 	 		\textit{CMES: Computer Modeling in Engineering and Sciences}  		2002. 3  (1)  p. .  	 
\bibitem[Sawaragi et al. ()]{b31}\label{b31} 	 		\textit{Theory of Multiobjective Optimization},  		 			Y Sawaragi 		,  		 			H Nakayama 		,  		 			T Tanino 		.  		1985. Academic Press.  	 
\bibitem[Gupta et al. ()]{b15}\label{b15} 	 		\textit{Topology optimization of front metallization patterns for solar cells. Structural and Multidisciplinary Optimization},  		 			D K Gupta 		,  		 			M Langelaar 		,  		 			M Barink 		,  		 			F Van Keulen 		.  		2015. 51 p. .  	 
\bibitem[Gersborg-Hansen et al. ()]{b14}\label{b14} 	 		\textit{Topology optimization of heat conduction problems using the finite volume method. Structural and Multidisciplinary Optimization},  		 			A Gersborg-Hansen 		,  		 			M P Bendsoe 		,  		 			O Sigmund 		.  		2006. 31 p. .  	 
\bibitem[Zolfagharian et al. ()]{b36}\label{b36} 	 		‘Topology-optimized 4d printing of a soft actuator’.  		 			A Zolfagharian 		,  		 			M Denk 		,  		 			M Bodaghi 		,  		 			A Z Kouzani 		,  		 			A Kaynak 		.  	 	 		\textit{Acta Mechanica Solida Sinica}  		2020. 33 p. .  	 
\bibitem[Oliveira and Portela ()]{b25}\label{b25} 	 		‘Weak form collocation -a local meshless method in linear elasticity’.  		 			T Oliveira 		,  		 			A Portela 		.  	 	 		\textit{Engineering Analysis with Boundary Elements}  		2016. 73  (1)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
