並列GAによる局所接触探索解の多項式近似  [in Japanese] A Polynomial Approximation of the Solution of Local Contact Search Using A Parallel Genetic Algorithm  [in Japanese]

This paper describes a GA-based method for obtaining an approximating polynomial for local coordinates of the contact point in local contact search process Contact search process consists of two phases a global search phase for finding the nearest node-segment pair and a local search phase for finding an exact local coordinate of the contact point within the segment In the present method, the parallel genetic algorithm is utilized for finding the approximating polynomial of the local coordinates of the contact point m the local search phase. The fundamental formulation of the GA-based search method is described in detail, and its basic performance is demonstrated through sample analyses