A new hybrid PSO algorithm based on a stochastic Markov chain model

International audienceBased on the recent research concerning the PageRank Algorithm used in the famous search engine Google, a new Inverse-PageRank-Particle Swarm Optimizer (I-PR-PSO) is presented in order to improve the performances of classic PSO. The resulted algorithm uses a stochastic Markov chain model to define an intelligent topological structure of the swarm's population, in which the better particles have an important influence on the others. In the presented experiments, calculations on some benchmark functions classically used to test optimization methods are performed, and the results are compared to different versions of the standard PSO, that is using different topological structures of the population. The experimental results show that I-PR-PSO can converge quicker on the tested functions, and can find better results in the solution domain than its tested peers

An adjacency representation for structural topology optimization using genetic algorithm

A new approach for continuum structural topology optimization using genetic algorithms is presented in this paper. The proposed approach is based on a representation by adjacency where the principle is founded on the concept of connectivity of finite elements, considered as cells. This principle is expressed by an adjacency matrix similar to that used in the graph theory. The encoding of the structure solutions uses this matrix by transforming it into a binary string. The research of optimal solution, i.e. the optimal material distribution, is interpreted in this approach by the determination of the connectivity of elements (cells). Using density variable, the approach has some common points with the homogenization techniques. The proposed approach is tested with simple benchmark applications