Search

Differential Evolution (DE) stands out as an exceptional intelligent evolutionary algorithm, acclaimed for its simplicity in implementation and the ability to optimize without necessitating differentiable conditions. However, a significant pitfall of DE lies in its susceptibility to getting trapped in local minima, leading to algorithmic stagnation and substantial performance impairments. To counteract the shortcoming, the A daptative D ifferential E volution with D iversity M aintenance and R estart M echanism (ADE-DMRM) is proposed. This approach integrates three primary innovations. Firstly, the algorithm controls the number of generations that individuals stay in the external archive based on the successful evolution rate, thereby optimizing the mutation strategy to effectively maintain population diversity. Secondly, ADE-DMRM proposes a novel restart mechanism in which the current stagnant individuals are identified by combining a stagnation tracker and a diversity assessment indicator and then regenerated using a dimension-learning-based approach. Thirdly, wavelet basis functions and Cauchy distributions are employed for scaling factor implementation across different stages, while the dimension change information of successfully evolved individuals is harnessed to refine the adaptive parameter control scheme. Finally, comprehensive experiments were undertaken on the CEC2013, CEC2014, and CEC2017 test sets, assessing accuracy, convergence speed, the efficacy of each module, and time complexity. The results confirm that ADE-DMRM is an efficient single-objective optimization algorithm that outperforms current advanced variants. • An adaptive DE with Diversity Maintenance and Restart Mechanism is proposed. • The external archive is selectively optimized based on the successful rate of the population. • A novel restart mechanism is proposed to avoid premature convergence. • Wavelet basis functions and Cauchy distributions are employed in generating F. [ABSTRACT FROM AUTHOR]

Differential evolution is one of the most powerful stochastic real-parameter optimization algorithms currently, and its performance depends heavily on control parameters and mutation strategy. In recent years, methods to select favorable parameters control and mutation strategy when solving various optimization problems have attracted increasing attention. To choose an appropriate mutation strategy and control parameters for a given optimization problem, in this paper, a Adaptive Differential Evolution Algorithm Based on Deeply-Informed Mutation Strategy and Restart Mechanism (ADEDMR) is proposed, and the ADEDMR algorithm has the following characteristics: First, a deeply-informed mutation strategy is proposed, which takes into account the information of suboptimal solutions discarded by selection and inherits the advantages of the powerful "DE/target-pbest/1/bin", aiming to obtain a better perceptual landscape of the target function and improve the candidate diversity of the trial vector. Second, according to the evolution process, the segmentation method is used to control F , which alleviates the scaling of F in the wrong direction, and makes the newly generated F fit more accurately. Third, a new population restart mechanism is adopted to further enhance population diversity by adaptively enhancing the search ability of hopeless individuals and randomly replacing some inferior individuals with wavelet walks. To evaluate the performance of our proposed algorithm, comparative experiments are conducted on 72 benchmark functions from the CEC2014, CEC2017 and CEC2022 test suites. Experimental results show that the proposed ADEDMR has higher convergence accuracy, better optimization ability when solving high-dimensional complex functions, and is competitive with six recent strong DE variants. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) is one of the most effective methods for single-objective numerical optimization, however, the former state-of-the-art DE variants ignore the huge differences among the individuals in the population. To take full advantage of different individuals in the population, in this paper, a dynamic Hierarchical Population based Differential Evolution (HPDE) with novel diversity metric is proposed, and the HPDE algorithm has the following innovations: Firstly, the individuals in the hierarchical population are dynamically divided into two layers, the layer of elites, and the layer of ordinary individuals. Moreover, the ordinary layer individuals are further divided into secondary elites and inferior individuals. The individuals in the two layers employed different mutation strategies and the corresponding parameter control schemes. Secondly, a novel hierarchical population based mutation strategy is firstly proposed in our HPDE algorithm and the individuals in the elite layer employ the novel mutation strategy aiming at scouting the landscape of the objective while the ordinary individuals employ an improved "DE/target- p best/1/bin" strategy aiming at getting a better balance between exploration and exploitation of the solution space. Thirdly, a N ovel P arameter C ontrol technique, namely NPC technique, is employed in the adaptation of control parameters during the evolution. Fourthly, a new metric of population diversity is proposed and premature convergence can be avoided by maintaining better population diversity. To evaluate the performance of our HPDE algorithm, intensive experiments are conducted on 88 benchmark functions from the CEC2013, CEC2014 and CEC2017 test suites, and the results show the competitiveness of our HPDE with six recent state-of-the-art DE variants, e.g. it obtained 28 similar or better performance improvements out of the total 30 benchmarks on 30D optimization in comparison with the winner algorithm, the LSHADE algorithm, of the CEC2014 competition and it also obtained 19 similar or better performance improvements out of the total 30 benchmarks on 30D optimization in comparison with the winner DE variant, the jSO algorithm, of the CEC2017 competition. Furthermore, the novel HPDE algorithm is utilized to estimate the parameters of the photovoltaic model, and the experiment results support its superiority as well. [ABSTRACT FROM AUTHOR]

