To date, several independent methods and algorithms exist exploiting constraint-based stoichiometric models to find metabolic engineering strategies that optimize microbial production performance. Optimization procedures based on metaheuristics facilitate a straightforward adaption and expansion of engineering objectives as well as fitness functions, while being particularly suited for solving problems of high complexity. With the increasing interest in multi-scale models and a need for solving advanced engineering problems, we strive to advance genetic algorithms, which stand out due to their intuitive optimization principles and proven usefulness in this field of research. A drawback of genetic algorithms is that premature convergence to sub-optimal solutions easily occurs if the optimization parameters are not adapted to the specific problem. Here, we conducted comprehensive parameter sensitivity analyses to study their impact on finding optimal strain designs. We further demonstrate the capability of genetic algorithms to simultaneously handle (i) multiple, non-linear engineering objectives, (ii) the identification of gene target-sets according to logical gene-protein-reaction associations, (iii) minimization of the number of network perturbations, and (iv) the insertion of non-native reactions, while employing genome-scale metabolic models. This framework adds a level of sophistication in terms of strain design robustness, which is exemplarily tested on succinate overproduction in Escherichia coli.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

Regeneration of lost tail is of great importance to lizards. Anolis carolinensis, a green lizard, is capable of regenerating its tail efficiently after autotomy. Hence, it is considered as a model organism in regeneration study. A. carolinensis shed its tail in order to distract the predator’s attention and thus makes a way to escape. Restoring of the amputated tail takes several days and the mechanism is currently clearly understood. Although save its life, tail regeneration is associated with the impairment of several vital functions in Anoles. In addition, various differences have been observed between original and regenerated tail in terms of mechanism and structure. To date, very little work has been conducted on tail autotomy and regeneration at molecular and genetic level. The genes responsible for regeneration in anoles are identified recently. These genes are evolutionarily conserved through all tetrapod vertebrates. They are, however, in a state of ‘switched-off’ in other vertebrates including humans. Consequently, a throughout study of these so called ‘switched-off’ genes may provide a way of restoring lost organs in human, and thus could revolutionize the modern medical science.

Oilseed plants of the Brassicaceae plant family are cultivated for food, feed and industrial purposes on large-scale in Europe. This review gives an overview of current market-oriented applications of new genomic techniques (NGTs) in relevant Brassicaceae oilseed crops based on a literature survey. In this respect, changes in oil quality, yield, growth and resistance to biotic and abiotic stress are goals in oilseed rape (B. napus) and camelina (C. sativa). Environmental risk assessment scenarios are developed for specific NGT applications in Brassicaceae oilseed crops with either a changed oil composition or with fitness related traits. In case of a changed oil composition an increase or decrease of polyunsaturated fatty acids (PUFA) demonstrates risks for health and survival of pollinators. In case of fitness related traits other risks were identified, i. e. an increased risk of spread and persistence of NGT plants. Furthermore, there are indications for potential disturbance of interactions with the environment, involving signalling pathways and reaction to stress conditions. It is shown that for a comprehensive risk assessment the technological potential of NGTs, the plants’ biology and the scale of releases have to be considered in combination. Therefore, the release of NGT plants into the environment for agricultural purposes will require risk assessment and monitoring of single traits as well as of combinatorial and long-term cumulative effects. In addition, risk management should develop concepts and measures to control and potentially restrict the scale of releases. This is especially relevant for NGT Brassicaceae in Europe which is a centre of diversity of this plant family.

This study is focused on an optimal sizing method based on genetic algorithms (GA) in order to design a high-performance photovoltaic system that would be installed in the Alioune Diop University of Bambey, Senegal. The multi-objective optimization allowed us to find a better trade- off between the Total Life Cycle cost (TLCC) and the Loss of Power Supply Probability (LPSP). The goal is to minimize the TLCC while maintaining a good satisfactory of the system with a desired LPSP, under certain constraints. The expressions of the TLCC and the LPSP are established according to the total photovoltaic energy and the battery capacity. The toolbox of Matlab software is used to implement the optimization problem with twelve blocks of the site and its different corresponding loads. The obtained results have led to a several combinations of the photovoltaic and battery capacities of which the best one is selected based on the lowest LPSP, that guaranteed a better load coverage during the night. The results of this proposed method are compared with intuitive method that has been firstly applied. For the block with the lowest load demand, the proposed optimization model leads to a reduction a reduction of 70% and 48% in the storage capacity and the TLCC respectively for a LPSP of 0.007 %.

The wetlands in northeastern Bangladesh are home to some of the most prolific and valuable ecosystems on the planet, offering a wide range of benefits to both the local and wider communities. A limited number of research on this topic have been carried out in various wetlands in coastal hilsa, but none have been located in the northeastern region of Bangladesh. Thus, the goal of this study was to better understand the most commercially relevant species (anadromous hilsa) in northeastern Bangladesh as well as to assess the wetland ecosystem services more thoroughly with the contribution of their fish genetic resources. In addition to laboratory studies, fieldwork was done in the fishing settlements along the Surma River, Hakaluki Haor, and Tanguar Haor. The study classified 77 fish species into 21 subcategories of ecosystem services, of which 56% were not threatened, 17% were vulnerable, and 10% were highly endangered. The species Hilsa was found to be the most economically significant, accounting for 1% of the GDP overall. The study determined if the hilsa stock of the examined wetlands maintains a single or several subpopulations in comparison to other parts of the country when they migrate from saline water to northeastern Bangladesh (freshwater). But when compared to other groups, the FST score was between 0.000 to 0.017, indicating that the populations are identical and that there is genetic material sharing between them. Additionally, these statistics imply that the Sylhet haor and adjacent river systems contain a single stock of Hilsa fish. Nevertheless, a number of stresses and risks, including overexploitation, illicit and destructive fishing, siltation, and natural disasters like flash floods, have been linked to changes in the supply of hilsa and other ecosystem services. This study also emphasizes the necessity of policy attention and research to address the concerns.

Clustering is a crucial at the same time challenging task in several application domains. It is important to incorporate the optimum feature finding into our clustering algorithms for getting better prediction accuracy but this is difficult when there is no or little information about the importance or relevance of features. To tackle this task in an efficient manner we employ the natural evolution process inherent in genetic algorithms (GA) to find the optimum features for clustering for the healthy aging dataset. In order to empirically verify the findings, genetic algorithms were combined with a number of clustering algorithms including parti-tional, density based as well as agglomerative. A variant of the popular KMeans algorithm, named KMeans++ gave the best performance on all performance metrics when combined with GA.

Water distribution networks are vital infrastructure, needed for providing consumers with sufficient water of appropriate quality. The cost of construction, operation, and maintenance of such networks is extremely large. The problem of optimization of a water distribution network is governed by the type of water distribution network and the size of pipelines placed in the distribution network. This problem of the optimal diameter allocation of pipes in a distribution network has been heavily researched over the past few decades. This study describes the development of a computer program, ‘Smart Optimization Program for Water Distribution Networks’ (SOP–WDN), which applies Genetic Algorithm to the problem of the least-cost design of water distribution networks. SOP–WDN demonstrates the application of an evolutionary optimization technique, Genetic Algorithm, linked with a hydraulic simulation solver EPANET, for the optimal design of water distribution networks. The developed program was applied to three benchmark water distribution network optimization problems and produced consistently good results. SOP–WDN can be utilized as a tool for guiding engineers during the design and rehabilitation of water distribution pipelines.

This study aims to automate the optimization of a Full-Range speaker in an SUV's audio system according to the equal loudness contours principle. The input signal, and frequency responses of the amplifier and speaker were transferred to Matlab. Using ideal filter parameters, ten parametric equalizer models were created, and the speaker output was obtained using the convolution technique. The same filter settings were applied to the vehicle multimedia system, and experimental results were obtained. The simulation and experimental results were compared, showing high similarity with a Pearson correlation coefficient of 0.9295 and an RMSE of 2.29. Results were compared with the ideal contour. The Pearson correlation coefficients for simulation and experimental results were 0.6341 and 0.6715, with RMSE values of 4.88 and 2.57, showing low similarity. Consequently, each parametric equalizer filter's parameters were optimized using a genetic algorithm. The optimized parameters were applied to the vehicle multimedia system, and results were compared with the ideal contour. The Pearson correlation coefficients for simulation and experimental results were 0.965 and 0.9661, with RMSE values of 2.12 and 1.48. These results indicate that optimization aligns the speaker output closer to the ideal contour, enhancing in-vehicle audio system performance and increasing user satisfaction.

The COVID-19 pandemic has emphasized the crucial role of ventilation systems in mitigating cross-infections, especially in infectious disease hospitals. This study introduces a dual-design operation ventilation system that can operate under two sets of ventilation conditions for normal and epidemic times. A challenge is optimizing duct diameters for required airflow while maintaining hydraulic balance. We design a genetic algorithm with adaptive penalty factor, the velocity constraint and the improved crossover and mutation probability. The improved genetic algorithm is suitable for ventilation system networks, which can find a better air duct diameters combination to improve the hydraulic balance rate, and reduce the usage of air valves, resulting in efficient hydraulic balancing commissioning. Compared with the traditional genetic algorithm, it has a faster search speed and a better global search ability, which is effective for the optimal design of ventilation system networks.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

Oligopeptide transporters (OPTs) are a group of membrane localized proteins that have a broad range of substrate transport capabilities and contribute to numerous biological processes. However, limited information has been reported on OPTs in higher plants. In this study, a comprehensive analysis of the OPT gene family in Medicago truncatula was performed. A total of 26 OPT genes (MtOPT01-MtOPT26) have been identified in the Medicago truncatula genome. Phylogenetic analyses indicated that MtOPTs consisted of two distinct subgroups, 12 MtOPTs belonged to the peptide transport subgroup (PT-OPT) based on their predicted amino acid sequences containing the two highly conserved motifs (NPG and KIPPR) and 14 MtOPTs belonged to yellow stripe subgroup (YS-OPT). The MtOPTs distributed on each of 8 chromosomes in Medicago truncatula. Sequence analysis verified that MtOPTs significant similar to those in other plants. The copy number of MtOPTs was low and the multiply of MtOPTs was simple relatively. Gene structure analysis showed that most of the MtOPTs have various numbers of introns. The multiple of MtOPTs might play different biological roles which were supported by the fact that MtOPTs have a distinct tissue-specific expression pattern. The data obtained in this study will help to better understand the complexity of the MtOPTs gene family and provide new evidence for the function and evolution of the OPT gene family in higher plants.

Hand gesture recognition has many valuable applications in engineering and health care. This study proposes a novel model which can accurately distinguish hand gestures using forearm muscles' surface electromyogram (sEMG) signals. A deep learning algorithm with hyper parameters impacting the final model’s accuracy and a convolutional neural network (CNN) were employed in the recognition stage. The number of convolutional layers, kernels per layer, and neurons in the dense layer were selected for optimization, while the remaining parameters, such as the learning rate, batch size, and number of epochs, were chosen based on trial and error and prior knowledge. The optimal values for the selected hyperparameters were obtained using a genetic algorithm to achieve maximum recognition accuracy. The UC2018 Dual-Myo database was used for training and testing the model based on EMG signals characterizing the activity of eight different hand gestures. The final structure of the model consisted of two convolutional layers with 131 and 28 kernels, a dense layer with 111 neurons, and a softmax layer with eight neurons. Upon optimizing the hyperparameters using the genetic algorithm, the accuracy of the proposed model increased from 91.86% to 96.4% at best and 95.3% on average in real-time applications and 99.6% in an offline mode. Future work is warranted towards improving the architecture and the computational cost.

