Modified Differential Evolution for Tension/Compression String Design Problem

2013 ◽  
Vol 705 ◽  
pp. 523-527
Author(s):  
Li Jian ◽  
Cheng Jiu Yin ◽  
Sachio Hirokawa ◽  
Yoshiyuki Tabata

This paper introduces a modified differential evoluiton method to solve the tension/compression string design problem. The modification is derived from mechanisms of social networks. In the proposed method, each individual will be attracted by the knowed best individual following the connectivity between each other. The connectivity is calculated based on the difference of the variables in each vector. The individuals with high connectivity tend to perform local search while those with poor connectivity tend to perform global search instead. The approach was employed for a tension/compression string design problem and by comparisons with the other evolutionary algorithms, the proposed method privided better resutls.

Author(s):  
Shufen Qin ◽  
Chan Li ◽  
Chaoli Sun ◽  
Guochen Zhang ◽  
Xiaobo Li

AbstractSurrogate-assisted evolutionary algorithms have been paid more and more attention to solve computationally expensive problems. However, model management still plays a significant importance in searching for the optimal solution. In this paper, a new method is proposed to measure the approximation uncertainty, in which the differences between the solution and its neighbour samples in the decision space, and the ruggedness of the objective space in its neighborhood are both considered. The proposed approximation uncertainty will be utilized in the surrogate-assisted global search to find a solution for exact objective evaluation to improve the exploration capability of the global search. On the other hand, the approximated fitness value is adopted as the infill criterion for the surrogate-assisted local search, which is utilized to improve the exploitation capability to find a solution close to the real optimal solution as much as possible. The surrogate-assisted global and local searches are conducted in sequence at each generation to balance the exploration and exploitation capabilities of the method. The performance of the proposed method is evaluated on seven benchmark problems with 10, 20, 30 and 50 dimensions, and one real-world application with 30 and 50 dimensions. The experimental results show that the proposed method is efficient for solving the low- and medium-dimensional expensive optimization problems by compared to the other six state-of-the-art surrogate-assisted evolutionary algorithms.


2006 ◽  
Vol 12 (2) ◽  
pp. 217-227 ◽  
Author(s):  
Hartmut Pohlheim

Evolutionary algorithms (EAs) are widely employed to solve a broad range of optimization problems. Even though they work in an algorithmically simple manner, it is not always easy to understand what is going on during a particular optimization run. It is especially desirable to gain further insight into the state and course of the algorithm if the optimization does not yield the expected results or if we are not sure whether the result achieved is really the best result possible. During an optimization run an EA produces a vast amount of data. The extraction of useful information is a nontrivial task. In this article, we review visualization methods used to extract this useful information. We also demonstrate the application of visualization techniques and explain how they help us to understand the course and state of the EA. This extra information gained by the use of visualization techniques is often the difference between a good result and a very good result. In complex real-world applications, merely achieving a good result often means that the approach has failed. On the other hand, a success means large gains in productivity or safety or a decrease in costs.


2018 ◽  
Vol 26 (4) ◽  
pp. 657-686
Author(s):  
Jorge Pérez Heredia

There has been renewed interest in modelling the behaviour of evolutionary algorithms (EAs) by more traditional mathematical objects, such as ordinary differential equations or Markov chains. The advantage is that the analysis becomes greatly facilitated due to the existence of well established methods. However, this typically comes at the cost of disregarding information about the process. Here, we introduce the use of stochastic differential equations (SDEs) for the study of EAs. SDEs can produce simple analytical results for the dynamics of stochastic processes, unlike Markov chains which can produce rigorous but unwieldy expressions about the dynamics. On the other hand, unlike ordinary differential equations (ODEs), they do not discard information about the stochasticity of the process. We show that these are especially suitable for the analysis of fixed budget scenarios and present analogues of the additive and multiplicative drift theorems from runtime analysis. In addition, we derive a new more general multiplicative drift theorem that also covers non-elitist EAs. This theorem simultaneously allows for positive and negative results, providing information on the algorithm's progress even when the problem cannot be optimised efficiently. Finally, we provide results for some well-known heuristics namely Random Walk (RW), Random Local Search (RLS), the (1+1) EA, the Metropolis Algorithm (MA), and the Strong Selection Weak Mutation (SSWM) algorithm.


2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Guangyu Chen ◽  
Xiaoqun Ding

An improved differential evolution (DE) method based on the dynamic search strategy (IDEBDSS) is proposed to solve dynamic economic dispatch problem with valve-point effects in this paper. The proposed method combines the DE algorithm with the dynamic search strategy, which improves the performance of the algorithm. DE is the main optimizer in the method proposed. While chaotic sequences are applied to obtain the dynamic parameter settings in DE, dynamic search strategy which consists of two steps, global search strategy and local search strategy, is used to improve algorithm efficiency. To accelerate convergence, a new infeasible solution handing method is adopted in the local search strategy; meanwhile, an orthogonal crossover (OX) operator is added to the global search strategy to enhance the optimization search ability. Finally, the feasibility and effectiveness of the proposed methods are demonstrated by three test systems, and the simulation results reveal that the IDEBDSS method can obtain better solutions with higher efficiency than the standard DE and other methods reported in the recent literature.


1973 ◽  
Vol 29 (02) ◽  
pp. 490-498 ◽  
Author(s):  
Hiroh Yamazaki ◽  
Itsuro Kobayashi ◽  
Tadahiro Sano ◽  
Takio Shimamoto