Two Pt complexes with high quantum yields and photostability, and low cytotoxicity, were developed to track RNA G-quadruplexes (GQs) in live cells. Higher number and intensity, and longer lifetime of fluorescent foci in cancer cells than those in healthy cells suggest that the quantity and folding dynamics of RNA GQs could not only correlate to their biological functions, but be two novel biomarkers to characterize cancerous cells. [ABSTRACT FROM AUTHOR]

It has long been observed that trimethylamine N-oxide (TMAO) and urea demonstrate dramatically different properties in a protein folding process. Even with the enormous theoretical and experimental research work on these two osmolytes, various aspects of their underlying mechanisms still remain largely elusive. In this paper, we propose to use the weighted persistent homology to systematically study the osmolytes molecular aggregation and their hydrogen-bonding network from a local topological perspective. We consider two weighted models, i.e., localized persistent homology (LPH) and interactive persistent homology (IPH). Boltzmann persistent entropy (BPE) is proposed to quantitatively characterize the topological features from LPH and IPH, together with persistent Betti number (PBN). More specifically, from the localized persistent homology models, we have found that TMAO and urea have very different local topology. TMAO is found to exhibit a local network structure. With the concentration increase, the circle elements in these networks show a clear increase in their total numbers and a decrease in their relative sizes. In contrast, urea shows two types of local topological patterns, i.e., local clusters around 6 Å and a few global circle elements at around 12 Å. From the interactive persistent homology models, it has been found that our persistent radial distribution function (PRDF) from the global-scale IPH has same physical properties as the traditional radial distribution function. Moreover, PRDFs from the local-scale IPH can also be generated and used to characterize the local interaction information. Other than the clear difference of the first peak value of PRDFs at filtration size 4 Å, TMAO and urea also shows very different behaviors at the second peak region from filtration size 5 Å to 10 Å. These differences are also reflected in the PBNs and BPEs of the local-scale IPH. These localized topological information has never been revealed before. Since graphs can be transferred into simplicial complexes by the clique complex, our weighted persistent homology models can be used in the analysis of various networks and graphs from any molecular structures and aggregation systems. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) was an easy-coding and efficient stochastic algorithm for global optimization, and the whole optimization process simulates biological evolution. Superior individuals of the population that were suitable for the environment were retained during the evolution, and consequently the tolerable solutions could be obtained in the end. Despite the excellent performance of DE algorithm, there were still some shortcomings. For example, the general performance of DE depended largely on mutation strategy and control parameters, how to design the appropriate control parameters and mutation strategy were difficult tasks. Here a novel DE variant was proposed to overcome these shortcomings. By incorporating the depth information of previous generations of populations, a better diversity of trial vector candidates could be secured during the evolution process. Moreover, the thought that successful parameters should be retained to guide the update of themselves during the evolution was also incorporated into the novel algorithm. The optimization performance of the new proposed DE variant was verified under CEC 2013 test suit containing 28 benchmarks, and the results showed its competitiveness with several state-of-the-art DE variants. [ABSTRACT FROM AUTHOR]