This article introduces a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the hunting behavior of frilled lizards in their natural habitat. FLO draws in-spiration from the sit-and-wait strategy observed in frilled lizards during hunting. The underlying theory of FLO is presented and mathematically formulated in two phases: (i) an exploration phase, simulating the frilled lizard's attack towards prey, and (ii) an exploitation phase, simulating the lizard's retreat to the top of the tree after feeding. To assess FLO's efficacy in solving optimization problems, the algorithm's performance is evaluated across fifty-two standard benchmark functions, encompassing unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. Comparative analyses with twelve existing metaheuristic algorithms are conducted. The simulation results reveal that FLO, distinguished by its adeptness in exploration, exploitation, and balancing them during search process, outperforms competing algorithms. Additionally, FLO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems, demonstrating its effectiveness in addressing real-world optimization applications.

Breast cancer is a significant health issue across the world. Breast cancer is the most widely-diagnosed cancer in women; early-stage diagnosis of disease and therapies increase patient safety. This paper proposes a synthetic model set of features focused on the optimization of the genetic algorithm (CHFS-BOGA) to forecast breast cancer. This hybrid feature selection approach combines the advantages of three filter feature selection approaches with an optimize Genetic Algorithm (OGA) to select the best features to improve the performance of the classification process and scalability. We propose OGA by improving the initial population generating and genetic operators using the results of filter approaches as some prior information with using the C4.5 decision tree classifier as a fitness function instead of probability and random selection. The authors collected available updated data from Wisconsin UCI machine learning with a total of 569 rows and 32 columns. The dataset evaluated using an explorer set of weka data mining open-source software for the analysis purpose. The results show that the proposed hybrid feature selection approach significantly outperforms the single filter approaches and principal component analysis (PCA) for optimum feature selection. These characteristics are good indicators for the return prediction. The highest accuracy achieved with the proposed system before (CHFS-BOGA) using the support vector machine (SVM) classifiers was 97.3%. The highest accuracy after (CHFS-BOGA-SVM) was 98.25% on split 70.0% train, remainder test, and 100% on the full training set. Moreover, the receiver operating characteristic (ROC) curve was equal to 1.0. The results showed that the proposed (CHFS-BOGA-SVM) system was able to accurately classify the type of breast tumor, whether malignant or benign.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

Lumpy skin disease (LSD), caused by a virus within the Poxviridae family and Capripoxvirus genus, induces nodular skin lesions in cattle, spreading through direct contact and insect vectors, significantly affecting global cattle farming. Despite available vaccines, their effectiveness is limited by poor bioavailability and adverse effects. Our study aimed to identify potential inhibitors targeting LSD-associated DNA polymerase protein, selecting LSDV039 for further investigation through comprehensive analysis and computational methods. Virtual screening revealed rhein and taxifolin as potent binders among 380 phytocompounds, with respective affinities of -8.965 and -7.195 kcal/mol. Canagliflozin and tepotinib exhibited strong affinities (-9.858 and -8.856 kcal/mol) among 718 FDA-approved antiviral drugs. Molecular dynamics simulations of canagliflozin, tepotinib, rhein, and taxifolin highlighted taxifolin's superior stability and binding energy. Rhein displayed compactness in RMSD and RMSF but fluctuations in Rg and SASA, while canagliflozin demonstrated stability compared to tepotinib. The study highlights the promising potential of repurposed drugs and phytocompounds as LSD therapeutics. However, extensive validation through in-vitro, in-vivo, and clinical trials is crucial for their practical application.

Improper design of friction pendulum bearings can lead to poor seismic reduction performance and may result in the failure of local vulnerable components. And the parameter design of friction pendulum bearings mainly relies on experience and verification calculations at present. This paper proposes an adaptive genetic algorithm considering the overall evolution state of the population, adjusting crossover and mutation probabilities adaptively based on individual fitness and population diversity. Compared to traditional algorithms, it exhibits better global search capabilities and convergence efficiency. Combining the improved genetic algorithm with finite element models, a parameter optimization method is proposed. The parameters of friction pendulum bearings are optimized, providing reference for the design of seismic isolation devices.

This study will lead to the development of a numerical data set that will assist in the design of Savonius wind turbines. A major objective of this study is to develop a better design for Savonius turbine blades in order to increase their torque coefficients, rotational speeds, and pressure coefficients. As part of the experimental design methodology, a full dataset was generated by simulating three-dimensional scale models utilizing computational fluid dynamics (CFD) simulations that were validated by wind tunnel data. This process is multi-objective optimization for optimizing turbine performance. The twist angle, aspect ratio, and overlap ratio are all important factors in determining the optimal torque and power coefficients. The group method of data handling (GMDH) algorithm was utilized to model objective functions based on input-output data. The Pareto fronts were plotted using polynomial models obtained from the evolutionary Pareto-based optimization approach (modified NSGA-II), and the optimal commercial points were determined using TOPSIS. A comparison of three- and two-objective optimization data revealed that two-objective optimization data lie within the boundaries of a three-objective optimization problem. The torque coefficient, rotational speed, and power coefficient are all improved by 13.74%, 0.071%, and 5.32%, respectively, using multi-objective optimization. As a result of the multi-objective optimization of the turbine, some significant characteristics of objective functions were discovered.

Abstract: A. baumannii exhibits resilience in harsh environments and progressively develops resistance to diverse antibacterial agents over time. This adaptability poses a significant challenge in treating an infection caused by this bacterium within healthcare settings. The presence of peptidoglycan, a crucial precursor for cell wall synthesis, contributes to this challenge. Peptidoglycan serves not only as a structural support in bacterial cells but also provides protection against adverse environmental conditions. The synthesis of the peptidoglycan layer involves a group of substrates such as N-acetylglucosamine (GlcNAc) and N-acetylmuramic acid (MurNAc), within a three-partitioned process occurring in the membrane, periplasmic space, and cytoplasm of each bacterium. Initiated in the cytoplasm and extending to the inner cell membrane, this synthesis starts with the production of nucleotide precursors. The first step involves the synthesis of UDP-GlcNAc, orchestrated by Glm (GlmS, GlmM, and GlmU) enzymes using fructose-6-phosphate. Subsequently, enzymes from the Mur family, namely MurB, MurA, MurD, MurC, MurI, MurF, and MurE, synthesize UDP-N-acetylmuramyl-pentapeptide (UDP-Mpp) from UDP-GlcNAc. Concurrently, on the cytosolic side, the production of membrane-surrounded undecaprenyl phosphate occurs, involving membrane-side proteins MraY and MurG in the biosynthesis of peptidoglycan. This review emphasizes updated information on Mur family proteins, encompassing physicochemical properties, nature of binding site, number and type of binding site residues, functional domain details, three-dimensional structural aspects, and their functions within bacterial cells. Special attention is directed towards their enzymatic role in peptidoglycan biosynthesis due to the limited availability of precursors in the market. Additionally, the review provides a comprehensive summary of existing inhibitors and ongoing efforts in identifying new targeted inhibitors, recognizing these enzymes as potential candidates for antibacterial drug design and discovery.

Many types of banana (Musa spp.)—one of the most economically important horticultural crops—exist, and their ploidy (diploid, triploid, and tetraploid, usually) and genome types (containing A or/and B genome in most cases) differ. At present, observation and genome type detection are commonly used to identify banana germplasm resources. However, the former is tedious, while the latter cannot distinguish categories below genome types. It is therefore urgent that a simple and effective method for identifying banana germplasm resources is established. We sequenced and analyzed the ribosomal DNA internal transcribed spacer (ITS) sequences of 62 banana germplasm and found that the sequencing peaks, especially the 20 bp region near the 420 bp position (referred to as the “420 bp region”), exhibited relatively recognizable and repeatable polymorphism characteristics. Using the “420 bp region” as a marker, we were able to quickly distinguish bananas belonging to different genome type groups (comprising the AA, AB, AAA, ABB, AAB, ABBB, AAAB, and AAAA groups) or different subgroups in the same genome type group (for example, the Cavendish, Gros Michel, Red, Lakatan, and Ibota Bota subgroups in the AAA group; and the Pisang Raja, Plantain, Pome and Silk subgroups in the AAB group). Moreover, it appeared that Sanger sequencing of ITS could be used for identifying banana hybrid offspring. These results demonstrated that the banana ITS region contains rich genetic information that is useful for genotyping. In general, ITS sequencing simplifies the classification of banana germplasm resources and has potential application in several areas of Musa improvement.

The multiobjective optimization problem is a key research direction in the field of optimization. Based on the multivariant optimization algorithm (MOA), this paper puts forward a multiobjective multivariant optimization algorithm (MMOA). A good point set is adopted for population initialization and to ensure the homogeneity of the initial solution set and avoid prematurity; global atoms are acquired by non-dominated sorting and an external archiving strategy; a nonlinear search radius is designed to balance global and local searches and enhance the convergence precision of the algorithm. Levy Flight and Sine chaotic mapping are introduced to redesign the update formula for local atoms, increase the convergence rate of the algorithm, and boost the optimization efficiency. Comparative experiments are conducted between MMOA and NSGA-II, MOEA/D, NSWOA, MOGWO, NSMFO on multiobjective test functions and an engineering example. The simulation results show that MMOA has superior convergence and diversity to the other five algorithms.

Climate change, growing world population and increasing food demand require higher yields and adaptability of crops, including spring bread wheat. Modern plant breeding based on achievements of genetics has a significant impact on plant resistance to diseases, climate variability and other factors. Genome wide association studies (GWAS) is one of genetics tools for mining of genome loci associated with economically important traits. In the current study, we applied GWAS to reveal QTL for spike productivity and grain quality using a panel of spring varieties of Triticum aestivum L. bred in different decades of the last century in Russia and Germany. The study has enabled to find new genetic markers associated with grain yield and quality. Studying genetic basis of grain yield and quality by comparison of wheat varieties from different breeding periods, including landraces preserved as the source of valuable genetic diversity for breeding and genetic studies, makes it possible not only to understand selection processes in the past, but also to develop strategies for future breeding work.

