Topology optimization of trusses using genetic algorithm,force method and graph theory

In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd.     

NEXUS — Resilient Intelligent Middleware

Service-oriented computing is the latest software paradigm brought about by the computing revolution. The different viewpoint and granularity of software components used in technologies based on the service-oriented architecture paradigm, compared to traditional object-oriented methodologies makes them better suited to many of the efforts that are being made in the pervasive and ubiquitous computing world. In the NEXUS project we are seeking ways of fusing the SOA and pervasive computing paradigms in order to build intelligent, robust and resilient networks connecting dynamic islands of service resources.     

Wavefront reduction using graphs,neural networks and genetic algorithm

This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd.     

A New Algorithm for the Elimination of Common Subexpressions in Hardware Implementation of Digital Filters by Using Genetic Programming

A new algorithm based on Genetic Programming (GP) for the problem of optimization of Multiple constant Multiplication (MCM) by Common Subexpression Elimination(CSE) is developed. This method is used for hardware optimization for DSP systems. A solution based on Genetic Programming is shown in this paper. The performance of the technique is demonstrated in one- and multi-dimensional digital filters with constant coefficients.     

On development of a finite dynamic element and solution of associated eigenproblem by a block Lanczos procedure

The paper first presents the details of the development of a new six-noded plane triangular finite dynamic element. A block Lanczos algorithm is developed next for the accurate and efficient solution of the quadratic matrix eigenvalue problem associated with the finite dynamic element formulation. The resulting computer program fully exploits matrix sparsity inherent in such a discretization and proves to be most efficient for the extraction of the usually required first few roots and vectors, including repeated ones. Most importantly, the present eigenproblem solution effort is shown to be comparable to that of the corresponding finite element analysis, thereby rendering the associated dynamic element method rather attractive owing to superior convergence characteristics of such elements, presented herein.     

A generalized continuum theory for multiphase suspension flows

A continuum theory for multiphase particulate suspensions in a fluid media is formulated. The generalized fundamental balance laws for the particulate phases as well as for the continuous suspending fluid phase are presented. The thermodynamics of a multiphase system is studied and the method of Lagrangian multipliers is employed to include the constraints of incompressibility of materials of the constituents and the criterion for fully saturated media. Constitutive equations are developed which include microrotational and microdilatational effects. The basic equations of motion of different phases are derived and discussed. Special considerations are given to the case of incompressible constituents. Examples of applications of the present theory to dilute suspension flows and multiphase sedimentations are also discussed.     

Eigensolution of specially structured matrices with hyper‐symmetry

Recently, four canonical forms have been developed and applied to the dynamics and stability analysis of symmetric frames. In this paper, hyper‐symmetric matrices and specially structured matrices are defined and efficient methods are proposed for the eigensolution of such matrices. Applications are extended to hyper‐graphs and specially structured graphs. Simple methods are developed for calculating the eigenvalues of the Laplacian matrices of such graphs. The developments presented in this paper can also be considered as generalization of Form II and Form III symmetry, previously defined by the authors. Copyright © 2006 John Wiley & Sons, Ltd.     

A set theoretical shuffled shepherd optimization algorithm for optimal design of cantilever retaining wall structures

Engineering with Computers - In this paper, a recently developed meta-heuristic algorithm, shuffled shepherd optimization algorithm (SSOA), is employed for optimal design of reinforced concrete...     

An integrated methodology to control the risk of cardiovascular disease in patients with hypertension and type 1 diabetes

Today, air pollution, smoking, use of fatty acids and ready‐made foods, and so on, have exacerbated heart disease. Therefore, controlling the risk of such diseases can prevent or reduce their incidence. The present study aimed at developing an integrated methodology including Markov decision processes (MDP) and genetic algorithm (GA) to control the risk of cardiovascular disease in patients with hypertension and type 1 diabetes. First, the efficiency of GA is evaluated against Grey Wolf optimization (GWO) algorithm, and then, the superiority of GA is revealed. Next, the MDP is employed to estimate the risk of cardiovascular disease. For this purpose, model inputs are first determined using a validated micro‐simulation model for screening cardiovascular disease developed at Tehran University of Medical Sciences, Iran by GA. The model input factors are then defined accordingly and using these inputs, three risk estimation models are identified. The results of these models support WHO guidelines that provide medicine with a high discount to patients with high expected LYs. To develop the MDP methodology, policies should be adopted that work well despite the difference between the risk model and the actual risk. Finally, a sensitivity analysis is conducted to study the behavior of the total medication cost against the changes of parameters.     

A combinatorial study of the rigidity of planar structures

Summary A combinatorial method is presented for examining the rigidity of planar structures. In this approach, an expansion process is used for the formation of a statically determinate substructure, known as a -tree of a structure. The algorithm of Lováz and Yemini, and the method of Sugihara are employed for the recognition of the elementary subgraphs, during this process.With 4 Figures