In this paper, we systematically review weighted persistent homology (WPH) models and their applications in biomolecular data analysis. Essentially, the weight value, which reflects physical, chemical and biological properties, can be assigned to vertices (atom centers), edges (bonds), or higher order simplexes (cluster of atoms), depending on the biomolecular structure, function, and dynamics properties. Further, we propose the first localized weighted persistent homology (LWPH). Inspired by the great success of element specific persistent homology (ESPH), we do not treat biomolecules as an inseparable system like all previous weighted models, instead we decompose them into a series of local domains, which may be overlapped with each other. The general persistent homology or weighted persistent homology analysis is then applied on each of these local domains. In this way, functional properties, that are embedded in local structures, can be revealed. Our model has been applied to systematically study DNA structures. It has been found that our LWPH based features can be used to successfully discriminate the A-, B-, and Z-types of DNA. More importantly, our LWPH based principal component analysis (PCA) model can identify two configurational states of DNA structures in ion liquid environment, which can be revealed only by the complicated helical coordinate system. The great consistence with the helical-coordinate model demonstrates that our model captures local structure variations so well that it is comparable with geometric models. Moreover, geometric measurements are usually defined in local regions. For instance, the helical-coordinate system is limited to one or two basepairs. However, our LWPH can quantitatively characterize structure information in regions or domains with arbitrary sizes and shapes, where traditional geometrical measurements fail. [ABSTRACT FROM AUTHOR]

In this paper, we proposed a novel fitness-value-independent Differential Evolution to tackle complex real-parameter single-objective optimization. There were three innovations in the algorithm: First, dimension improvements based adaptation schemes for control parameters F and C R were advanced in this paper. Different from those fitness value improvements based parameter control in the recent winner DE variants, our algorithm has fitness-value-independent characteristic, therefore, it can be applied in much wider optimization scenarios especially for those that the exact fitness values of the objectives are unavailable. Second, a combined parabolic–linear reduction scheme for population size is employed in the algorithm based on the observation that the slower reduction of population size at the earlier stage of the evolution usually helps to get better perception of the objectives while a linear reduction of population size in the later stage helps to get better exploitation. Third, an indicator is proposed to monitor the diversity of the population and a corresponding population enhancement technique is launched when the diversity is detected bad. The first two innovations have the P arameter a daptive characteristic of the DE algorithm while the third innovation refers to p opulation e nhancement t echnique, therefore, we name our algorithm "the PaDE-pet algorithm". Then, the algorithm is validated under a larger test suite containing 88 benchmarks from CEC2013, CEC2014 and CEC2017 test suites for real-parameter single objective optimization, which may avoid over-fitting problem in comparison with employing a test suite containing a small number of benchmarks. The experiments support the superiority of the novel PaDE-pet algorithm in comparison with several recently proposed powerful DE variants. • A black-box model reflecting complex optimization without available fitness values. • The model reveals the fitness-value-dependent weakness of recent winner DE variants. • A novel fitness-value-independent DE algorithm was proposed to tackle the model. • New adaptation schemes for control parameters and population enhancement technique. • To avoid over-fitting, a larger test suite is employed in algorithm validation. [ABSTRACT FROM AUTHOR]

Abstract Differential Evolution (DE) variants have been proven to be excellent algorithms in tackling real-parameter single objective numerical optimization because they have secured the front ranks of these competitions for many years. Nevertheless, there are still some weaknesses, e.g. (1) improper control parameter adaptation schemes; and (2) defect in a given mutation strategy., existing in some state-of-the-art DE variants, which may result in slow convergence and worse optimization performance. Therefore, in this paper, a novel Parameter adaptive DE (PaDE) is proposed to tackle the above mentioned weaknesses and the PaDE algorithm has three advantages: (1) A grouping strategy with novel adaptation scheme for C r is proposed to tackle the improper adaptation schemes of C r in some state-of-the-art DE variants; (2) A novel parabolic population size reduction scheme is proposed to tackle the weakness in linear population size reduction scheme; (3) An enhanced time stamp based mutation strategy is proposed to tackle the weakness in a former mutation strategy. The novel PaDE algorithm is verified under 58 benchmarks from two Congress on Evolutionary Computation (CEC) Competition test suites on real-parameter single objective numerical optimization, and experiment results show that the proposed PaDE algorithm is competitive with the other state-of-the-art DE variants. [ABSTRACT FROM AUTHOR]