Several recent studies have indicated that miR-30a plays critical roles in various biological processes and diseases. However, the mechanism of miR-30a participation in the regulation of idiopathic pulmonary fibrosis (IPF) is ambiguous. Our previous study demonstrated that miR-30a may function as a novel therapeutic target for lung fibrosis by blocking mitochondrial fission, which is dependent on dynamin-related protein-1 (Drp-1). However, the regulatory mechanism between miR-30a and Drp-1 has yet to be investigated. In addition, whether miR-30a can act as a potential therapeutic has not been verified in vivo. In this study, the miR-30a expression in IPF patients was evaluated. Computational analysis and a dual luciferase reporter system assay were used to identify the target gene of miR-30a, and cell transfection was used to confirm this relationship. Ten-eleven translocation 1 (TET1) was validated as a direct target of miR-30a, and the transfection of miR-30a mimic/inhibitor significantly reduced/increased the expression of TET1 protein. Further experiment verified that the interference on TET1(siRNA) could inhibit the hydroxymethlation of the Drp-1 promoter. Finally, miR-30a agomir was designed and applied to identify and validate the therapeutic effect of miR-30a in vivo. Our study demonstrated that miR-30a could inhibit the TET1 expression by base pairing with complementary sites in the 3′ untranslated region to regulate the hydroxymethlation of the Drp-1 promoter. Furthermore, miR-30a could act as a potential therapeutic target for IPF.

Drying food involves complex physical atmospheric mechanisms with non-linear relations from the air-food interactions and those relations are strongly dependent on the moisture contents and the type of food. Such dependence makes it complex to design suitable dryers dedicated to a single drying process. To streamline the design of a novel compact food-drying machine, a heat pump dryer component design optimization algorithm was developed as a subprogram of a Computer Aided Engineering tool. The algorithm requires inputting food and air properties, the volume of the drying container and the technical specifications of the heat-pump off-the shelf components. The heat required to dehumidify the food supplied by the heat exchange process from condenser to evaporator, and the compressor’s requirements (refrigerant mass flow rate and operating pressures) are then calculated. Compressors can then be selected based in the volume and type of food to be dried. The algorithm is shown via a flow chart to guide the user through 3 different stages: Changes in drying air properties, Heat flow within dryer and Product moisture content. Example results of how different compressors are selected for different type of produces and quantities (Agaricus Blazei mushroom with 3 different moisture contents or fish from Thunnini tribe) conclude this article.

Injury to the peritoneum during surgery is followed by a healing process that frequently results in the attachment of adjacent organs by a fibrous mass, referred to commonly as adhesions. Because injuries to the peritoneum during surgery are inevitable, one must understand the mechanisms of adhesion formation to prevent its occurrence. This requires a thorough understanding of the molecular sequence that results in the attachment of injured peritoneum and the development of fibrous tissue. Recent data show that fibroblasts from the injured peritoneum may play a critical role in forming adhesion tissues. Therefore, identifying changes in gene expression patterns in the peritoneal fibroblasts during the process may provide clues to the mechanisms by which adhesion develops. This review presents many papers discussing genes implied in peritoneal adhesion.

Rett Syndrome (RTT) is a severe neurodevelopmental disorder predominately diagnosed in females and primarily caused by pathogenic variants in the X-linked gene Methyl-CpG Binding Protein 2 (MECP2). Most often, the disease causing MECP2 allele resides on the paternal X chromosome while a healthy copy is maintained on the maternal X chromosome with inactivation (XCI) resulting in mosaic expression of one allele in each cell. Preferential inactivation of the paternal X chromosome is theorized to result in reduced disease severity; however, establishing such a correlation is complicated by known MECP2 genotype effects and an age dependent increase in severity. To mitigate these confounding factors, we developed an age- and genotype-normalized measure of RTT severity by modeling longitudinal data collected in the US Rett Syndrome Natural History Study. This model accurately reflected individual increase in severity with age and preserved group-level genotype specific differences in severity allowing for the creation of a normalized clinical severity score. Applying this normalized score to a RTT XCI dataset revealed that XCI influence on disease severity depends on MECP2 genotype with a correlation between XCI and severity observed only in individuals with MECP2 variants associated with increased clinical severity. This normalized measure of RTT severity provides the opportunity for future discovery of additional factors contributing to disease severity that may be masked by age and genotype effects.

Probiotics are microorganisms infused in products for health benefits including acceleration of nutrient digestion, however, it is also important to ensure the safety prior to incorporation. Here, we present evidence of the ability of two probiotic isolates,Lacticaseibacillus paracasei BCRC-16100 and Lacticaseibacillus paracasei ZFM54, in the (1) enhancement of carbohydrate digestion, (2) tolerance to stress, and (3) antibiotic resistance. Approaches include whole genome sequence (WGS) analysis and bioactivity assays. WGS revealed genes suggesting the ability of the two isolates to promote carbohydrate digestion, tolerance to stress and antibiotic resistance. Carbohydrate digestive ability was confirmed through a biochemical assay where the two isolates cause glucose release from starch. The two isolates also showed versatility in a range of temperature and alcohol concentration. For antibiotic resistance particularly on vancomycin, there are three mechanisms namely transporter control, transcriptional regulation, and efflux pump. Furthermore, promoter and transposable element analysis showed that some of the active antibiotic resistant (AbR) genes can be laterally transferred. Altogether, we show the potential of two probiotic isolates to be incorporated in products for improved carbohydrate digestion and the need to address the removal of active and mobile antibiotic resistance genes that may compromise safety.

A novel metaheuristic optimization method is proposed based on an earthquake that is a geology phenomenon. The novel Earthquake Algorithm (EA) proposed, adapts the principle of propagation of geology waves P and S through the earth material composed by random density to ensure the dynamic balance between exploration and exploitation, in order to reach the best solution to optimization complex problems by searching for the optimum into the search space. The performance and validation of the EA are compared against the Bat Algorithm (BA) and the Particle Swarm Optimization (PSO) by using 10 diverse benchmark functions. In addition, an experimental engineering application is implemented to evaluate the proposed algorithm. Early results show a feasibility of the proposed method with a clearly constancy and stability. It is important highlight the fact that the main purpose of this paper is to present a new line of research, which is opened from the novel EA.

