Dynamic elite strategy mayfly algorithm.
Ontology highlight
ABSTRACT:
SUBMITTER: Du Q
PROVIDER: S-EPMC9409577 | biostudies-literature | 2022
REPOSITORIES: biostudies-literature
Publications
The mayfly algorithm (MA), as a newly proposed intelligent optimization algorithm, is found that easy to fall into the local optimum and slow convergence speed. To address this, an improved mayfly algorithm based on dynamic elite strategy (DESMA) is proposed in this paper. Specifically, it first determines the specific space near the best mayfly in the current population, and dynamically sets the search radius. Then generating a certain number of elite mayflies within this range. Finally, the be ...[more]
Similar Datasets
Project description:With the wave of artificial intelligence sweeping the world in recent years, UAVs is widely used in various fields. UAV path planning has attracted much attention from scientists as an essential part of UAV work. In order to design an efficient and reasonable 3D UAV path planning program, recent researchers have invented and improved many algorithms. This paper proposes an elite RIME algorithm for 3D UAV path planning. First, we propose an elite reverse learning population selection strategy based on piecewise mapping to enhance the population diversity of the algorithm for better exploration. Second, this paper proposes a stochastic factor-controlled elite pool exploration strategy so that the algorithm is difficult to enter the local optimum and can better explore the global optimum. Then, this paper proposes a hard frost puncture exploitation strategy based on the sine-cosine function so that the algorithm can find the global optimum faster during the exploitation process. Meanwhile, in order to test the performance of the algorithm proposed in this paper, we compare it with 13 other intelligent optimization algorithms that are classical and popular nowadays on 52 test functions in three test sets, CEC2017, CEC2020, and CEC2022, and obtain competitive results. Finally, we applied it to the 3D UAV path planning problem in three different terrain scenarios, and the ELRIME algorithm achieved good results in all of them. Especially in the 7-peak model, the ELRIME algorithm improves the performance of the RIME algorithm by a factor of two. In the 9-peak model, the average value aspect also reduce the cost by 91 compared to the RIME algorithm, and more importantly, it has the smallest fluctuation in 30 runs, which is among the most stable of all the compared algorithms. In the 12-peak model, its stability is also significantly enhanced, and in terms of worst-case cost, it improves the cost by 340 compared to RIME.
| S-EPMC11408698 | biostudies-literature
Project description:The identification of chemical structures in natural product mixtures is an important task in drug discovery but is still a challenging problem, as structural elucidation is a time-consuming process and is limited by the available mass spectra of known natural products. Computer-aided structure elucidation (CASE) strategies seek to automatically propose a list of possible chemical structures in mixtures by utilizing chromatographic and spectroscopic methods. However, current CASE tools still cannot automatically solve structures for experienced natural product chemists. Here, we formulated the structural elucidation of natural products in a mixture as a computational problem by extending a list of scaffolds using a weighted side chain list after analyzing a collection of 243,130 natural products and designed an efficient algorithm to precisely identify the chemical structures. The complexity of such a problem is NP-complete. A dynamic programming (DP) algorithm can solve this NP-complete problem in pseudo-polynomial time after converting floating point molecular weights into integers. However, the running time of the DP algorithm degrades exponentially as the precision of the mass spectrometry experiment grows. To ideally solve in polynomial time, we proposed a novel iterative DP algorithm that can quickly recognize the chemical structures of natural products. By utilizing this algorithm to elucidate the structures of four natural products that were experimentally and structurally determined, the algorithm can search the exact solutions, and the time performance was shown to be in polynomial time for average cases. The proposed method improved the speed of the structural elucidation of natural products and helped broaden the spectrum of available compounds that could be applied as new drug candidates. A web service built for structural elucidation studies is freely accessible via the following link ( http://csccp.cmdm.tw/ ).
| S-EPMC5688056 | biostudies-literature
Project description:In recent years, low earth orbit navigation augmentation (LEO-NA) has attracted increasing attention and is expected to become a new addition to global navigation satellite systems (GNSSs). When solving complex constellation design problems, traditional optimization algorithms often fail to achieve satisfactory results and are sensitive to parameter settings. We propose a dynamic multi-objective differential evolutionary algorithm based on elite guidance (DMODE-EG). It can select the evolutionary strategy based on the evolutionary state reflected by elite individuals and dynamically modify evolution parameters. Moreover, to achieve more uniform global coverage, we construct a two-layer Walker constellation model for LEO-NA. Then, we use the DMODE-EG algorithm to solve the corresponding multi-objective optimization problem and obtain the optimal constellation parameters. With the augmentation of this LEO-NA constellation to the BeiDou-3 system, the average position dilution of precision (PDOP) values drop to 1.2-2.0 from 1.5-5.5, and the number of visible satellites increases from 8-10 to 13-18. By contrast, some realistic LEO constellations and constellations designed by other algorithms bring weaker improvements and cannot address the problem of high PDOP values in some regions. In addition, simulation results on standard test sets verify the excellent convergence and stability of the DMODE-EG algorithm.Supplementary informationThe online version contains supplementary material available at 10.1007/s10291-022-01366-5.
| S-EPMC9702746 | biostudies-literature
Project description:This study adopts a new approach, SHapley Additive exPlanation (SHAP), to diagnose the table tennis matches based on a hybrid algorithm, namely Long Short-Term Memory-Back Propagation Neural Network (LSTM-BPNN). 100 male singles competitions (8535 rallies) from 2019 to 2022 are analyzed by a hybrid technical-tactical analysis theory, which hybridizes the double three-phase and four-phase evaluation theories. A k-means cluster analysis is conducted to classify 59 players' winning rates into three levels (high, medium, and low). The results show that LSTM-BPNN has excellent performance (MSE = 0.000355, MAE = 0.014237, RMSE = 0.018853, and [Formula: see text] = 0.988311) compared with six typical artificial intelligence algorithms. Using LSTM-BPNN to calculate the SHAP value of each feature, the global results find that the receive-attack and serve-attack phases of the ending match have essential impacts on the mutual winning probabilities. Finally, case applications show that the SHAP can directly obtain each feature importance on one or more matches, which is more objective and reliable than the traditional simulation method. This research explores an innovative way to understand and analyze matches, and these results have implications for the performance analysis of table tennis and related racket sports.
| S-EPMC10352295 | biostudies-literature
Project description:BackgroundOver the course of evolution, insects have seen drastic changes in their mode of development. While insects with derived modes of development have been studied extensively, information on ancestral modes of development is lacking. To address this, we selected a member of one of the earliest lineages of extant flying insects, serving as an outgroup to the modern winged insects, the short germ, non-model mayfly Ephemera vulgata Linnaeus (Insecta: Ephemeroptera, Ephemeridae). We document the embryonic morphology throughout its development and establish a global temporal expression atlas.ResultsDAPI staining was used to visualise developmental morphology to provide a frame of reference for the sequenced timepoints. A transcriptome was assembled from 3.2 billion Illumina RNAseq reads divided in 12 timepoints with 3 replicates per timepoint consisting of 35,091 putative genes. We identified 6,091 significantly differentially expressed genes (DEGs) and analysed them for broad expression patterns via gene ontology (GO) as well as for specific genes of interest. This revealed a U-shaped relationship between the sum of DEGs and developmental timepoints, over time, with the lowest number of DEGs at 72 hours after egg laying (hAEL). Based on a principal component analysis of sequenced timepoints, overall development could be divided into four stages, with a transcriptional turning point around katatrepsis. Expression patterns of zld and smg showed a persistent negative correlation and revealed the maternal-to-zygotic transition (MZT), occurring 24 hAEL. The onset of development of some major anatomical structures, including the head, body, respiratory system, limb, muscle, and eye, are reported. Finally, we show that the ancestral short germ sequential mode of segmentation translates to a sequential Hox gene activation and find diverging expression patterns for lab and pb. We incorporate these patterns and morphological observations to an overview of the developmental timeline.ConclusionsWith our comprehensive differential expression study, we demonstrate the versatility of our global temporal expression atlas. It has the capacity to contribute significantly to phylogenetic insights in early-diverging insect developmental biology and can be deployed in both molecular and genomic applications for future research.
| S-EPMC11616370 | biostudies-literature
Project description:The problem of portfolio optimization is one of the most important issues in asset management. We here propose a new dynamic portfolio strategy based on the time-varying structures of MST networks in Chinese stock markets, where the market condition is further considered when using the optimal portfolios for investment. A portfolio strategy comprises two stages: First, select the portfolios by choosing central and peripheral stocks in the selection horizon using five topological parameters, namely degree, betweenness centrality, distance on degree criterion, distance on correlation criterion and distance on distance criterion. Second, use the portfolios for investment in the investment horizon. The optimal portfolio is chosen by comparing central and peripheral portfolios under different combinations of market conditions in the selection and investment horizons. Market conditions in our paper are identified by the ratios of the number of trading days with rising index to the total number of trading days, or the sum of the amplitudes of the trading days with rising index to the sum of the amplitudes of the total trading days. We find that central portfolios outperform peripheral portfolios when the market is under a drawup condition, or when the market is stable or drawup in the selection horizon and is under a stable condition in the investment horizon. We also find that peripheral portfolios gain more than central portfolios when the market is stable in the selection horizon and is drawdown in the investment horizon. Empirical tests are carried out based on the optimal portfolio strategy. Among all possible optimal portfolio strategies based on different parameters to select portfolios and different criteria to identify market conditions, 65% of our optimal portfolio strategies outperform the random strategy for the Shanghai A-Share market while the proportion is 70% for the Shenzhen A-Share market.
| S-EPMC5271336 | biostudies-literature
Project description:The Harris hawks optimization (HHO) algorithm is a new swarm-based natural heuristic algorithm that has previously shown excellent performance. However, HHO still has some shortcomings, which are premature convergence and falling into local optima due to an imbalance of the exploration and exploitation capabilities. To overcome these shortcomings, a new HHO variant algorithm based on a chaotic sequence and an opposite elite learning mechanism (HHO-CS-OELM) is proposed in this paper. The chaotic sequence can improve the global search ability of the HHO algorithm due to enhancing the diversity of the population, and the opposite elite learning can enhance the local search ability of the HHO algorithm by maintaining the optimal individual. Meanwhile, it also overcomes the shortcoming that the exploration cannot be carried out at the late iteration in the HHO algorithm and balances the exploration and exploitation capabilities of the HHO algorithm. The performance of the HHO-CS-OELM algorithm is verified by comparison with 14 optimization algorithms on 23 benchmark functions and an engineering problem. Experimental results show that the HHO-CS-OELM algorithm performs better than the state-of-the-art swarm intelligence optimization algorithms.
| S-EPMC9946268 | biostudies-literature
Project description:In data grids scientific and business applications produce huge volume of data which needs to be transferred among the distributed and heterogeneous nodes of data grids. Data replication provides a solution for managing data files efficiently in large grids. The data replication helps in enhancing the data availability which reduces the overall access time of the file. In this paper an algorithm, namely, EDRA using agents for data grid, has been proposed and implemented. EDRA consists of dynamic replication of hierarchical structure taken into account for the selection of best replica. Decision for selecting the best replica is based on scheduling parameters. The scheduling parameters are bandwidth, load gauge, and computing capacity of the node. The scheduling in data grid helps in reducing the data access time. The distribution of the load on the nodes of data grid is done evenly by considering scheduling parameters. EDRA is implemented using data grid simulator, namely, OptorSim. European Data Grid CMS test bed topology is used in this experiment. The simulation results are obtained by comparing BHR, LRU, No Replication, and EDRA. The result shows the efficiency of EDRA algorithm in terms of mean job execution time, network usage, and storage usage of node.
| S-EPMC3982471 | biostudies-other
Project description:Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous dynamic optimization problems although the majority of the real-life problems are combinatorial. Moreover, many algorithms shown to be successful in stationary combinatorial optimization problems commonly have mediocre performance in a dynamic environment. In this study, based on binary wolf pack algorithm (BWPA), combining with flexible population updating strategy, a flexible binary wolf pack algorithm (FWPA) is proposed. Then, FWPA is used to solve a set of static multidimensional knapsack benchmarks and several dynamic multidimensional knapsack problems, which have numerous practical applications. To the best of our knowledge, this paper constitutes the first study on the performance of WPA on a dynamic combinatorial problem. By comparing two state-of-the-art algorithms with the basic BWPA, the simulation experimental results demonstrate that FWPA can be considered as a feasibility and competitive algorithm for dynamic optimization problems.
| S-EPMC7049380 | biostudies-literature
Project description:Codon optimization in protein-coding sequences (CDSs) is a widely used technique to promote the heterologous expression of target genes. In codon optimization, a combinatorial space of nucleotide sequences that code a given amino acid sequence and take into account user-prescribed forbidden sequence motifs is explored to optimize multiple criteria. Although evolutionary algorithms have been used to tackle such complex codon optimization problems, evolutionary codon optimization tools do not provide guarantees to find the optimal solutions for these multicriteria codon optimization problems. We have developed a novel multicriteria dynamic programming algorithm, COSMO. By using this algorithm, we can obtain all Pareto-optimal solutions for the multiple features of CDS, which include codon usage, codon context, and the number of hidden stop codons. User-prescribed forbidden sequence motifs are rigorously excluded from the Pareto-optimal solutions. To accelerate CDS design by COSMO, we introduced constraints that reduce the number of Pareto-optimal solutions to be processed in a branch-and-bound manner. We benchmarked COSMO for run-time and the number of generated solutions by adapting selected human genes to yeast codon usage frequencies, and found that the constraints effectively reduce the run-time. In addition to the benchmarking of COSMO, a multi-objective genetic algorithm (MOGA) for CDS design was also benchmarked for the same two aspects and their performances were compared. In this comparison, (i) MOGA identified significantly fewer Pareto-optimal solutions than COSMO, and (ii) the MOGA solutions did not achieve the same mean hypervolume values as those provided by COSMO. These results suggest that generating the whole set of the Pareto-optimal solutions of the codon optimization problems is a difficult task for MOGA.
| S-EPMC7358382 | biostudies-literature