Optimization demands are ubiquitous in science and engineering. The key point is that the approach to tackle a complex optimization problem should not itself be difficult. Differential Evolution (DE) is such a simple method, and it is arguably a very powerful stochastic real-parameter algorithm for single-objective optimization. However, the performance of DE is highly dependent on control parameters and mutation strategies. Both tuning the control parameters and selecting the proper mutation strategy are still tedious but important tasks for users. In this paper, we proposed an enhanced structure for DE algorithm with less control parameters to be tuned. The crossover rate control parameter Cr is replaced by an automatically generated evolution matrix and the control parameter F can be renewed in an adaptive manner during the whole evolution. Moreover, an enhanced mutation strategy with time stamp mechanism is advanced as well in this paper. CEC2013 test suite for real-parameter single objective optimization is employed in the verification of the proposed algorithm. Experiment results show that our proposed algorithm is competitive with several well-known DE variants. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) is a simple but powerful population-based stochastic optimization algorithm. Owing to its simplicity, easy implementation and excellent performance, DE has been wildly applied in scientific and engineering areas. However, there are still some inconveniences and weaknesses in DE algorithm, such as the inconveniences in the choice of proper control parameters and the defects existing in a given mutation strategy. In this paper, a new DE variant, called Parameters with Adaptive Learning Mechanism Differential Evolution (PALM-DE), is proposed to tackle the inconvenience in control parameter selection as well as to enhance a former mutation strategy. The new variant is verified on 44 commonly used real-parameter single objective benchmark functions selected from CEC2013 and CEC2014 competitions. Several recently proposed well-known DE variants are also contrasted in the paper, and the experiment results show that the proposed PALM-DE algorithm is competitive in comparison with these DE variants. An attempt to enhance the performance of PALM-DE by employing linear population size reduction is also presented, and the performance is still competitive. [ABSTRACT FROM AUTHOR]

DNA offers a means of long-range charge transport for biology and electric nanodevices. Here, a series of tetra-stranded G-quadruplexes were assembled within a dendritic DNA architecture to explore oxidative charge transport (hole transport) through the G-quadruplex. Efficient charge transport was achieved over 28 Å upon UV irradiation. Over a longer G-quadruplex bridge, hole transport was escalated to a higher efficiency, which resulted in a higher yield than that of the optimal duplex DNA for charge transport, that is, the adenine tract. Efficient long-range hole transport suggests tetra-stranded G-quadruplexes, instead of an oxidation hotspot, hold better potential as an electron conduit than duplex DNA. [ABSTRACT FROM AUTHOR]

Two platinum complexes with an aza-bridged bis(1,10-phenanthrolin-2-yl)amine (bpa) were synthesized. The two phenanthrolines in bpa entered a flat plane prior to binding of nucleic acids, which bestowed on the two Pt complexes a significantly high stabilizing ability on both DNA and RNA G-quadruplexes. Further extending alkyl tail from aromatic coordination core enabled the complexes to distinguish GQ sequence based upon the topological folding structures and enhanced the selectivity of the complex against duplex DNA. This study paved the way to develop Pt complexes as GQ stabilizers for specific folding topology and the applications to disease and/or personalized anticancer medicine/therapy. [ABSTRACT FROM AUTHOR]

