GA topology optimization using random keys for tree encoding of structures

Topology optimization consists in finding the spatial distribution of a given total volume of material for the resulting structure to have some optimal property, for instance, maximization of structural stiffness or maximization of the fundamental eigenfrequency. In this paper a Genetic Algorithm (GA) employing a representation method based on trees is developed to generate initial feasible individuals that remain feasible upon crossover and mutation and as such do not require any repairing operator to ensure feasibility. Several application examples are studied involving the topology optimization of structures where the objective functions is the maximization of the stiffness and the maximization of the first and the second eigenfrequencies of a plate, all cases having a prescribed material volume constraint.

Communication: The criticality of self-assembled rigid rods on triangular lattices

The criticality of self-assembled rigid rods on triangular lattices is investigated using Monte Carlo simulation. We find a continuous transition between an ordered phase, where the rods are oriented along one of the three (equivalent) lattice directions, and a disordered one. We conclude that equilibrium polydispersity of the rod lengths does not affect the critical behavior, as we found that the criticality is the same as that of monodisperse rodson the same lattice, in contrast with the results of recently published work on similar models. (C) 2011 American Institute of Physics. [doi:10.1063/1.3556665]

On lattices from combinatorial game theory modularity and a representation theorem: finite case

We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.