Drosophila melanogaster serves as a important research model both for genetic investigations and for the study of metal toxicity, facilitating the elucidation of physiological mechanisms comparable to those of human organisms. In our research, we evaluated the toxicity effect resulting from exposure to various concentrations of lead and copper on the prolificity rates throughout the life cycle (egg-adult) of four genotypes of Drosophila melanogaster: wild-type (control), white, brown, and white-vestigial. During our study, the prolificity rates were examined across three repetitions under the impact of exposure to concentrations of 0.50, 1.00, 2.00, and 4.00 mM of copper (CuSO₄) and lead (Pb(C₂H₃O₂₎₂). Prolificity rates throughout the life cycle exhibited variations as a direct consequence of genetic factors, the concentration of exposure, and the specific type of metal, either copper or lead. The mutant white-vestigial genotype revealed an IC₅₀ concentration for prolificity inhibition at lower doses of 2.00 mM for copper and 4.00 mM for lead, in contrast to the control genotype (wild-type), which exhibited an inhibition concentration rate >IC₅₀ of 4.00 mM only in the case of copper. Our results concluded that the (i) dose influences the prolificity rate in a directly proportional manner, (ii) comparative analyses between copper and lead revealed that copper displayed toxicity across all genotypes within the concentration range of 0.50 mM to 2.00 mM. In contrast, lead exhibited toxicity within the concentration range of 1.00 mM to 4.00 mM, highlighting a (iii) more acute toxicity characteristic in the case of copper. Thus, the results of this research reflect the importance of using Drosophila melanogaster as a genetic model in the comparative study of the interaction between genetic factors and the toxicity of metals, offering significant insights into monitoring their impact and defining the maximum permissible doses on organisms.

This study presents a groundbreaking approach in the field of gaming AI, focusing on the classic game” Pacman” through the lens of DRL integrated with advanced optimization techniques. The core of the research involves adapting DRL models for” Pacman”, utilizing the ESO for hyper- parameter tuning. These novel adaptations significantly enhance the AI agent’s performance, demonstrating a remarkable improvement in adaptability, responsiveness, and efficiency within the game environment. A pivotal aspect of this research is the innovative integration of metaheuristic optimization techniques into the DRL framework, a first in the domain of Atari gaming AI. This integration has proven essential in fine-tuning the DRL models, leading to a more effective and dynamic gaming experience. The study thoroughly evaluates and compares the performance of these algorithms, providing empirical support for their effectiveness and setting a new benchmark in AI-driven game development. The implications of this research extend beyond gaming AI, opening up possibilities for future exploration in several directions. Expanding DRL models to other complex gaming environments, continuous algorithmic enhancements, real-time learning adaptations, and applying these principles to robotics and autonomous vehicles are examples. The research also emphasizes ethical and responsible AI use in gaming to address fairness and addiction issues.

To achieve an acceptable level of security on the web, the Completely Automatic Public Turing test to tell Computer and Human Apart (CAPTCHA) was introduced as a tool to prevent bots from doing destructive actions such as downloading or signing up. Mobile devices have small screens, and therefore, using the common CAPTCHA methods (e.g. text CAPTCHAs) in these devices raises usability issues. To introduce a reliable, secure, and usable CAPTCHA that is suitable for mobile devices, this paper introduces a hand gesture recognition CAPTCHA based on applying Genetic Algorithm (GA) principles on Multi-Layer Perceptron (MLP). The proposed method improves the performance of MLP-based hand gesture recognition. It has been trained and evaluated on 2201 videos of the IPN Hand dataset, and MSE and RMSE benchmarks report the index values of 0.0018 and 0.0424, respectively. Comparison with the related works shows a minimum of 1.79% fewer errors, and experiments produced a sensitivity of 93.42% and accuracy of 92.27% – 10.25% and 6.65% improvement compared to the MLP implementation.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

Fourteen Russian potato cultivars (cvs.) grown for three years in field plots of VIR (Northwestern region of the Russian Federation) were evaluated for productivity and a number of biochemical parameters of tubers. The 12 parameters that have been evaluated in tubers annually one month after harvesting and after cold storage (at 2 - 4°C) include the content of dry matter, starch, protein, ascorbic acid, carotenoids and β-carotene, anthocyanins, total sugars and monosaccharides (reducing sugars), phenolic compounds, as well as total acidity, and antioxidant activity. The cultivars differed significantly in productivity and biochemical composition of tubers. Dry matter content ranged from 16.40% in cv. ʻKumachʼ to 27.28% in ʻNayadaʼ, starch content ranged from 8.96 % in cvs. ʻFioletovyjʼ, ʻKumachʼ to 20.08% in ‘Sokur’, the total sugar content reached 2.46% in cv. ʻSiverskij’ whereas ‘Sokur’ has the smallest content of reducing sugars in post-harvest tubers. Protein content ranged from 1.02% to 2.77% with the highest accumulation in cv. ʻSokurʼ. Content of ascorbic acid (vitamin C) ranged from 6.3 mg/100 g FW in ʻKrasa Meŝeryʼ to 26.6 mg/100 g FW in cv. ʻKrasavchikʼ. Carotenoids content ranged from 0.157 mg/100 g FW in cv. ‘Nayada’ to 0.645 mg/100 g FW in cv. ʻGrandʼ. Content of anthocyanins in potato ranged from 1.04 mg/100g FW (not colored tubers of cv. ʻKrasa Meŝeryʼ) to 283.04 mg/100g FW (colored tubers of cv. ʻFioletovyiʼ). The nutritional value of tubers (content of dry matter, sugars, starch and protein) was determined to a greater extent (38-49%) by varietal characteristics, rather than by meteorological conditions in vegetation period. The content of vitamin C, carotenoids, protein and anthocyanins varied depending on the year. The highest content of dry matter, starch and carotenoids was noted in tubers harvested in 2019, marked by low temperatures and precipitation deficit in growing season. The conditions of 2020 with low temperatures and excess precipitation were the most favorable for anthocyanin’s accumulation in potato tubers while not for other biochemical parameters. Of the cultivars, ʻSokurʼ had the highest content of dry matter, protein and starch. Cv. ʻFioletovyiʼ had small starch content and high level of anthocyanins. Cv. ʻPlamyaʼ can be recommended for potato products manufacturing due to dry matter content above 20% and reducing sugars content 0.24%..

This study is based on the BP neural network regression model optimised by genetic algorithm and dedicated to predicting the amount of car purchase, this study is important for all parties in the automotive industry. By plotting the violins of six indicators, including gender, age, annual salary, credit card debt, net worth, and car purchase amount, we found that, except for gender, the other data showed a trend of dense in the middle gradually decreasing to the upper and lower sides, with an overall normal distribution. The correlation analysis shows that the amount of car purchase has a high positive correlation with age (0.63), followed by annual income (0.62), the correlation between net worth and the amount of car purchase is 0.49, while the correlation between credit card debt and the amount of car purchase is low (0.03). In the experimental part, we analyse the predicted-actual values of the training and test sets in comparison and find that the model predicted values are very close to the actual values. The RMSE of the training set is 11.559 and the RMSE of the test set is 11.4835, which is not much different from each other, indicating that the model has good generalisation ability. In addition, the R2 of both the training and test sets is 1, indicating that the model fits well. The MAE of the training set is 8.2512 and the MAE of the test set is 9.578; the MBE of the training set is -4.3035 and the MBE of the test set is -2.4547.These metrics indicate that the model performs well in predicting the amount of car purchase. In conclusion, this study provides an effective and reliable method to predict the amount of car purchase, creating a useful bridge between car manufacturers, dealers and consumers.

Human papillomavirus (HPV) uses the cellular trafficking machinery to reach the cell nucleus and initiate a successful infection. The HPV capsid consists of two proteins: L1 (the major capsid protein) and L2 (minor capsid protein), and L2 is known to be responsible for trafficking the viral genome to the nucleus. From previous studies, we know that many cellular proteins interact with L2 and are involved in the trafficking process at different stages of the infectious entry process. To further investigate how HPV-16 achieves successful viral entry, we have performed a mass spectrometry analysis to identify novel interacting proteins that associate with incoming HPV-16 virions. We show that HPV-16 pseudovirions interact with a group of cellular cargo proteins (COPI), and here we confirm that this is mediated by the direct binding of L2, but not L1, to the COPB1 subunit. We also show that the ability of L2 to interact with COPB1 is conserved in both low- and high-risk HPV types. Furthermore, we also show that the interaction is essential for successful infection entry of multiple HPV types, thereby identifying a novel constituent of the infectious entry pathway of the HPV.

This article describes the choice of an optimization algorithm for solving problems and the optimal design of an unmanned aerial vehicle propeller. To solve the problem using evolutionary algorithms, it was transformed into an unconstrained optimization problem using a penalty function. The airfoil contours were constructed using a Bezier curve. Design variables were divided into two types: those that describe in general terms the propeller geometry or operation, such as propeller diameter, number of blades, and rev/min; and those that vary with propeller radius, such as chord length, effective airfoil angle, and airfoil geometry. The objective function is the calculation of the propeller power required to achieve a given thrust. The differential evolution algorithm was used to solve this problem.

In this paper, we implement a new method binary Particle Swarm Optimization (PSO) for solving the kidney exchange problem, which will improve the future decisions of kidney exchange programs. Because using a kidney exchange, we can help incompatible patient-donor couples to swap donors to receive a compatible kidney. Kidney paired donation programs provide an innovative approach for increasing the number of available kidneys. Further, we implementing binary particle swarm optimization in parallel with MATLAB with one, two, three and four threads and from the computations point of view, the authors compare the performance to reduce the running time for kidney exchange to match patients as fast as possible to help clinicians. Moreover, implementing binary particle swarm optimization in solving the kidney exchange problem is an effective method. The obtained results indicate that binary PSO outperforms other stochastic-based methods such as genetic algorithm, ant lion optimization, and efficient the number of resulting exchanges.

Corrugated board, widely used in the packing industry, is a recyclable and durable material. Its strength and cushioning, influenced by geometry, environmental conditions like humidity and temperature, and paper quality, make it versatile. Double-walled (or five-ply) corrugated board, comprising two flutes and three liners, enhances these properties. This study introduces a novel approach to analyze 5-layered corrugated board, extending a previously published algorithm for single-walled boards. Our method focuses on measuring layer and overall board thickness, flute height, and center lines of each layer. Integrating image processing and genetic algorithms, the research successfully developed an algorithm for precise geometric feature identification of double-walled boards. Images were recorded using a special device with a sophisticated camera and image sensor for detailed corrugated board cross-sections. Demonstrating high accuracy, the method faced limitations only with very deformed or damaged samples. This research contributes significantly to quality control in the packaging industry and paves the way for further automated material analysis using advanced machine learning and image sensors. It emphasizes the importance of sample quality and suggests areas for algorithm refinement to enhance robustness and accuracy.

In recent years, several industries have registered an impressive improvement in technological advances such as Internet of Things (IoT), e-commerce, vehicular networks, etc. These advances have sparked an increase in the volume of information that gets transmitted from different nodes of a computer network (CN). As a result, it is crucial to safeguard CNs against security threats and intrusions that can compromise the integrity of those systems. In this paper, we propose a machine mearning (ML) intrusion detection system (IDS) in conjunction with the Genetic Algorithm (GA) for feature selection. To assess the effectiveness of the proposed framework, we use the NSL-KDD dataset. Furthermore, we consider the following ML methods in the modelling process: decision tree (DT), support vector machine (SVM), random forest (RF), extra-trees (ET), extreme gradient boosting (XGB), and naïve Bayes (NB). The results demonstrated that using the GA algorithm has a positive impact on the performance of the selected classifiers. Moreover, the results obtained by the proposed ML methods were superior to existing methodologies.

Flood routing in flood forecasting issue, calculation the height of flood bands, determining the river boundaries, and estimation of protective facilities for flood –exposed building is applicable. In many cases, due to the lack of measuring stations, the status of the upstream flood generating hydrograph is not known. The purpose of this study is to present an integrated method comprising of an optimization model and a hydrodynamic numerical model for flood modeling to determine the upstream hydrograph using the provided hydrograph at the downstream measuring station of a river. The routing procedure consists of three steps: (1) generating a hypothetical upstream hydrograph using genetic algorithm method; (2) hydrodynamic modeling using a numerical simulation model for flood routing according to the hypothetical hydrograph which is generated in the first step; (3) compare the calculated and observed hydrograph in downstream by using a fitness function. This recommended procedure was named as Reverse Flood Routing Method (RFRM) and was then applied to Karun River, the largest river in Iran. Comparing the generated upstream hydrograph by the RFRM model with the corresponding measured hydrograph at Ahvaz hydrometric station, as an ungauged river location, shows the high accuracy of the recommended model in this study.

Optimization using Genetic Algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover is an essential operator of the Genetic Algorithm. It has been an active area of research to develop sustainable forms for this operand. In this work, a new crossover operand is proposed. This operand depends on giving an elicited description for the chromosome with a new structure for alleles of the parents. It is suggested that each allele has two attitudes, one attitude differs contrastingly with the other, and both of them complement the allele. Thus, in case of one attitude is good, the other should be bad. This is suitable for many systems which contain admired parameters and unadmired parameters. The proposed crossover would improve the desired attitudes and damp the undesired attitudes. The proposed crossover can be achieved in two stages: the first stage is a mating method for both attitudes in one parent to improving one attitude at the expense of the other. The second stage comes after the first improvement stage for mating between different parents. Hence, two concurrent steps for improvement would be applied. Simulation experiments for the system shows improvement in the fitness function. The proposed crossover could be helpful in different fields, especially to optimize routing algorithms and network protocols, an application that has been tested as a case study in this work.

Real-world optimization problems are often gov- erned by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Opti- mization Problems (COPs) fueled by advances in computational power. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose a novel hybrid Evolutionary Algorithm based on the Differential Evolution algorithm and Adaptive Parameter Gaining Sharing Knowledge-based algo- rithm to solve global real-world constrained parameter space. The proposed CHAGSKODE algorithm leverages the power of multiple adaptation strategies concerning the control parameters, search mechanisms, as well as uses knowledge sharing between junior and senior phases. We test our method on the benchmark functions taken from the CEC2020 special session & competition on real-world constrained optimization. Experimental results indicate that CHAGSKODE is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

Of all the renewable energy sources, solar photovoltaic (PV) power is estimated to be a popular source due to several advantages such as its free availability, absence of rotating parts, integration to building such as rooftops, and less maintenance cost. The nonlinear current-voltage (I–V) characteristics and power generated from a PV array primarily depend on solar insolation/irradiation and panel temperature. The extracted PV output power is influenced by the accuracy with which the nonlinear power–voltage (P–V) characteristic curve is traced by the maximum power point tracking (MPPT) controller. In this paper, a bio-inspired roach infestation optimization (RIO) algorithm is proposed to extract the maximum power from the PV system (PVS). To validate the usefulness of the RIO MPPT algorithm, MATLAB/Simulink simulations are performed under varying environmental conditions, for example, step changes in solar irradiance, and partial shading of the PV array. Furthermore, the search performance of the RIO algorithm is examined on different unconstrained benchmark functions, and it is that realized that the RIO algorithm has improved convergence characteristics in terms of finding the optimal solution than Particle swarm optimization (PSO). The results demonstrated that the RIO-based MPPT performs remarkably in tracking with high accuracy as the PSO-based MPPT.

A Demand-side management technique are deployed along with battery energy-storage systems (BESSs) to lower the electricity cost by mitigating the peak load of a building. Most of the existing methods rely on manual operation of the BESS, or even an elaborate building energy-management system resorting to a deterministic method that is susceptible to unforeseen growth in demand. In this study we propose a real-time optimal operating strategy for BESS based on density demand forecast and stochastic optimization. This method takes into consideration uncertainties in demand when accounting for an optimal BESS schedule, making it robust compared to the deterministic case. The proposed method is verified and tested against existing algorithms. Data obtained from a real site in South Korea is used for verification and testing. The results show that the proposed method is effective, even for the cases where the forecasted demand deviates from the observed demand

Glioblastoma (GBM) is the most common malignant brain tumor in adults. Despite advancements in treatment, the prognosis for patients with GBM remains poor due to its aggressive nature and resistance to therapy. CRISPR-based genetic screening has emerged as a powerful tool for identifying genes crucial for tumor progression and treatment resistance, offering promising targets for tumor therapy. In this review, we provide an overview of the recent advancements in CRISPR-based genetic screening approaches and their applications in GBM. We highlight how these approaches have been used to uncover genetic determinants of GBM progression and susceptibility to various therapies. Furthermore, we discuss ongoing challenges and future directions of CRISPR-based screening methods in advancing GBM research.

The corrugated board is a versatile and durable material that is widely used in the packaging industry. Its unique structure provides strength and cushioning, while its recyclability and bio-degradability make it an environmentally friendly option. The strength of corrugated board depends on many factors, including the type of individual papers on flat and corrugated layers, the geometry of the flute, temperature, humidity, etc. This paper presents a new approach to analysis geometric features of corrugated boards based on the images. It allows for precise determination of the geometry of the corrugated layer, as well as the thickness of individual papers in all cardboard layers. The experimental set used in the work and the created software are characterized by high reliability and precision of measurement thanks to the use of an identification procedure based on image analysis and evolutionary algorithms. This allows to quickly find the main geometric characteristics of the corrugated board, which in turn leads to the possibility of performing numerical analyzes taking into account the real model of the corrugated board. Calculations made on a real (correctly mapped geometrically) model allow, for example, a more reliable analysis of the composition of the cardboard, and thus also to obtain greater savings in the optimization process.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

Computer network attacks are evolving in parallel with the evolution of hardware and neural network architecture. Despite major advancements in Network Intrusion Detection System (NIDS) technology, most implementations still depend on signature-based intrusion detection systems, which can’t identify unknown attacks. Deep learning can help NIDS to detect novel threats since it has a strong generalization ability. The deep neural network’s architecture has a significant impact on the model’s results. We propose a genetic algorithm based model to find the optimal number of hidden layers and the number of neurons in each layer of the deep neural network (DNN) architecture for the network intrusion detection binary classification problem. Experimental results demonstrate that the proposed DNN architecture shows better performance than classical machine learning algorithms at a lower computational cost.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

Directional Modulation (DM) technique, as an emerging promising approach to secure wireless communications, has been attracting increasing attention for its unique characteristic in the past decade. The baseband signal is synthesized at the antenna level for maintaining the standard constellation format along the prescribed direction(s) while simultaneously distorting the signal constellations in other undesired directions. In this paper, we present a novel DM signal synthesis method based on phased array using a hybrid genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, which takes advantages of both GA and PSO algorithm. Then, the bit error rate of the proposed method is analyzed and simulated. Simulation results are presented to verify that the proposed DM signal have a narrower information beam-width. Therefore, it can offer a better physical layer security (PLS) performance compared with the conventional directional modulation signal.

In this paper, a multi-patch weakly singular isogeometric boundary element method (WSIGABEM) for two-dimensional elastostatics is proposed. Since the method based on the weakly singular boundary integral equation, the quadrature techniques, dedicated for the weakly singular and regular integrals, are applied in the method. A new formula for the generation of collocation points is suggested to take the full advantage of the multi-patch technique. The generated collo-cation points are essentially inside the patches without any correction. If the boundary conditions are assumed to be continuous in every patch, no collocation point lies on the discontinuous boundaries, thus simplifying the implementation. The multi-patch WSIGABEM is verified by the simple examples with analytical solutions. The feature of the present multi-patch WSIGABEM is investigated by the comparison with the traditional IGABEM. Furthermore, the combination of the present multi-patch WSIGABEM and the particle swarm optimization algorithm results in a shape optimization method in two-dimensional elastostatics. By changing some specific control points and their weights, the shape optimizations of the fillet corner, the spanner and the arch bridge are verified to be effective.

Blasting pattern optimization is an attempt to optimize blast design parameters aiming to achieve optimum fragmentation, reduce mining operating costs as well as environmental side consequences. The present study aims to propose a multi-objective optimization model, employing artificial intelligence and metaheuristics, to simultaneously minimize the mine-to-crusher operating costs and the impact of blasting consequences including fly-rock and back-break. To achieve the purpose of the study, a multi-variable regression model was developed to model total costs from drilling to crushing. In addition to the costs, multilayer perception neural networks were implemented to predict the blast-induced back-break and fly-rock as a function of collected variables such as number of holes, hole length, burden, spacing, hole slope, stemming, blasted rock per hole, powder factor, and charge per delay. High-precise estimations for both back-break and fly-rock were achieved with the average of 99% coefficient of determination for train, test and validation data sets. Then, the developed regression model and the neural networks were used in an optimization framework, employing Grasshopper algorithm, to find the optimum blast design satisfying practical constraints. The proposed model was tested on a lead-zinc open-pit mine, where 1032 blasting patterns were recorded and analyzed. The results of the optimization model provide a Pareto set of solutions, such that any of these solutions can be implemented according to the strategy of the mining operation management team. The blast pattern with the lowest cost, result in a relatively high fly-rock and back-break, while the pattern with low fly-rock and back-break raises the cost by 20.13 % compared the minimum cost blast design.

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

In photolithography process, nanometer level precise, wavefront aberration models enable the machine to be able to meet the overlay (OVL) drift and critical dimension (CD) specifications. Software control algorithms take as input these models and correct any expected wavefront imperfections before reaching the wafer. In such way a near optimal image is exposed on the wafer surface. Optimizing the parameters of these models though, involves several time costly sensor measurements which reduce the throughput performance, in terms of exposed wafers per hour, of the machine. In that case, photolithography machines come across the trade-off between throughput and quality. Therefore one of the most common Optimal Experimental Design (OED) problems in photolithography machines (and not only) is how to choose the minimum amount of sensor measurements that will provide the maximum amount of information. Additionally, each sensor measurement corresponds to a point on the wafer surface and therefore we must measure uniformly around the wafer surface as well. In order to solve this problem, we propose a Sensor Marks Selection Algorithm which exploits Genetic Algorithms. The proposed solution first selects a pool of points that qualify as candidates to be selected in order to meet the uniformity constraint. Then, the point that provides the maximum amount of information, quantified by the Fisher based criteria of G, D and A-Optimality, is selected and added to the measurement scheme. This process though is considered "greedy", and for this reason Genetic Algorithms (GA) are exploited to further improve the solution. By repeating in parallel the "greedy" part several times we get an initial population that will be the input to our GA. This meta-heuristic approach outperforms the "greedy" approach significantly. The proposed solution is applied in a real life semiconductors industry use case and achieves interesting industry and academical results as well.

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

This paper introduces a novel multi-strategy enhanced dung beetle optimization (MSDBO) algorithm that is designed to address several issues identified in the standard dung beetle optimization algorithm. Specifically, the MSDBO aims to enhance convergence speed, reduce susceptibility to local optima, and increase search accuracy. By incorporating three strategies: tent chaotic mapping for population initialization, the golden sinusoidal strategy for position updating, and the Lévy flight strategy for balancing exploration and exploitation, the standard dung beetle optimization algorithm is enhanced. The MSDBO algorithm is evaluated using twelve benchmark test functions and compared against five state-of-the-art algorithms. The results consistently show that MSDBO exhibits faster convergence speeds and more accurate solutions than the other algorithms across most of the test functions. In addition, MSDBO is also applied to optimize the parameters of a valve plate, including the close angle, cross angle, triangle groove sizes, and wrap angle. The optimization outcomes reveal that MSDBO effectively minimizes pressure ripples in the piston chamber, resulting in reduced flow rate fluctuations and noise emission compared to the initial design. This study highlights the potential of the MSDBO algorithm in tackling complex nonlinear engineering optimization problems.

During the hand-eye calibration process of the manipulator, the Euclidean distance error of the calibration results cannot be calculated because the true values of the hand-eye conversion matrix cannot be obtained. In this paper, a new method of projection error analysis is presented. Error analysis is carried out by using a priori knowledge that the location of AR markers is fixed in the calibration process. The coordinates of the AR marker center point are reprojected to the pixel coordinate system, and then compared with the true pixel coordinates of the AR marker center point obtained by corner detection or manual labeling in order to obtain the Euclidean distance between the two coordinates as the basis for error analysis. Experimental results show that the proposed optimization method can greatly improve the accuracy of hand-eye calibration results.

The mass production of mosquitoes at an industrial scale requires efficient sex separation, which can be achieved through mechanical, genetic or artificial intelligence means. Compared with others methods, the genetic sexing approach offers the advantage of limiting costs and space by removing females at larval stage. We recently developed a GSS in Aedes albopictus based on the sex linkage of the rdl gene to the M locus, conferring dieldrin resistance in males only. It has been previously reported that dieldrin ingested by larvae can be detected in adults and bioaccumulated in predators, raising the question of its use at a large-scale. In this context, we performed several experiments aiming at optimizing dieldrin selection by decreasing both dieldrin concentration and exposure time while maintaining a stable percentage of females averaging 1%. We showed that the previously used dieldrin exposure induced an important toxicity as it killed 60% of resistant males at larval stage. We could easily lower this toxicity by reducing the dose and/or the exposure time to recover nearly all resistant males. We then quantified the residues of dieldrin in resistant male adults and showed that dieldrin toxicity in larvae was positively correlated with dieldrin concentrations detected in adults. Interestingly, we showed that the use of reduced dieldrin exposure led to a dieldrin detection in adult males that was below the sensitivity threshold of the Gas Chromatography Mass Spectrometry detection method. Presented data show that dieldrin exposure can be adjusted to suppress toxicity in males while achieving efficient sexing and lowering the levels of dieldrin residues in adults to barely detectable levels.

Public transportation scheduling aims to optimize the allocation of transportation resources, enhance transportation efficiency, and increase passenger satisfaction, which is crucial for building a sustainable urban transportation system. As a complement to public transportation, shared bikes provide users with a solution for the last mile of travel, compensating for the lack of flexibility in public transportation and helping to improve its utilization rate. Due to the characteristics of shared bikes, such as peak usage periods in the morning and evening and significant fluctuations in demand across different areas, the optimization of shared bike dispatch can better meet user needs, thereby reducing vehicle vacancy rates and increasing operating revenue. Addressing this issue, this paper designs a comprehensive decision-making approach for spatio-temporal demand prediction and bike dispatch optimization. For demand prediction, we designed a T-GCN based bike demand prediction model. In terms of dispatch optimization, we considered factors such as dispatch capacity, distance restrictions, and dispatch costs, and designed an optimization solution based on genetic algorithms. Finally, this paper validates the approach using shared bike operating data, shows that T-GCN can effectively predict short-term demand for shared bikes. Meanwhile, the optimization model based on genetic algorithms provides a complete dispatch solution verifying the model’s effectiveness. The shared bike dispatch approach proposed in this paper, which combines demand prediction with resource scheduling. This scheme can also be extended to other transportation scheduling problems with uncertain demand, such as store replenishment delivery and intercity inventory dispatch.

Lightning discharges in electric power networks generate voltage and current surges that are propagated through the electrical network causing damage and shutdowns in the electrical system. To protect the system against these phenomena, surge arresters are very effective and widely used by electrical utilities in their electric grids. This paper presents a methodology for optimized surge arrester allocation based on genetic algorithm (GA), creating a simulation environment in the software ATP (Alternative Transients Program) to implement the proposed methodology. The optimized allocation procedure is based on a fitness function that minimizes the cost of surge arresters and maximizes the number of protected equipment. To carry out this optimized arrester allocation procedure using ATP may demand too much processing time when running large distribution grids. To overcome this difficulty a procedure is proposed to obtain an overvoltage severity description of the grid and select the most critical electric nodes for the incidence of lightning discharges, in the GA allocation procedure. The case study is applied to the IEEE 123-bus electrical feeder to demonstrate the effectiveness of the proposed methodology.

Nowadays industrial dryers are used instead of traditional methods for drying. In designing dryers suitable for controlling the process of drying and reaching a high quality product, it is necessary to predict the instantaneous moisture loss during drying. For this purpose, ten mathematical-experimental models with a neural network model based on the kinetic data of pistachio drying are studied. The data obtained from the cabinet dryer will be evaluated at four temperatures of inlet air and different air velocities. The pistachio seeds will be placed in a thin layer on an aluminum sheet on a drying tray and weighed by a scale attached to the computer at different times. In the neural network, data are divided into three parts: educational (60%), validation (20%) and test (20%). Finally, the best mathematical-experimental model using genetic algorithm and the best neural network structure for predicting instantaneous moisture are selected based on the least squared error and the highest correlation coefficient.

PEM fuel cell is a technology successfully used in the production of energy from hydrogen, allowing the use of hydrogen as an energy vector. It is scalable for stationary and mobile applications. However, the technology demands more research. An important research topic is fault diagnosis and condition monitoring to improve the life and the efficiency and to reduce the operation costs of PEMFC devices. Consequently, there is a need of physical models that let deep analysis. These models must be accurate enough to represent the PEMFC behavior and to allow the identification of different internal signals of a PEM fuel cell. This work presents a PEM fuel cell model that uses the output temperature in a closed loop, so it can represent the thermal and the electrical behavior. The model is used to represent a NEXA Ballard 1.2 kW; therefore it is necessary to fit the coefficients to represent the real behavior. Five optimization algorithms were tested to fit the model, three of them were taken from literature and two were proposed. Finally, the model with the parameters identified was validated with real.

CAD-CAE software companies have introduced numerous tools aimed at facilitating topology optimization through Finite Element Simulation, thereby enhancing accessibility for designers via user-friendly interfaces. However, the imposition of intricate constraint conditions or additional restrictions during calculations may introduce instability into the resultant outcomes. In this paper, an algorithm for updating the design variables called Adaptive Variable Design is proposed to keep the final design space volume of the optimized part always under the target value while giving the main algorithm multiple chances to update the optimization parameters and search for a valid design. This algorithm aims to producing results that are more conducive to manufacturability and potentially more straightforward in interpretation. A comparison between several commercial software and the proposed algorithm, implemented in MATLAB, is carried out to prove the robustness of the latter. By simulating identical parts under similar conditions, we seek to generate comparable results and underscore the advantages stemming from the adoption and comprehension of the proposed topology optimization methodology. Our findings reveal that the integrated enhancements within MATLAB pertaining to the topology optimization process yield favourable outcomes with respect to discretization, and the manufacturability of resultant geometries. Furthermore, we assert that the methodology evaluated within MATLAB holds promise for potential integration into commercial packages, thereby enhancing the efficiency of topology optimization processes.

A single Information security is of pivotal concern for consistently streaming information over the widespread internetwork. The bottleneck flow of incoming and outgoing data traffic introduces the issue of malicious activities taken place by intruders, hackers and attackers in the form of authenticity desecration, gridlocking data traffic, vandalizing data and crashing the established network. The issue of emerging suspicious activities is managed by the domain of Intrusion Detection Systems (IDS). The IDS consistently monitors the network for identifica-tion of suspicious activities and generates alarm and indication in presence of malicious threats and worms. The performance of IDS is improved by using different signature based machine learning algorithms. In this paper, the performance of IDS model is determined using hybridization of nestrov-accelerated adaptive moment estimation –stochastic gradient descent (HNADAM-SDG) algorithm. The performance of the algorithm is compared with other classi-fication algorithms as logistic regression, ridge classifier and ensemble algorithm by adapting feature selection and optimization techniques

Distributed Systems architectures are becoming the standard computational model for processing and transportation of information, especially for Cloud Computing environments. The increase in demand for application processing and data management from enterprise and end-user workloads continues to move from a single-node client-server architecture to a distributed multitier design where data processing and transmission are segregated. Software development must considerer the orchestration required to provision its core components in order to deploy the services efficiently in many independent, loosely coupled - physically and virtually interconnected - data centers spread geographically, across the globe. This network routing challenge can be modeled as a variation of the Travelling Salesman Problem (TSP). This paper proposes a new optimization algorithm for optimum route selection using Algorithmic Information Theory. The Kelly criterion for a Shannon-Bernoulli process is used to generate a reliable quantitative algorithm to find a near optimal solution tour. The algorithm is then verified by comparing the results with heuristic solutions in 3 test cases. A statistical analysis is designed to measure the significance of the results between the algorithms and the entropy function can be derived from the distribution. The tested results shown an improvement in the solution quality by producing routes with smaller length and time requirements. The quality of the results proves the flexibility of the proposed algorithm for problems with different complexities without relying in nature-inspired models such as Genetic Algorithms and Simulated Annealing. This algorithm can be used by orchestration applications to deploy services across large cluster of nodes by making better decision in the route design.

Currently, foam mixers are predominantly categorized into two types: low-pressure and high-pressure. Low-pressure mixers primarily use agitator rotation to mix materials. However, they face challenges such as difficulty in cleaning and complex structures. High-pressure mixers, widely adopted for their structural simplicity and lack of need for cleaning devices, effectively mitigate issues associated with low-pressure mixers. Nonetheless, they encounter problems with uneven mixing when processing high-viscosity materials. Historically, the primary solution to this issue was increasing the working pressure. However, the capacity to increase pressure is finite, and higher pressure demands higher quality materials for the mixers. To address the issues high-pressure mixers face when dealing with high-viscosity materials, this study focuses on the polyimide high-pressure mixer. After reviewing previous studies, four design variables were selected: the mixer's impingement angle, inlet diameter, outlet diameter, and impingement pressure. Using a Full Factorial Design of Experiments (DOE), the significance of the impact exerted by these four variables on Mixing Unevenness was analyzed, determining the extent of their influence. Optimal Latin Hypercube Sampling generated several random sample points, followed by the establishment of both a Back Propagation (BP) Neural Network approximation model and a Kriging approximation model. A Genetic Algorithm was then applied to optimize these two approximation models, resulting in the optimal combination of design variables. The research findings indicate that the BP Neural Network exhibits higher predictive accuracy compared to the Kriging prediction model. The optimal combination of parameters, optimized through the Genetic Algorithm (GA), reduced the Mixing Unevenness by 69.1%, effectively decreasing the Mixing Unevenness of the mixer head.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

Evolutionary algorithms find applicability in reinforcement learning of neural networks due to their independence from gradient-based methods. To achieve successful training of neural networks using evolutionary algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. The author previously reported experimental evaluations on Evolution Strategy for reinforcement learning of neural networks, utilizing the Acrobot control task. In this study, Genetic Algorithm is adopted as another instance of major evolutionary algorithms. Experimental results demonstrate that there was no statistically significant difference between the experimental performances of GA and ES, but the priority of generations and offsprings was different; GA performed better with a greater number of generations while ES performed better with a greater number of offsprings. Eight hidden units were the best among four variations (4, 8, 16 or 32 units), which aligns with previous study using ES.

The Complete Coverage Path Planning (CCPP) is a key technology in the field of agricultural robot, and has great significance for improving the efficiency and quality of tillage, fertilization, harvesting and other agricultural robot operations, as well as reducing the operation energy consumption. The traditional boustrophedon or heuristic search algorithm based CCPP methods, when coping with the field with irregular boundaries, obstacles and other complex environments, still face many problems and challenges, such as large repeated work areas, multiple turns or U-turns, low operation efficiency and prone to local optimum. In order to solve the above problems, an improved-genetic-algorithm-based CCPP method was proposed in this paper, which introduces the idea of chromosome pairs and multi-points mutation to improve its global optimization ability in complex environments, reduce the repeated work areas and the number of turns and U-turns, and thereby improve the operation efficiency. The simulation and experimental results on simple regular fields showed that the proposed improved genetic algorithm-based CCPP method achieved the comparable performance with the traditional boustrophedon-based CCPP method. However, on the complex irregular fields, although the proposed CCPP method increased the number of turns by 13.76%, the area of repeated operation and the number of U-turns were decreased by 38.54% and 35.00% respectively, and saves the battery voltage by 7.82% on average compared to the boustrophedon-based CCPP method. This proved that the proposed CCPP method has strong adaptive capacity to the environment, and has practical application value in improving the efficiency and quality of agricultural machinery operations, and reducing the energy consumption.

The relationship between the host and the microbiome, or the assemblage of microorganisms (including bacteria, archaea, fungi, and viruses), has been proven crucial for its health and disease development. The high dimensionality of microbiome datasets has often been addressed as a major difficulty for data analysis, such as the use of Machine Learning (ML) and Deep Learning (DL) models. Here we present BiGAMi, a bi-objective genetic algorithm fitness function for feature selection in microbial datasets to train high-performing phenotype classifiers. The proposed fitness function allowed us to build classifiers that outperformed the baseline performance estimated by the original studies by using as few as 0.04% to 2.32% features of the original dataset. In 19 out of 21 classification exercises, BiGAMi achieved its results by selecting 6-68% fewer features than the highest performance of a Sequential Forward Feature Selection algorithm. This study showed that the application of a bi-objective GA fitness function against microbiome datasets succeeded in selecting small subsets of bacteria whose contribution to understood diseases and the host state was already experimentally proven. Applying this feature selection approach to novel diseases is expected to quickly reveal the microbes most relevant to a specific condition.

Service pricing is a bottleneck in the development of innovation services, as it is the issue of most concern between the suppliers and demanders. In this paper, a negotiation pricing model that is based on the multiobjective genetic algorithm is developed for innovation service pricing. Regarding the service pricing process as a multiobjective problem, the objective functions, which include the service price, service efficiency, and service quality, for suppliers and demanders are constructed. As the solution of a multiobjective problem is typically a series of alternatives, another negotiation process is necessary for determining the final decision. A learning strategy is adopted during the negotiation process to simulate reality. Finally, the model is implemented for an innovation service transaction, the objective of which is to identify the optimal price plan. The results demonstrate that the model can provide quantitative decision support for the pricing of an innovation service and ultimately yield a win-win result for both the supplier and demander of the innovation service. Furthermore, the influence of the parameters during the negotiation process is analyzed in detail. The effects of the learning strategy on accelerating the negotiation process, as well as the chosen of reasonable parameters are given.

Keyhole neurosurgery implies reaching a target area inside the brain through an entry point specified by the neurosurgeon. In order to avoid complications, a risk assessment procedure must be done to establish the minimum risk trajectory from the entry point to the target area. The neurosurgeon establishes the risk values for the brain structure according to the type of intervention. The preset brain structure risk value is used to assess the risk value for each voxel of the brain. This paper proposes an improved risk assessment methodology based on the sum of N maximum risk values for each voxel. Then, risk assessment for a trajectory is done by adding the risk of all voxels that are part of the path. The safest trajectory is defined as the trajectory with the lower risk. Our proposed search trajectory methodology includes a Genetic Algorithm (GA) for finding the safest trajectories. The use of a GA drastically reduces the number of trajectories to analyze, speeding up the planning procedure. The achieved results were qualified by expert neurosurgeons as satisfactory. Our proposed method allows neurosurgeons to calibrate the surgical planning system by allowing them to establish the risk brain structure and the risk value for each structure.

The extensive utilization of rebar during the construction of the project generates immense rebar waste, leading to increased construction costs and significant greenhouse gas emissions. Various approaches have been explored focusing on the minimization of rebar-cutting waste, such as optimizing cutting patterns, lap splice position, and special-length rebar utilization. Nonetheless, reducing rebar usage by minimizing the number of splices remains uninvestigated. In response to these issues, a two-stage optimization algorithm was developed, prioritizing special-length rebar to achieve near-zero rebar-cutting waste of less than 1% and concurrently reduce rebar usage, thereby promoting sustainable construction practices. The two-stage algorithm presented in this study involves the optimization of the lap splice position for the continuous rebar with a reduction of splices number. Furthermore, it integrates a special-length minimization algorithm for the additional rebars. Applying the algorithm to beam structures in a small-sized factory building project led to a notable reduction of 29.624 tons of rebar, equivalent to 12.31% of the total purchased quantity. Greenhouse gas emissions were reduced by 102.68 tons, and associated costs decreased by USD 30,256. A rebar-cutting waste of 0.99% which is near zero was achieved. These findings highlight the significant potential of the proposed algorithm in reducing rebar waste and facilitating sustainable construction practices. In addition, the application of the proposed algorithm in reinforced concrete construction projects will amplify the associated advantages accordingly.

model checking techniques are often used for the verification of software systems. Such techniques are accompanied with several advantages. However, state space explosion is one of the drawbacks to model checking. During recent years, several methods have been proposed based on evolutionary and meta-heuristic algorithms to solve this problem. In this paper, a hybrid approach is presented to cope with the SSE problem in model checking of systems modeled by GTS with an ample state space. Most of existence proposed methods that aim to verify systems are applied to detect deadlocks by graph transformations. The proposed approach is based on the fuzzy genetic algorithm and is designed to decline the safety property by verifying the reachability property and detecting deadlocks. In this solution, the state space of the system is searched by a fuzzy genetic algorithm to find the state in which the specified property is refuted/verified. To implement and evaluate the suggested approach, GROOVE is used as a powerful designing and model checking toolset in GTS. The experimental results indicate that the presented hybrid fuzzy method improves speed and performance by comparing other techniques

The feasibility of recovering bioactive antioxidants from Phyllantus emblica leaves using ethanol -water mixture (0 – 100%) and heat-assisted extraction technology (HAE-T) was investigated in this present study. To this effect, the process parameter of operating temperature (OT: 30 -50 oC), solid -to-liquid ratio (S:L: 1:20 - 1:60 g/mL) and extraction time (ET: 45 - 180 min) were investigated on the extract total phenolic content (TPC, mg GAE/g d.w), yield (EY, %) and antioxidant activity (μM AAE/g d.w) by employing the Box-Behnken experimental design (BBD) available in response surface methodology (RSM). Multi-objective process optimization using the desirability function algorithm to determine set of process variables that simultaneously optimize process responses of TPC, EY and AA was also investigated. The recovery process was thereafter modeled with BBD-RSM and multi gene genetic programming (MGGP) algorithm and model reliability assessment via Monte Carlo simulation were conducted for the best performing set of models for predicting TPC, EY and AA values. The HPLC characterization of the recovered extract was carried out to ascertain the phenolic compound constituents of the Phyllantus emblica leaf extract. The 50% ethanol solution was found to be the best for the optimal extraction of antioxidants from Phyllantus emblica leaves. The HAE-T was suitable for recovering bioactive extract from Phyllantus emblica leaves and investigated process parameters have impacts on the recovery process. The process parameters that simultaneously gave the optimum EY of 21.6565%, TPC of 67.116 mg GAE/g and AA of 3.68583 µM AAE/g were OT of 41.61 oC, S:L of 1:60 g/mL and ET of 180 min. The HPLC extract profiling revealed that the bioactive constituents present in the recovered extract were betulinic acid, gallic acid, chlorogenic acid, caffeic acid, ellagic acid, and ferulic acid. Both the developed BBD-RSM and evolved MGGP-based models predicted the observed process response of TPC, EY and AA satisfactorily with BBD-RSM models marginally better in their predictions. The reliability results showed that the BBD-RSM models predicted TPC, EY and AA values with high certainty of 99.985%, 97.569% and 98.661%, respectively.

This work introduces an innovative approach that unites a PIDND2N2 controller and the balanced arithmetic optimization algorithm (b-AOA) to enhance the stability of an automatic voltage regulator (AVR) system. The PIDND2N2 controller, tailored for precision, stability, and responsiveness, mitigates the limitations of conventional methods. The b-AOA optimizer is obtained through integration of pattern search and elite opposition-based learning strategies into the arithmetic optimization algorithm. This integration optimizes the controller parameters and the AVR system's response, harmonizing exploration and exploitation. Extensive assessments, including evaluations on 23 classical benchmark functions, demonstrate the efficacy of the b-AOA. It consistently achieves accurate solutions, exhibits robustness in addressing a wide range of optimization problems, and stands out as a promising choice for various applications. In terms of AVR system, comparative analyses highlight the superiority of the proposed approach in transient response characteristics, with the shortest rise and settling times and zero overshoot. Additionally, the b-AOA approach excels in frequency response, ensuring robust stability and a broader bandwidth. Furthermore, the proposed approach is compared with various state-of-the-art control methods for the AVR system, showcasing impressive performance. These important results underscore the significance of this work, setting a new benchmark for AVR control by advancing stability, responsiveness, and reliability in power systems.

Cloud Manufacturing (CMfg) has attracted lots of attention from scholars and practitioners. The purpose of quality of service (QoS)-aware manufacturing cloud service composition (MCSC), as one of the key issues in CMfg, is to combine different available manufacturing cloud services(MCSs) to generate an optimized MCSC that can meet diverse requirements of customers. However, many available MCS, deployed in the CMfg platform, have same function but different QoS attributes. It is a great challenge to achieve optimal MCSC with high QoS. In order to obtain better optimization results efficiently for the QoS-MCSC problems, a whale optimization algorithm(WOA) with adaptive weight, Lévy flight, and adaptive crossover strategies (ASWOA) is proposed. In the proposed ASWOA, the adaptive crossover inspired by the genetic algorithm is developed to balance the exploration and exploitation. The Lévy flight is designed to expand the search space of WOA and accelerate the convergence of WOA with adaptive crossover. The adaptive weight is developed to extend the search scale of the exploitation. Simulation and comparison experiments are conducted on different scale QoS-MCSC problems. The experimental results demonstrate that the proposed ASWOA outperforms other compared cutting-edge algorithms.

The market for microfluidic chips is experiencing significant growth; however, their development is hindered by a complex design process and low efficiency. Enhancing microfluidic chips’ design quality and efficiency has emerged as an integral approach to foster their advancement. Currently, the existing structural design schemes lack careful consideration regarding the impact of chip area, microchannel length, and the number of intersections on chip design. This inadequacy leads to redundant chip structures resulting from the separation of layout and wiring design. This study proposes a structural optimization method for microfluidic chips to address these issues utilizing a simulated annealing algorithm. The simulated annealing algorithm generates an initial solution in advance using the fast sequence pair algorithm. Subsequently, an improved simulated annealing algorithm is employed to obtain the optimal solution for the device layout. During the wiring stage, an advanced wiring method is used to designate the high wiring area, thereby increasing the success rate of microfluidic chip wiring. Furthermore, the connection between layout and routing is reinforced through an improved layout adjustment method, which reduces the length of microchannels and the number of intersections. Finally, the effectiveness of the structural optimization approach is validated through six sets of test cases, successfully achieving the objective of enhancing the design quality of microfluidic chips.

Real-world optimization problems are often governed by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Optimization Problems (COPs) fueled by advances in computational intelligence. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose an ensemble of multi- method hybrid EA framework with four mutation operators, two crossover operators, multi-search [Differential Evolution (DE) & Gaining Sharing Knowledge (GSK)] optimization algorithm, and ensemble of constraint handling techniques to solve global real- world constrained optimization problem. The proposed frame- work FEPEA has an ascendancy of multiple adaptation strategies concerning the control parameters, search mechanisms, two sub-populations as well as uses knowledge sharing mechanism between junior and senior phases. The algorithm also combines the power of four popular constraint handling techniques (CHT) and uses a voting mechanism to select any particular CHT. On top of that, this algorithm also uses both linear and non- linear population size reduction in every step of the evolutionary process. We test our method on 57 real-world problems provided as part of the CEC 2020 special session & competition on real- world constrained optimization benchmark suite. Experimental results indicate that FEPEA is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

A metering roundabout where traffic is controlled by traffic lights with phase times influenced by queue detector occupancy might be the solution to enhance performance when there are unbalanced traffic flows at roundabouts. There have, however, been minimal studies on how the distance of the queue detector from the stop line affects signal phase time durations and the queuing lengths. This research, therefore, seeks to develop a Cuckoo Search/Local search Algorithm using parameters such as arrival volumes, conflicting volumes, detector distance and phase time to investigate the relationship of signal setting, detector location and queuing formulations. Also, some additional statistical tests were performed for the fitness of the data. In order to conduct solid model validations, model output data was compared against the AIMSUN model. The results from the analyses demonstrated that the queue detector distance can affect phase time durations and vehicle queuing lengths on the controlling approach as well as queuing lengths on the metered approach. This study showed that, based on the study for the Old Belair Road roundabout in Adelaide, South Australia, the total queue length (controlling + metered) will be minimized when the detector is relocated at 209 meters from the roundabout stop line, giving longer phase green times and resulting in decreased intersection queuing lengths.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

Evolutionary algorithms and swarm intelligence algorithms find applicability in reinforcement learning of neural networks due to their independence from gradient-based methods. To achieve successful training of neural networks using these algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. In Part1, the author previously reported experimental evaluations on Evolution Strategy　for reinforcement learning of binary neural networks, utilizing the Pendulum control task. This article constitutes Part2 of the series of comparative research. In this study, Genetic Algorithm is adopted as another evolutionary algorithm. Wilcoxon signed rank test revealed that there was no statistically significant difference between the fitness scores obtained using GA and those using ES. However, the p-value 0.11 indicated that GA worked better than ES on this training task. As the values of binary weights, {-1, 1} were significantly superior to {0, 1} (p < .01). The motion of the pendulum controlled by the binary MLP after the training showed that the binary MLP successfully swung the pendulum swiftly into an inverted position and maintained its stability after inversion.

Gas sensor arrays, also known as electronic noses, leverage a diverse set of materials to identify the components of complex gas mixtures. Metal-organic frameworks (MOFs) have emerged as promising materials for electronic noses due to their high-surface areas and chemical as well as structural tunability. Using our recently reported genetic algorithm design approach, we examined a set of 50 MOFs and searched through the over 1.125x1015 unique array combinations to identify optimal arrays for the detection of CO₂ in air. We found that despite individual MOFs having lower selectivity for O2 or N2 relative to CO₂, intelligently selecting the right combinations of MOFs enabled accurate prediction of the concentrations of all components in the mixture (i.e. CO₂, O₂, N₂). We also analyzed the physical properties of the elements in the arrays to develop an intuition for improving array design. Notably, we find that diversity among the surface areas in the MOFs leads to improved sensing. Consistent with the observation, we found that, as one might expect, the best arrays consistently had more structural diversity than the worst arrays.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

A methodology for selecting rational parameters of atmospheric aircrafts at the initial stages of design using an optimization algorithm of differential evolution and numerical mathematical modeling of aerodynamics problems is proposed. The technique involves the implementation of weight and aerodynamic balance in the main flight modes, has the ability to consider atmospheric aircrafts with one or two lifting surfaces, apply parallel calculations and automatically generate a three-dimensional geometric model of aircraft appearance based on the optimization results. A method for accelerating the process of optimizing the parameters of an aircraft in terms of take-off weight by more than three times by introducing a objective function into a set of design variables is proposed and demonstrated. The results of assessing the reliability of the used mathematical models of aerodynamics and the correctness of the calculation the objective function, taking into account various constraints, are presented. A comprehensive test of the performance and efficiency of the methodology is considered by solving demonstration problems to optimize more than ten main design parameters the appearance of two existing heavy-class unmanned aerial vehicles with known characteristics from open sources.

Pavement crack detection is one of the key links in highway pavement maintenance management. In the current road crack detection, the network model easily ignores the shallow geometric features of cracks and cannot extract the key feature information of cracks. Aiming at the above problems, an EC-YOLOX network model is proposed. The CFPN is constructed to cross-fuse different scale features to solve the feature scale invariance. In the strengthen feature extraction layer, ECANet is fused to enhance the ability to pay attention to key information. The WEIoU loss function is proposed, which assigns different penalty terms to the target box in the vertical and horizontal directions. In terms of data, geometric distortion constraint correction is performed on the single-point perspective pavement image. The experimental data show that the accuracy of EC-YOLOX on the self-built data set reaches 76.34% [email protected], which is 4.45% higher than that of YOLOX. The loss curve of EC-YOLOX is smoother than that of YOLOX, and the minimum training loss value is 2.136, which is 0.648 lower than the minimum loss value 2.784 of YOLOX. Many experiments have verified the effectiveness of EC-YOLOX in improving the detection effect in pavement crack detection.

Densimetric Froude (Fr) is the minimum velocity required to prevent sediment deposition in pipes. Prediction of Fr is of utmost importance in numerous applications in civil engineering. In this paper through using a new hybrid method. Genetic Algorithm (GA) is used for optimum selection of membership functions of Adaptive Neuro-Fuzzy Inference System (ANFIS), and Singular Value Decomposition (SVD) method is used to compute the linear parameters of ANFIS’s results section (ANFIS-GA/SVD). Also, two different target functions are known as training error (TE) and prediction error (PE) by Pareto curve, the trade-off between these functions is selected as the optimal modeling point. First, different models will be presented using the parameters affecting Fr prediction, classifying them in different groups; then the Fr parameter will be predicted for all the different models through utilizing three different sets of data and the ANFIS-GA/SVD technique. The results of the models indicate that the best Fr prediction is obtained when independent parameters such as volumetric sediment concentration (CV), ratio of median diameter of particle size to pipe diameter (d/D), ratio of median diameter of particle size to hydraulic radius (d/R) and overall friction factor of sediment (λs) use as input variables in prediction of Fr. A sensitivity analysis is also conducted for the purpose of examining the effect of each of the dimensionless parameters on Fr prediction accuracy. Comparing the results of the suggested models with the existing regression-based equations shows that ANFIS-GA/SVD (R²=0.986, MAPE=4.397, RMSE=0.206, SI=0.053, ρ=0.026, BIAS=-0.025) is more accurate than the rest of the models.

The current work addresses the control of two-input two-output (TITO) Wood and Berry model of a binary distillation column. The controller design problem is formulated in terms of multivariable H_∞ control synthesis. The controller structure takes the form of simplest static output feedback (SOF) control. The controller synthesis is performed using a hybrid approach of blending linear matrix inequalities (LMI) and genetic algorithm (GA). The performance of the static output feedback controller is compared with three other controllers designed for Wood and Berry model available in the literature. The first simulation study is performed for the case of tracking a unit step command in the presence of a step change in output disturbance. A second simulation study is performed for rejecting a change in sinusoidal output disturbance.

High resolution information on nucleotide arrangement in the genome of any or-ganism is critical to understand its genetic makeup, function, and evolutionary his-tory. For years, DNA sequencing has provided crucial breakthroughs in the field of genomics and molecular biology. With the advent of technology, Next Generation Sequencing has now transformed the whole genome sequencing prospects, thus unveiling the novel and interesting features of an organism genome that can behold. Next generation sequencing platforms offer realistic approach to identify and anal-yses whole genome with high throughput, accuracy, scalability in a very short time span. Information obtained can be further used in improving our existing healthcare systems, designing novel and personalized therapeutic modules, making the envi-ronment sustainable and proactively preparing ourselves for future pandemics and outbreaks. This article discusses the various NGS technologies and approaches, their advantages, drawbacks, and futuristic usage in different fields. Though still in nascent stages and marred with flaws, with ongoing advancement, NGS will indeed have promising impacts in the future.

Classifying network flow subsequences in an Industrial IoT gateway is an effective method for identifying Industrial IoT faults. This paper proposes a subsequence classification algorithm SSGBUL-IKNN based on unsupervised learning encoding to address the problem of low classification accuracy. Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the Industrial IoT gateway. In the encoding module, a subsequence calibration algorithm controls the increasing error during the coding process. Then, the specific fault type is obtained through an improved KNN classification algorithm based on the indication distance source from the integrated coding sequences converted by multi-dimensional network flow sequences. The test result on three Industrial IoT datasets of a sewage treatment plant shows that the accuracy of SSGBUL-IKNN in this paper exceeds 92%, significantly higher than the algorithm DTW and TSF. It reaches the classification requirements of Industrial IoT fault diagnosis.

We designed a bidirectional reflection distribution function (BRDF) measurement system to research the characteristics of space target materials. This system measures the BRDF data of an aluminum plate and gold foil. A hybrid biogeography-based optimization-firefly (BBO-Firefly) algorithm was proposed to optimize the five-parameter BRDF model. To check the performance of the hybrid BBO-Firefly algorithm, we set up a contrast experiment to optimize the BRDF parameters using the BBO algorithm, Firefly algorithm, and hybrid BBO-Firefly algorithm. The experimental results prove that the hybrid BBO-Firefly algorithm surpasses the BBO algorithm and Firefly algorithm in convergence speed and precision in the same situation and has a better optimization effect. Finally, we substitute the optimization results of the hybrid BPO-Firefly algorithm into the BRDF model to analyze the reflection characteristics of an aluminum plate and gold foil.

To address the problem that it is easy to form coverage blind areas when wireless sensor networks are randomly deployed, an improved coverage optimization algorithm based on improved Salpa swarm Intelligent algorithm (ATSSA) is proposed for wireless sensor networks. Firstly, the pop-ulation is initialized using tent chaotic sequence to enhance the optimization ability of the algo-rithm. Secondly, the T-distribution mutation is added to the update formula of the leaders for improving the ability to jump out of the local optimal value. Finally, an adaptive formula for updating the position of the follower is proposed, which not only guarantees the local searching ability of the algorithm in the late iteration period, but also improves the global searching ability of the algorithm in the early iteration period. The experimental results show that ATSSA algorithm can improve the coverage of the wireless sensor networks and reduce deployment costs com-pared with other algorithms, when it is used in the wireless sensor networks.

This paper proposes a parameter coordination optimization design of Power System Stabilizer (PSS) based on an improved Quasi-Affine Transformation Evolutionary (QUATRE) algorithm to suppress low-frequency oscillation and improve the dynamic stability of power system. To begin, the Simulated Annealing (SA) algorithm randomly updates the globally optimal solution of each QUATRE iteration and matches the inferior solution with a certain probability to escape the local extreme point. This new algorithm is first applied to power system. Second, Since damping ratio is one of the criteria to measure the dynamic stability of power system, this paper sets the objective function according to the principle of maximization of damping coefficient of electromechanical mode, and uses SA-QUATRE to search a group of global optimal PSS parameter combinations to improve the stability margin of the system as much as possible. Finally, the method's rationality and validity were validated by applying it to the simulation examples of IEEE 4-machine 2-area system with different operation states. The comparison with the traditional optimization algorithm shows that the proposed method has more advantages for multi-machine PSS parameter coordination optimization, and can restrain the low-frequency oscillation of power system more effectively and enhance the system stability.

Nowadays, model checking is applied as an accurate technique to verify software systems. The main problem of model checking techniques is the state space explosion. This problem occurs due to the exponential memory usage by the model checker. In this situation, using meta-heuristic and evolutionary algorithms to search for a state in which a property is satisfied/violated is a promising solution. Recently, different evolutionary algorithms like GA, PSO, etc. are applied to find deadlock state. Even though useful, most of them are concentrated on finding deadlock. This paper proposes a fuzzy algorithm in order to analyze reachability properties in systems specified through GTS with enormous state space. To do so, we first extend the existing PSO algorithm (for checking deadlocks) to analyze reachability properties. Then, to increase the accuracy, we employ a Fuzzy adaptive PSO algorithm to determine which state and path should be explored in each step to find the corresponding reachable state. These two approaches are implemented in an open-source toolset for designing and model checking GTS called GROOVE. Moreover, the experimental results indicate that the hybrid fuzzy approach improves speed and accuracy in comparison with other techniques based on meta-heuristic algorithms such as GA and the hybrid of PSO-GSA in analyzing reachability properties.

The continuous development in the field of industrial automation and electric mobility has led to the need for more efficient electrical machines with high power density. The improvement of electrical machines slot filling factors is one of the measures to satisfy these requirements. In recent years, this topic has aroused greater interest in the industrial sector, since the evolution of the winding technological manufacturing processes allows an economically sustainable realization of ordered winding arrangements, rather than random ones. Moreover, the manufacture of electrical machines windings must be preceded by an accurate design phase in which it is possible to evaluate the maximum slot filling factor obtainable for a given wire shape and for its dimensions. For this purpose, this paper presents an algorithmic approach for the evaluation of maximum slot filling factors in electrical machines under ideal geometric premise. In particular, this algorithm has a greater degree of flexibility with respect to the algorithm approaches found in the literature, since the study has been extended to round, rectangular and hexagonal wire sections. Furthermore, the slot filling factor calculation was carried out both for standard and non-standard slots. The algorithmic approach proposed can be considered as an additional useful tool for the fast design of electrical machine windings.