This paper presents a new novel evolutionary approach named QUasi-Affine TRansformation Evolutionary (QUATRE) algorithm, which is a swarm based algorithm and use quasi-affine transformation approach for evolution. The paper also discusses the relation between QUATRE algorithm and other kinds of swarm based algorithms including Particle Swarm Optimization (PSO) variants and Differential Evolution (DE) variants. Comparisons and contrasts are made among the proposed QUATRE algorithm, state-of-the-art PSO variants and DE variants under CEC2013 test suite on real-parameter optimization and CEC2008 test suite on large-scale optimization. Experiment results show that our algorithm outperforms the other algorithms not only on real-parameter optimization but also on large-scale optimization. Moreover, our algorithm has a much more cooperative property that to some extent it can reduce the time complexity (better performance can be achieved by reducing number of generations required for a target optimum by increasing particle population size with the total number of function evaluations unchanged). In general, the proposed algorithm has excellent performance not only on uni-modal functions, but also on multi-modal functions even on higher dimension optimization problems. [ABSTRACT FROM AUTHOR]

Optimization algorithms are proposed to tackle different complex problems in different areas. In this paper, we firstly put forward a new memetic evolutionary algorithm, named Monkey King Evolutionary (MKE) Algorithm, for global optimization. Then we make a deep analysis of three update schemes for the proposed algorithm. Finally we give an application of this algorithm to solve least gasoline consumption optimization (find the least gasoline consumption path) for vehicle navigation. Although there are many simple and applicable optimization algorithms, such as particle swarm optimization variants (including the canonical PSO, Inertia Weighted PSO, Constriction Coefficients PSO, Fully Informed Particle Swarm, Comprehensive Learning Particle Swarm Optimization, Dynamic Neighborhood Learning Particle Swarm). These algorithms are less powerful than the proposed algorithm in this paper. 28 benchmark functions from BBOB2009 and CEC2013 are used for the validation of robustness and accuracy. Comparison results show that our algorithm outperforms particle swarm optimizer variants not only on robustness and optimization accuracy, but also on convergence speed. Benchmark functions of CEC2008 for large scale optimization are also used to test the large scale optimization characteristic of the proposed algorithm, and it also outperforms others. Finally, we use this algorithm to find the least gasoline consumption path in vehicle navigation, and conducted experiments show that the proposed algorithm outperforms A* algorithm and Dijkstra algorithm as well. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) is one of the most popular and powerful branches of evolutionary algorithm family. However, even many state-of-the-art DE-based variants still exist weakness such as improper parameter adaptation and population stagnation during the later stage of evolution. To mitigate these deficiencies, differential evolution with fitness-difference based parameter control and hypervolume diversity indicator (FDHD-DE) is proposed in this paper. Firstly, a semi-adaptive adaptation scheme for control parameters is proposed, in which the generation of scale factor and crossover rate is modified by dividing into two stages, thus enhancing the efficiency of parameter adaptation. Secondly, a novel fitness-based weighting strategy is proposed to improve the performance of existing success history-based adaptation by employing a novel approach of utilizing fitness information. Finally, a hypervolume-based diversity indicator and corresponding dimension exchange strategy are proposed to alleviate the problem of population stagnation. The performance of FDHD-DE is verified on the 88 benchmark functions from Congress on Evolutionary Computation (CEC) 2013, CEC 2014, and CEC 2017 test suites on 10D, 30D and 50D and a real-world application. The experiment results are compared with several state-of-art DE variants, and the results show that FDHD-DE has better performance, both in terms of solution accuracy and convergence speed. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE), as a powerful population-based stochastic optimization algorithm, has attracted the attention of researchers from various fields due to its advantages such as simple operation, strong robustness, and few control parameters. However, many existing DE variants often suffer from drawbacks such as premature convergence and stagnation when solving complicated optimization problems. In view of the aforementioned issues, this paper proposes an adaptive DE with opposition learning-based diversity enhancement (OLBADE). The main contributions can be summarized as follows: Firstly, a new adaptive parameter control is proposed with a non-linear weighting strategy incorporating into the framework of parameter adaptation. Secondly, a donor vector perturbation strategy is introduced to complement existing strategy for increasing population diversity. Thirdly, a novel stagnation indicator is proposed, and then opposition learning strategy is employed to renew stagnated individuals in the population when stagnation occurs. OLBADE is compared with five excellent DE variants under a large test-bed containing CEC2013, CEC2014, CEC2017 and CEC2022 test suites to verify its effectiveness. In addition, OLBADE is applied in parameter identification problem of photovoltaic model to verify its feasibility. Experimental results demonstrate that OLBADE achieves higher solution accuracy, faster convergence speed and better stability. • A hybrid method combining the logistic and sine functions is used for the adjustment of F. • A donor vector perturbation strategy is introduced. • A diversity enhancement mechanism based on opposition learning is proposed. • To avoid over-fitting, a larger test suite is employed in algorithm validation. [ABSTRACT FROM AUTHOR]

