|
Civil-Comp Proceedings ISSN 1759-3433
CCP: 101 PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING
Edited by: B.H.V. Topping and P. Iványi
Paper 19 Topological Optimization using an Estimation of Distribution Algorithm and the Empirical Selection Distribution
S.I. Valdez, M. Vargas, S. Botello and A. Hernández Centre for Rsearch in Mathematics (CIMAT), Mineral de Valenciana, Guanajuato, Mexico
Full Bibliographic Reference for this paper
S.I. Valdez, M. Vargas, S. Botello, A. Hernández, "Topological Optimization using an Estimation of Distribution Algorithm and the Empirical Selection Distribution", in B.H.V. Topping, P. Iványi, (Editors), "Proceedings of the Third International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 19, 2013. doi:10.4203/ccp.101.19
Keywords: topological optimization, estimation of distribution algorithm, empirical selection distribution, parallel computation.
Summary
The shape optimization problem has been largely studied, it is defined as
finding the best shape for a mechanical structure given a set of
service conditions. This paper proposes a new methodology for the shape optimization
problem. We combined various interesting features for our proposal, such as:
- An estimation of distribution algorithm as optimization method. That uses
a special candidate solution generation, and a procedure to improve the candidate
solution before it is integrated into the population.
- The evaluation considers the Von Mises stresses, the nodal displacements
(from the finite element method), the weight of the structure. Nevertheless
there are three function values to evaluate, the algorithm just needs
the order of the solutions,
or to determine if a solution is better than other to perform the search.
- We introduce a parallel asynchronous proposal that performs
local optimization procedures,
while sharing information concerning local distributions and the best solution found.
It is important to note that this a remarkable difference with other population based algorithms
which must share candidate solutions, in this case the important information
we want to share is codified in a probability distribution.
This way of approaching the problem does not need explicit user given a priori
information, that could bias the search to some specific solutions.
Thus, the approximated optimum solution is totally inferred during the search process
without any given user information. The inferred information could be useful
and interesting from the designer's point of view, because the algorithm is capable
of synthesizing the acquired knowledge in the probability distribution.
We present case studies to show the performance of the proposed methodology.
The results have an important weight reduction, and even the optimization process
delivers feasible solutions when the initial mesh with all the elements present is unfeasible.
Hence the results seem encouraging and will be further explored.
Finally, this is one of the first papers in the literature that explores
the use of a parallel asynchronous estimation of distribution algorithm applied to
the shape optimization problem. The use of a probability distribution points out the
direction of possible future work:
- to use the knowledge in the distribution for
enhancing the search in similar problems,
- to use the distribution to inherit
the knowledge in multi-grid approaches,
- to obtain knowledge about the problem from the
statistical learning.
purchase the full-text of this paper (price £20)
go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £40 +P&P)
|