SummaryThe authors previously reported a transient decrease in adhesive platelet count and an enhancement of blood coagulability after administration of a small amount of adrenaline (0.1-1 µg per Kg, i. v.) in man and rabbit. In such circumstances, the sensitivity of platelets to aggregation induced by ADP was studied by an optical density method. Five minutes after i. v. injection of 1 µg per Kg of adrenaline in 10 rabbits, intensity of platelet aggregation increased to 115.1 ± 4.9% (mean ± S. E.) by 10∼5 molar, 121.8 ± 7.8% by 3 × 10-6 molar and 129.4 ± 12.8% of the value before the injection by 10”6 molar ADP. The difference was statistically significant (P<0.01-0.05). The above change was not observed in each group of rabbits injected with saline, 1 µg per Kg of 1-noradrenaline or 0.1 and 10 µg per Kg of adrenaline. Also, it was prevented by oral administration of 10 mg per Kg of phenoxybenzamine or propranolol or aspirin or pyridinolcarbamate 3 hours before the challenge. On the other hand, the enhancement of ADP-induced platelet aggregation was not observed in vitro, when 10-5 or 3 × 10-6 molar and 129.4 ± 12.8% of the value before 10∼6 molar ADP was added to citrated platelet rich plasma (CPRP) of rabbit after incubation at 37°C for 30 second with 0.01, 0.1, 1, 10 or 100 µg per ml of adrenaline or noradrenaline. These results suggest an important interaction between endothelial surface and platelets in connection with the enhancement of ADP-induced platelet aggregation by adrenaline in vivo.


Author(s):  
Philip Isett

This chapter presents the equations and calculations for energy approximation. It establishes the estimates (261) and (262) of the Main Lemma (10.1) for continuous solutions; these estimates state that we are able to accurately prescribe the energy that the correction adds to the solution, as well as bound the difference between the time derivatives of these two quantities. The chapter also introduces the proposition for prescribing energy, followed by the relevant computations. Each integral contributing to the other term can be estimated. Another proposition for estimating control over the rate of energy variation is given. Finally, the coarse scale material derivative is considered.


Metahumaniora ◽  
2017 ◽  
Vol 7 (3) ◽  
pp. 378
Author(s):  
Vincentia Tri Handayani

AbstrakFolklor yang menghasilkan tradisi lisan merupakan perwujudan budaya yang lahirdari pengalaman kelompok masyarakat. Salah satu bentuk tradisi lisan adalah ungkapan yangmengandung unsur budaya lokal dalam konstruksinya yang tidak dimiliki budaya lainnya.Ungkapan idiomatis memberikan warna pada bahasa melalui penggambaran mental. Dalambahasa Perancis, ungkapan dapat berupa locution dan expression. Perbedaan motif acuansuatu ungkapan dapat terlihat dari pengaruh budaya masyarakat pengguna bahasa. Sebuahleksem tidak selalu didefinisikan melalui unsur minimal, tidak juga melalui kata-kata,baik kata dasar atau kata kompleks, namun dapat melalui kata-kata beku yang maknanyatetap. Hubungan analogis dari makna tambahan yang ada pada suatu leksem muncul dariidentifikasi semem yang sama. Semem tersebut mengarah pada term yang diasosiasikan danyang diperkaya melalui konteks (dalam ungkapan berhubungan dengan konteks budaya).Kata kunci: folklor, ungkapan, struktur, makna idiomatis, kebudayaanAbstractFolklore which produces the oral tradition is a cultural manifestation born out theexperience of community groups. One form of the oral tradition is a phrase that containsthe elements of local culture in its construction that is not owned the other culture. Theidiomatic phrase gives the color to the language through the mental representation. InFrench, the expression can consist of locution and expression. The difference motivesreference of an expression can be seen from the influence of the cultural community thelanguage users. A lexeme is not always defined through a minimal element, nor throughwords, either basic or complex words, but can be through the frost words whose meaningsare fixed. The analogical connection of the additional meanings is on a lexeme arises fromthe identification of the same meaning. The meaning ‘semem’ leads to the associated termsand which are enriched through the context (in idiom related to the cultural context).Keywords : folklore, idioms, structure, idiom meaning, cultureI PENDAHULUAN


Author(s):  
Michel Meyer

Rhetoric has always been torn between the rhetoric of figures and the rhetoric of conflicts or arguments, as if rhetoric were exclusively one or the other. This is a false dilemma. Both types of rhetoric hinge on the same structure. A common formula is provided in Chapter 3 which unifies rhetoric stricto sensu and rhetoric as argumentation as two distinct but related strategies adopted according to the level of problematicity of the questions at stake, thereby giving unity to the field called “Rhetoric.” Highly problematic questions require arguments to justify their answers; non-divisive ones can be treated rhetorically through their answers as if they were self-evident. Another classic problem is how to understand the difference between logic and rhetoric. The difference between the two is due to the presence of questions explicitly answered in the premises in logic and only suggested (or remaining indeterminate) in rhetoric.


Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 139 ◽  
Author(s):  
Vincenzo Cutello ◽  
Georgia Fargetta ◽  
Mario Pavone ◽  
Rocco A. Scollo

Community detection is one of the most challenging and interesting problems in many research areas. Being able to detect highly linked communities in a network can lead to many benefits, such as understanding relationships between entities or interactions between biological genes, for instance. Two different immunological algorithms have been designed for this problem, called Opt-IA and Hybrid-IA, respectively. The main difference between the two algorithms is the search strategy and related immunological operators developed: the first carries out a random search together with purely stochastic operators; the last one is instead based on a deterministic Local Search that tries to refine and improve the current solutions discovered. The robustness of Opt-IA and Hybrid-IA has been assessed on several real social networks. These same networks have also been considered for comparing both algorithms with other seven different metaheuristics and the well-known greedy optimization Louvain algorithm. The experimental analysis conducted proves that Opt-IA and Hybrid-IA are reliable optimization methods for community detection, outperforming all compared algorithms.


Sign in / Sign up

Export Citation Format

Share Document