Heterogeneous graph refers to a type of graph data characterized by its diverse node types and relation types, containing rich structures, features and heterogeneous information. How to fully utilize and capture these key information to generate effective node representations poses a great challenge in heterogeneous graph analysis and mining. To better tackle this problem, a heterogeneous graph representation learning model based on hybrid-attention mechanism is proposed, namely Heterogeneous Graph Relation Attention Network (HGRAN). The main contributions of HGRAN are listed as follows. First, a novel framework was proposed for better representing heterogeneous information originating from various relations and comprehensive usage of both structural and feature information instead of employing meta-path based framework. Second, a novel hybrid-attention mechanism which combines relation attention and node attention was proposed within this framework. Third, a novel feature similarity based relation attention is proposed to capture heterogeneous information originating from different relations. Fourth, in order to better implement node attention in heterogeneous graphs, a new transforming method that transforms adjacency matrices of diverse relations into a unified manner is proposed. Finally, extensive experiments on multiple real-world heterogeneous graph datasets are conducted to verify HGRAN, and the results support its superiority in comparison with the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Optimization problems exists extensively in real life, especially in science and engineering. Over the past decades, various optimization techniques have been developed to solve complex optimization problems in different areas especially that are unable to be solved by traditional methods. QUasi-Affine TRansformation Evolutionary (QUATRE) algorithm is a new novel evolution structure for global optimization, which is a swarm based algorithm and use quasi-affine transformation approach for evolution. Nevertheless, there are still some weaknesses in these QUATRE variants. This paper presents a novel E-QUATRE algorithm in which an automatically generated evolution matrix with self-adaptive mechanism and an adaptive control parameter F are proposed for the enhancement of the QUATRE algorithm. Moreover, this paper also discusses the relationship between QUATRE algorithm, Particle Swarm Optimization (PSO) and Differential Evolution (DE) algorithm, all of which are also famous swarm based Stochastic Algorithms (SAs). Algorithm validation is conducted under CEC2013 test suite on single-objective numerical optimization, and E-QUATRE algorithm is compared with several famous Particle Swarm Optimization (PSO) variants, Differential Evolution (DE) variants and QUATRE variants. The experiment results indicate that the proposed E-QUATRE algorithm has a better performance than these swarm based algorithms with fixed population. [ABSTRACT FROM AUTHOR]

The construction of expressways in China has produced diverse habitats along slopes characterized by steep gradients, uneven water distribution, poor soil conditions, and no routine maintenance. Manually planting beneficial species is an essential method of effectively improving slope soils to prevent soil erosion. However, few studies have evaluated the reclamation effects and plant community composition and structure used to restore slopes along expressways. This study focused on the Zhengzhou-Xinxiang section of the Beijing-Hong Kong-Macao Expressway. A total of 10 representative plant communities were evaluated using the analytic hierarchy process (AHP)–fuzzy integrated evaluation method. The sites were divided into four layers, namely, plant communities, soil nutrients, soil physical properties, and other ecological factors, and 14 indicators were assessed. The evaluation results showed that four of these plant communities (PCs) were excellent, three PCs were good, one PC was normal, two PCs were poor. The four excellent PCs had high Shannon-Wiener index, pielou index, richness index or community productivity. It is worth noting that most excellent plant community structures were tree + shrub + herb. Based on these results, we recommend that fill slopes should be restored using a combination of trees, herbs, and shrubs; also, the vegetation should include native plants, such as B. papyrifera, U. pumila, A. fruticosa, and Cynodon dactylon (L.). This study could provide ideas for plant community composition and structure of new highway slopes in similar climate environment, and provide theoretical support for plant community composition and structure and soil improvement for the existing slope. [ABSTRACT FROM AUTHOR]

