EFFECTS OF ADAPTIVE SOCIAL NETWORKS ON THE ROBUSTNESS OF EVOLUTIONARY ALGORITHMS

2011 ◽  
Vol 20 (05) ◽  
pp. 783-817 ◽  
Author(s):  
JAMES M. WHITACRE ◽  
RUHUL A. SARKER ◽  
Q. TUAN PHAM

Biological networks are structurally adaptive and take on non-random topological properties that influence system robustness. Studies are only beginning to reveal how these structural features emerge, however the influence of component fitness and community cohesion (modularity) have attracted interest from the scientific community. In this study, we apply these concepts to an evolutionary algorithm and allow its population to self-organize using information that the population receives as it moves over a fitness landscape. More precisely, we employ fitness and clustering based topological operators for guiding network structural dynamics, which in turn are guided by population changes taking place over evolutionary time. To investigate the effect on evolution, experiments are conducted on six engineering design problems and six artificial test functions and compared against cellular genetic algorithms and panmictic evolutionary algorithm designs. Our results suggest that a self-organizing topology evolutionary algorithm can exhibit robust search behavior with strong performance observed over short and long time scales. More generally, the coevolution between a population and its topology may constitute a promising new paradigm for designing adaptive search heuristics.

2020 ◽  
Vol 12 (4) ◽  
pp. 83-94
Author(s):  
Mihai-Vladut HOTHAZIE ◽  
Matei MIRICA

Nowadays, algorithms designed to optimize the shape of an airfoil are being developed by many researchers. In this paper, to achieve an optimum shape configuration, a methodology based on an evolutionary algorithm is proposed. The main objective is to find the optimum shape of a known airfoil that gives the best aerodynamic performance for a fixed lift coefficient. For the airfoil parametrization, the class-shape method is used to develop a well-behaved geometry. The paper underlines the implementation of a constrained differential evolutionary algorithm using the free penalty scheme by varying the coefficients of the shape parametrization function. The aim is to obtain a better aerodynamic performance for a predetermined lift coefficient by imposing a fixed maximum airfoil thickness interval. The method is a general optimization procedure and can be implemented in a wide range of engineering design problems.


2018 ◽  
Vol 23 (15) ◽  
pp. 6197-6213 ◽  
Author(s):  
Najlawi Bilel ◽  
Nejlaoui Mohamed ◽  
Affi Zouhaier ◽  
Romdhane Lotfi

1988 ◽  
Vol 21 (1) ◽  
pp. 5-9 ◽  
Author(s):  
E G McCluskey ◽  
S Thompson ◽  
D M G McSherry

Many engineering design problems require reference to standards or codes of practice to ensure that acceptable safety and performance criteria are met. Extracting relevant data from such documents can, however, be a problem for the unfamiliar user. The use of expert systems to guide the retrieval of information from standards and codes of practice is proposed as a means of alleviating this problem. Following a brief introduction to expert system techniques, a tool developed by the authors for building expert system guides to standards and codes of practice is described. The steps involved in encoding the knowledge contained in an arbitrarily chosen standard are illustrated. Finally, a typical consultation illustrates the use of the expert system guide to the standard.


Energies ◽  
2021 ◽  
Vol 14 (15) ◽  
pp. 4613
Author(s):  
Shah Fahad ◽  
Shiyou Yang ◽  
Rehan Ali Khan ◽  
Shafiullah Khan ◽  
Shoaib Ahmed Khan

Electromagnetic design problems are generally formulated as nonlinear programming problems with multimodal objective functions and continuous variables. These can be solved by either a deterministic or a stochastic optimization algorithm. Recently, many intelligent optimization algorithms, such as particle swarm optimization (PSO), genetic algorithm (GA) and artificial bee colony (ABC), have been proposed and applied to electromagnetic design problems with promising results. However, there is no universal algorithm which can be used to solve engineering design problems. In this paper, a stochastic smart quantum particle swarm optimization (SQPSO) algorithm is introduced. In the proposed SQPSO, to tackle the premature convergence problem in order to improve the global search ability, a smart particle and a memory archive are adopted instead of mutation operations. Moreover, to enhance the exploration searching ability, a new set of random numbers and control parameters are introduced. Experimental results validate that the adopted control policy in this work can achieve a good balance between exploration and exploitation. Finally, the SQPSO has been tested on well-known optimization benchmark functions and implemented on the electromagnetic TEAM workshop problem 22. The simulation result shows an outstanding capability of the proposed algorithm in speeding convergence compared to other algorithms.


Author(s):  
Swaroop S. Vattam ◽  
Michael Helms ◽  
Ashok K. Goel

Biologically inspired engineering design is an approach to design that espouses the adaptation of functions and mechanisms in biological sciences to solve engineering design problems. We have conducted an in situ study of designers engaged in biologically inspired design. Based on this study we develop here a macrocognitive information-processing model of biologically inspired design. We also compare and contrast the model with other information-processing models of analogical design such as TRIZ, case-based design, and design patterns.


2016 ◽  
Vol 2016 ◽  
pp. 1-22 ◽  
Author(s):  
Zhiming Li ◽  
Yongquan Zhou ◽  
Sen Zhang ◽  
Junmin Song

The moth-flame optimization (MFO) algorithm is a novel nature-inspired heuristic paradigm. The main inspiration of this algorithm is the navigation method of moths in nature called transverse orientation. Moths fly in night by maintaining a fixed angle with respect to the moon, a very effective mechanism for travelling in a straight line for long distances. However, these fancy insects are trapped in a spiral path around artificial lights. Aiming at the phenomenon that MFO algorithm has slow convergence and low precision, an improved version of MFO algorithm based on Lévy-flight strategy, which is named as LMFO, is proposed. Lévy-flight can increase the diversity of the population against premature convergence and make the algorithm jump out of local optimum more effectively. This approach is helpful to obtain a better trade-off between exploration and exploitation ability of MFO, thus, which can make LMFO faster and more robust than MFO. And a comparison with ABC, BA, GGSA, DA, PSOGSA, and MFO on 19 unconstrained benchmark functions and 2 constrained engineering design problems is tested. These results demonstrate the superior performance of LMFO.


Sign in / Sign up

Export Citation Format

Share Document