A series of octahedral Ru(ii) complexes with an x–y planar tetradentate and two trans-z-axis ammonia ligands were synthesized. High stabilization of G-quadruplexes was achieved upon π-stacking with aromatic planar ligands. Unique interaction from z-axis ligands bestowed both excellent binding resistance to duplex DNA and selectivity towards the antiparallel topology. [ABSTRACT FROM AUTHOR]

Using amino-labeled oligonucleotide probes, we established a simple, robust and low-noise method for simultaneous detection of RNA and DNA by fluorescence in situ hybridization, a highly useful tool to study the large pool of long non-coding RNAs being identified in the current research. With probes either chemically or biologically synthesized, we demonstrate that the method can be applied to study a wide range of RNA and DNA targets at the single-cell and single-molecule level in cellular contexts. [ABSTRACT FROM AUTHOR]

Optimization demands exist everywhere in the real world especially in science studies and engineering practices, and it is important that the method to deal with intricacy optimization problems should itself be relative simple. Particle Swarm Optimization (PSO) and Differential Evolution (DE) both are simple evolutionary algorithms (EAs) which are proposed for single-objective optimization and both of them have been proved to be efficient methods for optimizing applications, however, there are still some weakness existing within them. A innovative evolutionary method named QUasi-Affine TRansformation Evolutionary (QUATRE) algorithm which is derived from, also tackles some weaknesses of PSO and DE algorithm, and obtains better performance on commonly used test suites. The key characteristic of QUATRE is that an automatically generated matrix named evolution matrix M is implemented in evolutionary process, which is taken as an alternative of employing the crossover rate CR. Here in this paper, we present a novel QUATRE variant, named IS-QUATRE, which can explore the search area in a better way comparison with the previous method, and relatively good optimization ability can be obtained by our proposed IS-QUATRE algorithm under CEC2013 test suit. And the conducted experimental results validate that our proposed IS-QUATRE is competitive with some other famous PSO and DE variants. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) algorithm generates a population of individuals by encoding with a floating point vector, and it is a simple and effective population-based stochastic optimization algorithm for global optimization of continuous space. Because of its excellent performance, DE variants can be applied in a wide range of applications in science and engineering. However, the performance of DE is sensitive to the choice of trial vector generation strategy and the associated control parameters. Therefore, it is necessary to choose appropriate mutation strategy and control parameters when tackling optimization applications. In this paper, an adaptive update mechanism is proposed to update control parameters F and Cr. The experimental results are verified on the CEC 2013 test suite which contains 28 benchmark functions for the evaluation of single objective real parameter optimization. The proposed algorithm is compared with jDE, iwPSO and ccPSO, and experiment results show its good performance. [ABSTRACT FROM AUTHOR]

Cloud Computing (CC) makes it possible for a common user to get an access to large pools of data and computational resources through a variety of interfaces. Among the so many important problems in CC, load balancing technique has been paid more and more attention for its important role. Good load balance algorithms can make whole system run more efficient. A new load balancing method combined with the advantage of online and offline load balancing algorithms are proposed in this paper. Two-choice algorithm and its improvement are used in the online step. Bacteria Foraging Optimization (BFO) and its improvement motivated by Lamarck Evolutionary Theory are introduced in our offline step. Online load balancing uses imperfect information, aiming at finishing tasks as fast as possible; while the offline makes full use of all information to make a supplement. Experiments on the heterogeneous tasks and serving points for computation intensive loads have been used here and the good performance shows the efficiency of our proposed method. [ABSTRACT FROM AUTHOR]