Search

The main objectives of this study were to 1) review the literature on the applications of soft computing concepts to the field of human factors and ergonomics (HFE) between 2013 and 2022 and 2) highlight future developments and trends. Multiple soft computing methods and techniques have been investigated for their ability to address various applications in HFE effectively. These techniques include fuzzy logic, artificial neural networks, genetic algorithms, and their combinations. Applications of these methods in HFE have been highlighted in one hundred and four articles selected from 406 papers. The results of this study help address the challenges of complexity, vagueness, and imprecision in human factors and ergonomics research through the application of soft computing methodologies., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier Ltd. All rights reserved.)

Background: Intervention planners use logic models to design evidence-based health behavior interventions. Logic models that capture the complexity of health behavior necessitate additional computational techniques to inform decisions with respect to the design of interventions., Objective: Using empirical data from a real intervention, the present paper demonstrates how machine learning can be used together with fuzzy cognitive maps to assist in designing health behavior change interventions., Methods: A modified Real Coded Genetic algorithm was applied on longitudinal data from a real intervention study. The dataset contained information about 15 determinants of fruit intake among 257 adults in the Netherlands. Fuzzy cognitive maps were used to analyze the effect of two hypothetical intervention scenarios designed by domain experts., Results: Simulations showed that the specified hypothetical interventions would have small impact on fruit intake. The results are consistent with the empirical evidence used in this paper., Conclusions: Machine learning together with fuzzy cognitive maps can assist in building health behavior interventions with complex logic models. The testing of hypothetical scenarios may help interventionists finetune the intervention components thus increasing their potential effectiveness., (© 2023. The Author(s).)

Introduction: Knacks of evolutionary computing paradigm-based heuristics has been exploited exhaustively for system modeling and parameter estimation of complex nonlinear systems due to their legacy of reliable convergence, accurate performance, simple conceptual design ease implementation ease and wider applicability., Objectives: The aim of the presented study is to investigate in evolutionary heuristics of weighted differential evolution (WDE) to estimate the parameters of Hammerstein-Wiener model (HWM) along with comparative evaluation from state-of-the-art counterparts. The objective function of the HWM for controlled autoregressive systems is efficaciously formulated by approximating error in mean square sense by computing difference between true and estimated parameters., Methods: The adjustable parameters of HWM are estimated through heuristics of WDE and genetic algorithms (GAs) for different degrees of freedom and noise levels for exhaustive, comprehensive, and robust analysis on multiple autonomous trials., Results: Comparison through sufficient large number of graphical and numerical illustrations of outcomes for single and multiple execution of WDE and GAs through different performance measuring metrics of precision, convergence and complexity proves the worth and value of the designed WDE algorithm. Statistical assessment studies further prove the efficacy of the proposed scheme., Conclusion: Extensive simulation based experimentations on measure of central tendency and variance authenticate the effectiveness of the designed methodology WDE as precise, efficient, stable, and robust computing platform for system identification of HWM for controlled autoregressive scenarios., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2022. Production and hosting by Elsevier B.V.)

The harm of agricultural pests presents a remarkable effect on the quality and safety of edible farm products and the monitoring and identification of agricultural pests based on the Internet of Things (IoT) produce a large amount of data to be transmitted. To achieve efficient and real-time transmission of the sensors' data for pest monitoring, this paper selects 235 geographic coordinates of agricultural pest monitoring points and uses genetic algorithm (GA), particle swarm optimization (PSO), and simulated annealing (SA) to optimize the data transmission paths of sensors. The three intelligent algorithms are simulated by MATLAB software. The results show that the optimized path based on PSO can make the shortest time used for transmitting data, and its corresponding minimum time is 4.868012 s. This study can provide a reference for improving the transmission efficiency of agricultural pest monitoring data, provide a guarantee for developing real-time and effective pest control strategies, and further reduce the threat of pest damage to the safety of farm products.

Intelligent Reflecting Surfaces (IRSs) are emerging as an effective technology capable of improving the spectral and energy efficiency of future wireless networks. The proposed scenario consists of a multi-antenna base station and a single-antenna user that is assisted by an IRS. The large number of reflecting elements at the IRS and its passive operation represent an important challenge in the acquisition of the instantaneous channel state information (I-CSI) of all links as it adds a very high overhead to the system and requires equipping the IRS with radio-frequency chains. To overcome this problem, a new approach is proposed in order to optimize beamforming at the BS and the phase shifts at the IRS without considering any knowledge of I-CSI but while only exploring the statistical channel state information (S-CSI). We aim at maximizing the user-achievable rate subject to a maximum transmit power constraint. To achieve this goal, we propose a new two-phase framework. In the first phase, both the beamforming at the BS and IRS are designed based only on S-CSI and, in the second phase, the previously designed beamforming pair is used as an initial solution, and beamforming at the BS and IRS is designed only by considering the feedback of the SNR at UE. Moreover, for each phase, we propose new methods based on Genetic Algorithms. Results show that the developed algorithms can approach beamforming with I-CSI but with significantly reduced channel estimation overhead.

Anaerobic digestion (AnD) is a process that allows the conversion of organic waste into a source of energy such as biogas, introducing sustainability and circular economy in waste treatment. AnD is an intricate process because of multiple parameters involved, and its complexity increases when the wastes are from different types of generators. In this case, a key point to achieve good performance is optimisation methods. Currently, many tools have been developed to optimise a single AnD plant. However, the study of a network of AnD plants and multiple waste generators, all in different locations, remains unexplored. This novel approach requires the use of optimisation methodologies with the capacity to deal with a highly complex combinatorial problem. This paper proposes and compares the use of three evolutionary algorithms: ant colony optimisation (ACO), genetic algorithm (GA) and particle swarm optimisation (PSO), which are especially suited for this type of application. The algorithms successfully solve the problem, using an objective function that includes terms related to quality and logistics. Their application to a real case study in Catalonia (Spain) shows their usefulness (ACO and GA to achieve maximum biogas production and PSO for safer operation conditions) for AnD facilities.

Experimental screening of large sets of compounds against macromolecular targets is a key strategy to identify novel bioactivities. However, large-scale screening requires substantial experimental resources and is time-consuming and challenging. Therefore, small to medium-sized compound libraries with a high chance of producing genuine hits on an arbitrary protein of interest would be of great value to fields related to early drug discovery, in particular biochemical and cell research. Here, we present a computational approach that incorporates drug-likeness, predicted bioactivities, biological space coverage, and target novelty, to generate optimized compound libraries with maximized chances of producing genuine hits for a wide range of proteins. The computational approach evaluates drug-likeness with a set of established rules, predicts bioactivities with a validated, similarity-based approach, and optimizes the composition of small sets of compounds towards maximum target coverage and novelty. We found that, in comparison to the random selection of compounds for a library, our approach generates substantially improved compound sets. Quantified as the "fitness" of compound libraries, the calculated improvements ranged from +60% (for a library of 15,000 compounds) to +184% (for a library of 1000 compounds). The best of the optimized compound libraries prepared in this work are available for download as a dataset bundle ("BonMOLière").

The study of power quality (PQ) has gained relevance over the years due to the increase in non-linear loads connected to the grid. Therefore, it is important to study the propagation of power quality disturbances (PQDs) to determine the propagation points in the grid, and their source of generation. Some papers in the state of the art perform the analysis of punctual measurements of a limited number of PQDs, some of them using high-cost commercial equipment. The proposed method is based upon a developed proprietary system, composed of a data logger FPGA with GPS, that allows the performance of synchronized measurements merged with the full parameterized PQD model, allowing the detection and tracking of disturbances propagating through the grid using wavelet transform (WT), fast Fourier transform (FFT), Hilbert-Huang transform (HHT), genetic algorithms (GAs), and particle swarm optimization (PSO). Measurements have been performed in an industrial installation, detecting the propagation of three PQDs: impulsive transients propagated at two locations in the grid, voltage fluctuation, and harmonic content propagated to all the locations. The results obtained show that the low-cost system and the developed methodology allow the detection of several PQDs, and track their propagation within a grid with 100% accuracy.

Background: Feature selection is a crucial step in machine learning analysis. Currently, many feature selection approaches do not ensure satisfying results, in terms of accuracy and computational time, when the amount of data is huge, such as in 'Omics' datasets., Results: Here, we propose an innovative implementation of a genetic algorithm, called GARS, for fast and accurate identification of informative features in multi-class and high-dimensional datasets. In all simulations, GARS outperformed two standard filter-based and two 'wrapper' and one embedded' selection methods, showing high classification accuracies in a reasonable computational time., Conclusions: GARS proved to be a suitable tool for performing feature selection on high-dimensional data. Therefore, GARS could be adopted when standard feature selection approaches do not provide satisfactory results or when there is a huge amount of data to be analyzed.

Objective: This paper presents a methodology to optimize, using Altman's Z-Score for private companies, the prediction of private companies of the Spanish health sector entering a situation of bankruptcy., Method: The proposed method consists of the application of genetic algorithms (GA) to find the coefficients of the formula of the chain of ratios proposed by Altman in the version of the score for private companies which optimize the prediction for Spanish private health companies, maximizing sensitivity and specificity, and thereby reducing type I and type II errors. For this purpose, a sample of 5,903 companies from the Spanish private health sector obtained from the database of the Iberian Balance Analysis System (SABI) between 2007 and 2015 was used., Results: The results show that the predictive model obtained with the AG presents greater accuracy, sensitivity and specificity than that proposed by Altman for private companies with both test data and all sample data., Conclusions: The most important finding of this study was to establish a methodology that can identify the optimized coefficients for the Altman Z-Score, which allows a more accurate prediction of bankruptcy in Spanish private healthcare companies., (Copyright © 2018 SESPAS. Publicado por Elsevier España, S.L.U. All rights reserved.)

Establishing the best layout configuration for software-generated interfaces and control panels is a complex problem when they include many controls and indicators. Several methods have been developed for arranging the interface elements; however, the results are usually conceptual designs that must be manually adjusted to obtain layouts valid for real situations. Based on these considerations, in this work we propose a new automatized procedure to obtain optimal layouts for software-based interfaces. Eye-tracking and mouse-tracking data collected during the use of the interface is used to obtain the best configuration for its elements. The solutions are generated using a slicing-trees based genetic algorithm. This algorithm is able to obtain really applicable configurations that respect the geometrical restrictions of elements in the interface. Results show that this procedure increases effectiveness, efficiency and satisfaction of the users when they interact with the obtained interfaces., (Copyright © 2019 Elsevier Ltd. All rights reserved.)

Background: In order to fully characterize the genome of an individual, the reconstruction of the two distinct copies of each chromosome, called haplotypes, is essential. The computational problem of inferring the full haplotype of a cell starting from read sequencing data is known as haplotype assembly, and consists in assigning all heterozygous Single Nucleotide Polymorphisms (SNPs) to exactly one of the two chromosomes. Indeed, the knowledge of complete haplotypes is generally more informative than analyzing single SNPs and plays a fundamental role in many medical applications., Results: To reconstruct the two haplotypes, we addressed the weighted Minimum Error Correction (wMEC) problem, which is a successful approach for haplotype assembly. This NP-hard problem consists in computing the two haplotypes that partition the sequencing reads into two disjoint sub-sets, with the least number of corrections to the SNP values. To this aim, we propose here GenHap, a novel computational method for haplotype assembly based on Genetic Algorithms, yielding optimal solutions by means of a global search process. In order to evaluate the effectiveness of our approach, we run GenHap on two synthetic (yet realistic) datasets, based on the Roche/454 and PacBio RS II sequencing technologies. We compared the performance of GenHap against HapCol, an efficient state-of-the-art algorithm for haplotype phasing. Our results show that GenHap always obtains high accuracy solutions (in terms of haplotype error rate), and is up to 4× faster than HapCol in the case of Roche/454 instances and up to 20× faster when compared on the PacBio RS II dataset. Finally, we assessed the performance of GenHap on two different real datasets., Conclusions: Future-generation sequencing technologies, producing longer reads with higher coverage, can highly benefit from GenHap, thanks to its capability of efficiently solving large instances of the haplotype assembly problem. Moreover, the optimization approach proposed in GenHap can be extended to the study of allele-specific genomic features, such as expression, methylation and chromatin conformation, by exploiting multi-objective optimization techniques. The source code and the full documentation are available at the following GitHub repository: https://github.com/andrea-tango/GenHap .

Background: The Smad7 protein is negative regulator of the TGF-β signaling pathway, which is upregulated in patients with breast cancer. miRNAs regulate proteins expressions by arresting or degrading the mRNAs. The purpose of this work is to identify a miRNAs profile that regulates the expression of the mRNA coding for Smad7 in breast cancer using the data from patients with breast cancer obtained from the Cancer Genome Atlas Project., Methods: We develop an automatic search method based on genetic algorithms to find a predictive model based on deep neural networks (DNN) which fit the set of biological data and apply the Olden algorithm to identify the relative importance of each miRNAs., Results: A computational model of non-linear regression is shown, based on deep neural networks that predict the regulation given by the miRNA target transcripts mRNA coding for Smad7 protein in patients with breast cancer, with R 2 of 0.99 is shown and MSE of 0.00001. In addition, the model is validated with the results in vivo and in vitro experiments reported in the literature. The set of miRNAs hsa-mir-146a, hsa-mir-93, hsa-mir-375, hsa-mir-205, hsa-mir-15a, hsa-mir-21, hsa-mir-20a, hsa-mir-503, hsa-mir-29c, hsa-mir-497, hsa-mir-107, hsa-mir-125a, hsa-mir-200c, hsa-mir-212, hsa-mir-429, hsa-mir-34a, hsa-let-7c, hsa-mir-92b, hsa-mir-33a, hsa-mir-15b, hsa-mir-224, hsa-mir-185 and hsa-mir-10b integrate a profile that critically regulates the expression of the mRNA coding for Smad7 in breast cancer., Conclusions: We developed a genetic algorithm to select best features as DNN inputs (miRNAs). The genetic algorithm also builds the best DNN architecture by optimizing the parameters. Although the confirmation of the results by laboratory experiments has not occurred, the results allow suggesting that miRNAs profile could be used as biomarkers or targets in targeted therapies.

RGB-D sensors can collect postural data in an automatized way. However, the application of these devices in real work environments requires overcoming problems such as lack of accuracy or body parts' occlusion. This work presents the use of RGB-D sensors and genetic algorithms for the optimization of workstation layouts. RGB-D sensors are used to capture workers' movements when they reach objects on workbenches. Collected data are then used to optimize workstation layout by means of genetic algorithms considering multiple ergonomic criteria. Results show that typical drawbacks of using RGB-D sensors for body tracking are not a problem for this application, and that the combination with intelligent algorithms can automatize the layout design process. The procedure described can be used to automatically suggest new layouts when workers or processes of production change, to adapt layouts to specific workers based on their ways to do the tasks, or to obtain layouts simultaneously optimized for several production processes., (Copyright © 2017 Elsevier Ltd. All rights reserved.)

Intracellular protein folding (PF) is performed in a highly inhomogeneous, crowded, and correlated environment. Due to this inherent complexity, the study and understanding of PF phenomena is a fundamental issue in the field of computational systems biology. In particular, it is important to use a modeled medium that accurately reflects PF in natural systems. In the current study, we present a simulation wherein PF is carried out within an inhomogeneous modeled medium. Simulation resources included a two-dimensional hydrophobic-polar (HP) model, evolutionary algorithms, and the dual site-bond model. The dual site-bond model was used to develop an environment where HP beads could be folded. Our modeled medium included correlation lengths and fractal-like behavior, which were selected according to HP sequence lengths to induce folding in a crowded environment. Analysis of three benchmark HP sequences showed that the modeled inhomogeneous space played an important role in deeper energy folding and obtained better performance and convergence compared with homogeneous environments. Our computational approach also demonstrated that our correlated network provided a better space for PF. Thus, our approach represents a major advancement in PF simulations, not only for folding but also for understanding functional chemical structure and physicochemical properties of proteins in crowded molecular systems, which normally occur in nature.

Data mining methods in biomedical research might benefit by combining genetic algorithms with domain-specific knowledge. The objective of this research is to show how the evolution of treatment rules for autism might be guided. The semantic distance between two concepts in the taxonomy is measured by the number of relationships separating the concepts in the taxonomy. The hypothesis is that replacing a concept in a treatment rule will change the accuracy of the rule in direct proportion to the semantic distance between the concepts. The method uses a patient database and autism taxonomies. Treatment rules are developed with an algorithm that exploits the taxonomies. The results support the hypothesis. This research should both advance the understanding of autism data mining in particular and of knowledge-guided evolutionary search in biomedicine in general.

Bloodstain pattern analysis (BPA) is an approach to support forensic investigators in reconstructing the dynamics of bloody crimes. This forensic technique has been successfully applied in solving heinous and complex murder cases around the world and, recently, computer-based BPA approaches have been designed to better support investigators both in terms of speed and quality of analysis. However, despite its widespread use, current automatic techniques for BPA try to define some algorithmic steps to replicate a sequence of subjective investigators' tasks without relying on any mathematical formalism to compute an objective reconstruction of the crime. The lack of an objective mathematical foundation is a critical issue in a scenario where the quality of evidences can strongly affect a court trial and the life of people involved in that trial. This paper introduces the very first formal representation of BPA by means of an optimisation problem, on which to base the next generation of crime reconstruction techniques. As an example of the benefits provided by the proposed formal representation of BPA, a case study based on a genetic algorithm shows how the BPA optimisation problem can support investigators in performing a fast, precise, automatic and objective analysis., (Copyright © 2016. Published by Elsevier Ireland Ltd.)

Interactions among biological entities contain more information than purely the similarities between the entities. For example, interactions between genes, and gene products, can be more informative than the sequence similarities of the genes involved. However, the study of biological networks and their evolution in particular is still in its infancy. Simplified theoretical models of the development of biological networks from a starting state exist, but the problem of finding a distance between existing biological networks, with an unknown history, has seen less research. Metrics for network distance can also be used to measure the fit between theoretically derived networks and their real-world counterpart. In this article, we present a useful model of biological network distance and demonstrate an implementation using simulated gene regulatory networks. We compared our method with existing methods for network alignment and showed that we are much better able to identify evolutionary changes in biological networks. In particular, we can recover the evolutionary trees that describe the relationship between these networks.

Background: Protein-protein interaction networks are receiving increased attention due to their importance in understanding life at the cellular level. A major challenge in systems biology is to understand the modular structure of such biological networks. Although clustering techniques have been proposed for clustering protein-protein interaction networks, those techniques suffer from some drawbacks. The application of earlier clustering techniques to protein-protein interaction networks in order to predict protein complexes within the networks does not yield good results due to the small-world and power-law properties of these networks., Results: In this paper, we construct a new clustering algorithm for predicting protein complexes through the use of genetic algorithms. We design an objective function for exclusive clustering and overlapping clustering. We assess the quality of our proposed clustering algorithm using two gold-standard data sets., Conclusions: Our algorithm can identify protein complexes that are significantly enriched in the gold-standard data sets. Furthermore, our method surpasses three competing methods: MCL, ClusterOne, and MCODE in terms of the quality of the predicted complexes. The source code and accompanying examples are freely available at http://faculty.kfupm.edu.sa/ics/eramadan/GACluster.zip .

Biodiesel is a green (clean), renewable energy source and is an alternative for diesel fuel. Biodiesel can be produced from vegetable oil, animal fat and waste cooking oil or fat. Fats and oils react with alcohol to produce methyl ester, which is generally known as biodiesel. Because vegetable oil and animal fat wastes are cheaper, the tendency to produce biodiesel from these materials is increasing. In this research, the effect of some parameters such as the alcohol-to-oil molar ratio (4:1, 6:1, 8:1), the catalyst concentration (0.75%, 1% and 1.25% w/w) and the time for the transesterification reaction using ultrasonication on the rate of the fatty acids-to-methyl ester (biodiesel) conversion percentage have been studied (3, 6 and 9 min). In biodiesel production from chicken fat, when increasing the catalyst concentration up to 1%, the oil-to-biodiesel conversion percentage was first increased and then decreased. Upon increasing the molar ratio from 4:1 to 6:1 and then to 8:1, the oil-to-biodiesel conversion percentage increased by 21.9% and then 22.8%, respectively. The optimal point is determined by response surface methodology (RSM) and genetic algorithms (GAs). The biodiesel production from chicken fat by ultrasonic waves with a 1% w/w catalyst percentage, 7:1 alcohol-to-oil molar ratio and 9 min reaction time was equal to 94.8%. For biodiesel that was produced by ultrasonic waves under a similar conversion percentage condition compared to the conventional method, the reaction time was decreased by approximately 87.5%. The time reduction for the ultrasonic method compared to the conventional method makes the ultrasonic method superior., (Copyright © 2015. Published by Elsevier B.V.)

The aim of this article is to present a new face recognition system based on the fusion of visible and thermal features obtained from the most current local matching descriptors by maximizing face recognition rates through the use of genetic algorithms. The article considers a comparison of the performance of the proposed fusion methodology against five current face recognition methods and classic fusion techniques used commonly in the literature. These were selected by considering their performance in face recognition. The five local matching methods and the proposed fusion methodology are evaluated using the standard visible/thermal database, the Equinox database, along with a new database, the PUCV-VTF, designed for visible-thermal studies in face recognition and described for the first time in this work. The latter is created considering visible and thermal image sensors with different real-world conditions, such as variations in illumination, facial expression, pose, occlusion, etc. The main conclusions of this article are that two variants of the proposed fusion methodology surpass current face recognition methods and the classic fusion techniques reported in the literature, attaining recognition rates of over 97% and 99% for the Equinox and PUCV-VTF databases, respectively. The fusion methodology is very robust to illumination and expression changes, as it combines thermal and visible information efficiently by using genetic algorithms, thus allowing it to choose optimal face areas where one spectrum is more representative than the other.

This paper describes a hybrid level set approach for medical image segmentation. This new geometric deformable model combines region- and edge-based information with the prior shape knowledge introduced using deformable registration. Our proposal consists of two phases: training and test. The former implies the learning of the level set parameters by means of a Genetic Algorithm, while the latter is the proper segmentation, where another metaheuristic, in this case Scatter Search, derives the shape prior. In an experimental comparison, this approach has shown a better performance than a number of state-of-the-art methods when segmenting anatomical structures from different biomedical image modalities., (Copyright © 2013 Elsevier Ltd. All rights reserved.)

Artificial Neuron-Glia Networks (ANGNs) are a novel bio-inspired machine learning approach. They extend classical Artificial Neural Networks (ANNs) by incorporating recent findings and suppositions about the way information is processed by neural and astrocytic networks in the most evolved living organisms. Although ANGNs are not a consolidated method, their performance against the traditional approach, i.e. without artificial astrocytes, was already demonstrated on classification problems. However, the corresponding learning algorithms developed so far strongly depends on a set of glial parameters which are manually tuned for each specific problem. As a consequence, previous experimental tests have to be done in order to determine an adequate set of values, making such manual parameter configuration time-consuming, error-prone, biased and problem dependent. Thus, in this paper, we propose a novel learning approach for ANGNs that fully automates the learning process, and gives the possibility of testing any kind of reasonable parameter configuration for each specific problem. This new learning algorithm, based on coevolutionary genetic algorithms, is able to properly learn all the ANGNs parameters. Its performance is tested on five classification problems achieving significantly better results than ANGN and competitive results with ANN approaches.

We describe a new technique to fit conductance-based neuron models to intracellular voltage traces from isolated biological neurons. The biological neurons are recorded in current-clamp with pink (1/f) noise injected to perturb the activity of the neuron. The new algorithm finds a set of parameters that allows a multicompartmental model neuron to match the recorded voltage trace. Attempting to match a recorded voltage trace directly has a well-known problem: mismatch in the timing of action potentials between biological and model neuron is inevitable and results in poor phenomenological match between the model and data. Our approach avoids this by applying a weak control adjustment to the model to promote alignment during the fitting procedure. This approach is closely related to the control theoretic concept of a Luenberger observer. We tested this approach on synthetic data and on data recorded from an anterior gastric receptor neuron from the stomatogastric ganglion of the crab Cancer borealis. To test the flexibility of this approach, the synthetic data were constructed with conductance models that were different from the ones used in the fitting model. For both synthetic and biological data, the resultant models had good spike-timing accuracy., (Copyright © 2014 the American Physiological Society.)

As a promising tool for monitoring the physical world, directional sensor networks (DSNs) consisting of a large number of directional sensors are attracting increasing attention. As directional sensors in DSNs have limited battery power and restricted angles of sensing range, maximizing the network lifetime while monitoring all the targets in a given area remains a challenge. A major technique to conserve the energy of directional sensors is to use a node wake-up scheduling protocol by which some sensors remain active to provide sensing services, while the others are inactive to conserve their energy. In this paper, we first address a Maximum Set Covers for DSNs (MSCD) problem, which is known to be NP-complete, and present a greedy algorithm-based target coverage scheduling scheme that can solve this problem by heuristics. This scheme is used as a baseline for comparison. We then propose a target coverage scheduling scheme based on a genetic algorithm that can find the optimal cover sets to extend the network lifetime while monitoring all targets by the evolutionary global search technique. To verify and evaluate these schemes, we conducted simulations and showed that the schemes can contribute to extending the network lifetime. Simulation results indicated that the genetic algorithm-based scheduling scheme had better performance than the greedy algorithm-based scheme in terms of maximizing network lifetime.

Image registration is a fundamental task used in image processing to match two or more images taken at different times, from different sensors or from different viewpoints. The objective is to find in a huge search space of geometric transformations, an acceptable accurate solution in a reasonable time to provide better registered images. Exhaustive search is computationally expensive and the computational cost increases exponentially with the number of transformation parameters and the size of the data set. In this work, we present an efficient image registration algorithm that uses genetic algorithms within a multi-resolution framework based on the Non-Subsampled Contourlet Transform (NSCT). An adaptable genetic algorithm for registration is adopted in order to minimize the search space. This approach is used within a hybrid scheme applying the two techniques fitness sharing and elitism. Two NSCT based methods are proposed for registration. A comparative study is established between these methods and a wavelet based one. Because the NSCT is a shift-invariant multidirectional transform, the second method is adopted for its search speeding up property. Simulation results clearly show that both proposed techniques are really promising methods for image registration compared to the wavelet approach, while the second technique has led to the best performance results of all. Moreover, to demonstrate the effectiveness of these methods, these registration techniques have been successfully applied to register SPOT, IKONOS and Synthetic Aperture Radar (SAR) images. The algorithm has been shown to work perfectly well for multi-temporal satellite images as well, even in the presence of noise.

To accelerate the convergence rate of high-dimensional optimization problems, inspired by the cooperative hunting process of spider colonies named Anelosimus eximius, a new A. eximius colony algorithm (AECA) was proposed to solve combinatorial optimization problems. In the AECA, a certain direction component of the problem solution is represented as a certain direction in which a spider travels, so that a high-dimensional optimization problem can be transformed into multiple low-dimensional optimization problems. The AECA includes two intelligent behaviors: the random walk of spiders and the summoning of the initiator. The random walk of spiders ensures the diversity of spider colonies, whereas the summoning of the initiator can accelerate the convergence rate. We theoretically proved that the AECA is globally convergent. The inversion method of asteroid spectrum reflectance template can be used to solve the problem that the measured planetary spectrum is affected by the asteroid absorption effect and improves the accuracy of celestial Doppler difference velocimetry, which uses celestial spectrum to provide the information of velocity measurement for navigation. The essence of this method is the optimal combination problem of intrinsic mode functions (IMFs). We applied the AECA to the inversion of the planetary spectrum reflectance template. Experimental results show that, compared with genetic algorithms (GAs), the AECA can obtain the optimal combination of spectrum reflectance templates faster. In addition, to verify the universality of the AECA, for the classical knapsack problem, the AECA has a better optimization effect, faster convergence rate, and higher stability than other swarm intelligence algorithms such as GA, discrete particle swarm optimization, and the quantum genetic algorithm. [ABSTRACT FROM AUTHOR]

Hellenic Open University has been developing Onlabs, a virtual biology laboratory simulating its on-site laboratory, for its students to be trained before the on-site learning activities. The evaluation of user performance in Onlabs is based on a scoring algorithm, which admits some optimization by means of Genetic Algorithms and Artificial Neural Networks. Moreover, for a particular experimental procedure (microscoping), we have experimented with incorporating into it some background knowledge about the procedure, which allows one to break it down in a series of conceptually linked steps in a hierarchical fashion. In this work, we review the flat and hierarchical modes used for the calibration of the automated assessment mechanism and offer an experimental comparison of both approaches with the aim of devising automated scoring schemes which are fit for training in an at-a-distance learning context. Overall, the genetic algorithm fails to deliver good convergence results in the non-hierarchical setting but performs better in the hierarchical one. On the other hand, the neural network most of the time converges, with the non-hierarchical network achieving a slightly better convergence than the hierarchical one, with the latter, however, delivering a smoother and more realistic assessment mechanism. [ABSTRACT FROM AUTHOR]

In order to implement personalized recommendation algorithms for e-commerce, the author proposes a genetic fuzzy algorithm based on user behavior to improve the sales, personalized recommendation, user satisfaction, and purchase matching performance of e-commerce. Collect data based on e-commerce personalized preference recommendation information, extract the associated feature quantities of personalized data for clustering processing, and then combine fuzzy B-means clustering method to achieve e-commerce personalized recommendation. According to the individual preferences of e-commerce, the collected data samples are fitted with differences and restructured, and a genetic evolution method is adopted for global optimization. The experimental results show that the optimized genetic fuzzy algorithm used in this method has improved stability and accuracy compared to the PSO method, with an accuracy increase of 4%. This proves that the algorithm can provide the services needed by users more quickly and is an effective means. [ABSTRACT FROM AUTHOR]

Process discovery approaches analyze the business data to automatically uncover structured information, known as a process model. The quality of a process model is measured using quality dimensions, completeness (replay fitness), preciseness, simplicity, and generalization. Traditional process discovery algorithms usually output a single process model. A single model may not accurately capture the observed behavior and overfit the training data. We have formed the process discovery problem in a multiobjective framework that yields several candidate solutions for the end user who can pick a suitable model based on the local environmental constraints (possibly varying). We consider the Binary Differential Evolution approach in a multiobjective framework for the task of process discovery. The proposed method employs dichotomous crossover/mutation operators. The parameters are tuned using grey relational analysis combined with the Taguchi approach. We have compared the proposed approach with the well‐known single‐objective algorithms and state‐of‐the‐art multiobjective evolutionary algorithm—Nondominated Sorting Genetic Algorithm (NSGA‐II). Additional comparison via computing a weighted average of the quality dimensions is also undertaken. Results show that the proposed algorithm is computationally efficient and produces diversified candidate solutions that score high on the fitness functions. It is shown that the process models generated by the proposed approach are superior to or at least as good as those generated by the state‐of‐the‐art algorithms. [ABSTRACT FROM AUTHOR]

This study presents a new approach for Maximum Power Point Tracking (MPPT) by combining the honey badger algorithm (HBA) with a Genetic Algorithm (GA). The integration aims to optimize photovoltaic (PV) system performance in partial shading conditions (PSCs). Initially, the HBA is utilized to explore extensively and identify potential solutions while avoiding local optima. If necessary, the GA is then employed to escape local optima through selection, crossover, and mutation operations. On average, this proposed method has a 40% improvement in tracking time and 0.77% in efficiency compared with the HBA. In a dynamic case, the proposed method achieves a 4.81% improvement compared to HBA. [ABSTRACT FROM AUTHOR]

The coverage tasks of mobile robots are evolving towards large-scale and intelligent di- rections demanding urgent requirements for the coverage efficiency and environmental adaptabil- ity of coverage path planning. To address the inadequate adaptability of the traditional boustro- phedon cellular decomposition in complex maps and to improve coverage efficiency, a complete coverage path planning method is proposed. Firstly, based on the boustrophedon cellular decom- position method. a strategy of area-descending traversal and monotone polygon judgment was proposed to merge cells, reducing approximately half of the cell quantity. Finally, by establis- hing the mapping relationship between the starting and ending positions of cells, a genetic algo- rithm was employed to optimize the selection of cells' starting positions and the global access or- der. The research results show that: 1) when processing maps with dimensions of 1 300 pixels. the algorithm in this paper can obtain calculation results within 10 s, and compared with the boustrophedon method, neural network method, and contour line method, the growth rate of calculation time is smaller with the increase of map area: 2) compared with the boustrophedon method, contour line method, neural network method, and energy-optimal method, the total op- eration time of robots in this paper is reduced by 5.4% to 47.0%, and the ineffective operation time is reduced by 5.8% to 29.2%; 3) the average coverage rate of this algorithm on 1 800 test maps reaches 99,91%; 4) the tests further confirm the significant coverage efficiency advantages of the algorithm proposed in this paper. [ABSTRACT FROM AUTHOR]

The question "How does it work" has motivated many scientists. Through the study of natural phenomena and behaviors, many intelligence algorithms have been proposed to solve various optimization problems. This paper aims to offer an informative guide for researchers who are interested in tackling optimization problems with intelligence algorithms. First, a special neural network was comprehensively discussed, and it was called a zeroing neural network (ZNN). It is especially intended for solving time-varying optimization problems, including origin, basic principles, operation mechanism, model variants, and applications. This paper presents a new classification method based on the performance index of ZNNs. Then, two classic bio-inspired algorithms, a genetic algorithm and a particle swarm algorithm, are outlined as representatives, including their origin, design process, basic principles, and applications. Finally, to emphasize the applicability of intelligence algorithms, three practical domains are introduced, including gene feature extraction, intelligence communication, and the image process. [ABSTRACT FROM AUTHOR]

The School Bus Routing Problem (SBRP) is a challenging optimization problem that has received increasing attention in recent years. The problem is composed of three sub-problems: facility location selection, assignment problem, and vehicle routing problem, which can be solved in a single stage or across multiple stages. In this study, we propose a novel two-stage approach to solve the SBRP that combines Fuzzy C Means (FCM) and K-means clustering algorithms with a Genetic Algorithm (GA). In the first stage, we used FCM and K-means to identify the optimal bus stop locations and assigned students to the nearest stop based on the distance metric. This two-stage approach reduces the search space and improves the efficiency of the GA in the second stage. In the second stage, we employed the GA to generate the optimal vehicle route that minimizes the total distance traveled by all vehicles. We compared our results with those in the literature and found that the K Means-GA approach outperformed the previous results. However, the FCM-GA approach yielded significantly inferior results, indicating that the choice of clustering algorithm plays a crucial role in the performance of the overall system. Our study provides insights into the importance of selecting appropriate clustering algorithms for solving the SBRP and proposes a two-stage solution that can be easily implemented in real-world scenarios. Our approach reduces the computational time and provides an effective solution for reducing the total distance traveled by school buses. [ABSTRACT FROM AUTHOR]

The fault location of an active distribution network is a vital analysis to prevent major outages in the power system. Considering the influence of renewable distributed generations on fault characteristics, this paper proposes a novel location method based on a dynamic quantum genetic algorithm to solve for fault locations in active distribution networks. In the method, the fault current code is measured based on feeder terminal units. A universal switching function is presented to convert the feeder switch status into an uploaded fault current code. The fault location model is defined as an optimization problem that presents the evaluation objective function with an anti-false-positive factor. The dynamic quantum genetic algorithm is developed to locate the fault feeder according to the uploaded fault current code of the feeder terminal unit. The algorithm adopts dynamic rotating gate strategy and adaptive quantum crossover strategy to satisfy the requirements of quickness and accuracy for fault location. Moreover, the method avoids easily falling into a local optimum by integrating the discrete quantum mutation. The proposed fault location technique is tested and compared to other existing techniques on a 33-bus active distribution network. The simulation results show that the proposed fault location method can locate fault feeders accurately with fast computational times under conditions of single or multiple faults and with an information distortion of the feeder terminal unit. [ABSTRACT FROM AUTHOR]

This study introduces an integrated power quality (PQ) conditioner, referred to as UPQC, that is linked with photovoltaic (PV) and battery energy systems (BSS) in order to address and solve PQ issues. It is proposed to employ the Levenberg–Marquardt (LM) backpropagation (LMBP) trained artificial neural network control (ANNC) technique for generating reference signal for converters in UPQC. This approach eliminates the need for traditional abc to dq0 to αβ conversions. Additionally, the hybrid algorithm (FFHSA) in combination of harmony search algorithm (HSA), and firefly algorithm (FFA) is also implemented for the optimal selection of adaptive neuro-fuzzy interface system (ANFIS) parameters to maintain direct current link capacitor voltage (DLCV) constant. The prime goal of the developed hybrid ANNC-FFHSA is to stabilize the DLCV with low settling time during load and solar irradiation (G), Temperature (T) changes, minimization of distortions in the source current signal to diminish total harmonic distortion (THD) in turn boosting the power factor (PF), suppression of fluctuations like disturbances, swell, sag and unbalances in the supply voltage. The suggested method is validated by four test cases with several combinations of variable irradiation (G), temperature and loads. On the other hand, to reveal the superiority of the developed method, the comparison is carried out with the genetic algorithm (GA) and Ant colony algorithm (ACA) along with instantaneous power (p–q) and Synchronous reference frame (SRF) conventional methods. The proposed approach significantly diminishes the total harmonic distortion to values of 3.61%, 3.48%, 3.48%, and 4.51%, which are notably lower compared to the values reported in the existing literature and also improves the power factor to almost unity. The design and implementation of this method were carried out using MATLAB/Simulink software. [ABSTRACT FROM AUTHOR]

With the growth of online networks, understanding the intricate structure of communities has become vital. Traditional community detection algorithms, while effective to an extent, often fall short in complex systems. This study introduced a meta-heuristic approach for community detection that leveraged a memetic algorithm, combining genetic algorithms (GA) with the stochastic hill climbing (SHC) algorithm as a local optimization method to enhance modularity scores, which was a measure of the strength of community structure within a network. We conducted comprehensive experiments on five social network datasets (Zachary's Karate Club, Dolphin Social Network, Books About U.S. Politics, American College Football, and the Jazz Club Dataset). Also, we executed an ablation study based on modularity and convergence speed to determine the efficiency of local search. Our method outperformed other GA-based community detection methods, delivering higher maximum and average modularity scores, indicative of a superior detection of community structures. The effectiveness of local search was notable in its ability to accelerate convergence toward the global optimum. Our results not only demonstrated the algorithm's robustness across different network complexities but also underscored the significance of local search in achieving consistent and reliable modularity scores in community detection. [ABSTRACT FROM AUTHOR]

Efficient coordinated scheduling has long been a focal point in port research, complicated by the diverse optimization goals dictated by different port characteristics. This study focuses on Yangtze River ports, exploring coordinated scheduling amidst river–sea intermodal transportation. Our research aims to reduce berth deviation costs and shorten the total scheduling time for ships, while maximizing berth utilization rates for ports. Initially, we analyzed the operational realities of Yangtze River ports and waterways. Subsequently, we innovatively introduced three key factors influencing scheduling: berth preferences, seagoing ship inspections, and planning cycles. Finally we proposed the optimized Non-dominated Sorting Genetic Algorithm III (NSGA-III). Evaluating the model using a seven-day dataset of vessel activities at Yangtze River ports revealed significant improvements: the optimized NSGA-III enhanced objective values by 30.81%, 13.73%, and 12.11% compared to the original scheduling approach, surpassing both conventional NSGA-III and NSGA-II algorithms. This study underscores the model's efficacy in not only reducing operational costs through optimized ship and berth sequencing but also in enhancing clearance efficiency for relevant authorities. [ABSTRACT FROM AUTHOR]

Many-objective optimization presents unique challenges in balancing diversity and convergence of solutions. Traditional approaches struggle with this balance, leading to suboptimal solution distributions in the objective space especially at higher number of objectives. This necessitates the need for innovative strategies to adeptly manage these complexities. This study introduces a Many-Objective Artificial Hummingbird Algorithm (MaOAHA), an advanced evolutionary algorithm designed to overcome the limitations of existing many-objective optimization methods. The objectives are to improve convergence rates, maintain solution diversity, and achieve a uniform distribution in the objective space. MaOAHA implements information feedback mechanism (IFM), reference point-based selection and association, non-dominated sorting, and niche preservation. The IFM utilizes historical data from previous generations to inform the update process, thereby improving the algorithm's the exploration and exploitation capabilities. Reference point-based selection, along with non-dominated sorting, ensures solutions are both close to the Pareto front and evenly spread in the objective space. Niche preservation and density estimation strategies are employed to maintain diversity and prevent overcrowding. The comprehensive experimental analysis benchmarks MaOAHA against four leading algorithms viz. Many-Objective Gradient-Based Optimizer, Many-Objective Particle Swarm Optimizer, Reference Vector Guided Evolutionary Algorithm, and Nondominated Sorting Genetic Algorithm III. The DTLZ1–DTLZ7 benchmark sets with four, six, and eight objectives and five real-world problems (RWMaOP1–RWMaOP5) are considered for performance assessment of the selected algorithms. The results demonstrate that internal parameter-free MaOAHA significantly outperforms its counterparts, achieving better generational distance by up to 52.38%, inverse generational distance by up to 38.09%, spacing by up to 56%, spread by up to 71.42%, hypervolume by up to 44%, and runtime by up to 52%. These metrics affirm the MaOAHA's capability to enhance the decision-making processes through its adept balance of convergence, diversity, and uniformity. [ABSTRACT FROM AUTHOR]

With the rapid development of heterogeneous network technologies, such as mobile edge computing, satellite communications, self-organizing networks, and the wired Internet, satisfying users' increasingly diversified and complex communication needs in dynamic and evolving network environments has become a critical research topic. Ensuring secure and reliable information transmission is essential for stable network operation in these complex environments. Addressing this challenge, this study proposed a secure and reliable multi-objective optimized multipath transmission algorithm for heterogeneous networks to enhance security and reliability during data transmission. The core principle of this algorithm was that multipath transmission can provide additional protection through redundant paths. This redundancy ensured that even if one path is attacked or fails, alternative paths can maintain data integrity and reachability. In this study, we employed the Optimized Non-dominated Sorting Genetic Algorithm II (ONSGA-II) to determine the range of the initial population and filter suitable paths by optimizing them according to different demand objectives. In the path selection process, we introduced an innovative deletion graph method, which ensures that redundant paths do not share any common links with the original paths, except when there are unique links. This approach enhances the independence of transmission paths and improves the security of the transmission process. It effectively protects against security threats such as single points of failure and link attacks. We have verified the effectiveness of the algorithm through a series of experiments, and the proposed algorithm can provide decision-makers with high-reliability and low-latency transmission paths in heterogeneous network environments. At the same time, we verified the performance of the algorithm when encountering attacks, which is superior to other classical algorithms. Even in the face of network failures and attacks, it can maintain a high level of data integrity and security. [ABSTRACT FROM AUTHOR]

As the real estate industry expands with time, the personalized needs of users for indoor space layouts have become increasingly complex. Traditional indoor space layout design methods can no longer meet the needs of large market groups because of their complex steps and low levels of specialization. Therefore, this study first analyzes the problematic factors in indoor space layout design. Second, an interactive genetic algorithm is introduced to solve the multifactor optimal selection problem; the process is optimized and improved using a differential evolution algorithm. A comprehensive spatial layout model combining interactive genetic and differential evolution algorithms is proposed. The experimental results show that the model performs best with uniform variation, and its average number of iterations to find the optimal individual is 57. In addition, compared with similar layout models, the proposed model achieved the highest space utilization value of 79%, which is approximately 19% higher than that for the stacking layout model; it also required the shortest time, that is, 15 min. In summary, the proposed model provides a new intelligent method for indoor layout design, which is expected to improve the satisfaction of designers and users. [ABSTRACT FROM AUTHOR]

To enhance the interactivity of spatial design, this study proposes an indoor spatial layout design method based on differential evolution algorithm, which combines backtracking strategy and reverse learning strategy to improve the interactive differential evolution algorithm. The experimental data demonstrated that the proposed method for indoor space layout design achieved an average user satisfaction of 81.7%, which increased by 16.8% compared with traditional interactive genetic algorithms. In addition, the improved human-computer interaction interface scored higher than 0.8 in terms of usability, reliability, customizability, and interactive feedback. This means that the improved interface can better meet user needs and provide a better user experience. This study shows that the indoor space layout design method ground on differential evolution algorithm and the improved human-computer interaction interface can significantly improve user satisfaction and user experience. This has brought more efficient and convenient solutions to the field of spatial design. [ABSTRACT FROM AUTHOR]

Thrust allocation (TA) plays a critical role in the dynamic positioning system (DPS). The task of TA is to allocate the rotational speed and angle of each thruster to generate the generalized control forces. Most studies take TA as a single-objective optimization problem; however, TA is a multi-objective optimization problem (MOP), which needs to satisfy multiple conflicting allocation objectives simultaneously. This study proposes an improved multi-objective particle swarm optimization (IMOPSO) method to deal with the non-convex MOP of TA. The objective functions of reducing the allocation error, and minimizing the power consumption and the tear-and-wear of thrusters under physical constraints, are established and solved via MOPSO. To enhance the global seeking ability, the improved mutation strategy combined with the roulette wheel mechanism is adopted. It is shown through test data that IMOPSO converges better than multi-objective algorithms such as MOPSO and nondominated sorting genetic algorithm II (NSGA-II). Simulations are conducted for a DP ship with two propeller–rudder combinations. The simulation results with the single-objective PSO algorithm show that the proposed IMOPSO algorithm reduces thrust allocation errors in the three directions of surge, sway, and yaw by 48.48%, 39.64%, and 15.02%, respectively, and reduces power consumption by 44.53%, which demonstrates the feasibility and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This study investigates the problem of rapid search planning for moving targets in maritime emergencies using an improved adaptive immune genetic algorithm. Given the complexity and uncertainty inherent in searching for moving targets in maritime emergency situations, a task planning method based on the improved adaptive immunogenetic algorithm (IAIGA) is proposed to enhance search efficiency and accuracy. This method utilizes a priori information to construct the potential regions of the target and the distribution probability within each region. It establishes a "prediction-scheduling" search strategy model, planning a rapid search task for disconnected targets based on overlapping probability through the IAIGA. By incorporating an immune mechanism, the algorithm enhances its global search capability and robustness. Additionally, the adaptive strategy enables dynamic adjustment of the algorithm's parameters to accommodate varying search scenarios. The experimental results demonstrate that the proposed IAIGA significantly outperforms traditional methods, providing higher search speeds and more accurate search results in the context of maritime emergency response. These findings offer effective technical support for maritime emergency operations. [ABSTRACT FROM AUTHOR]

Ensuring optimal load balancing is imperative for maintaining reliability and upholding quality of service as specified in service-level agreements (SLAs) for cloud computing providers. This research addresses the most common shortcomings of existing state-of-the-art methods, which often lack responsiveness and struggle to adapt to exponentially increasing demand, especially in the era of the internet of things (IoT). The proposed hybrid approach surpasses current literature approaches in performance metrics such as makespan, response time, number of cloudlet migrations, and SLA violations. It operates on two levels, initially employing a k-means clustering algorithm to group servers within each datacenter based on similar utilization rates. Subsequently, a round-robin method allocates task groups sequentially to non-overloaded clusters, and within each cluster, a genetic algorithm optimally assigns tasks to servers. This multilayered approach facilitates hot-deployment and scalability in operational cloud environments while promoting strong interoperability and decoupling of core mechanisms missions. Simulation experiments conducted on CloudSim Plus validate the superiority of our method, positioning it as a robust solution for enhancing load balancing and tasks scheduling in cloud environments, especially in the face of rapidly increasing IoT-related demands. [ABSTRACT FROM AUTHOR]

This paper studies the optimization of hydraulic parameters for pipeline system of hydropower station with super long headrace tunnel (HSSLHT) based on mayfly algorithm considering operational scenarios. Firstly, the state equation of HSSLHT under load disturbance is derived. The optimization design of hydraulic parameters for pipeline system based on mayfly algorithm is proposed. Then, the optimization of hydraulic parameters is conducted and analyzed. Finally, the effects of pipeline diameters and transfer coefficients of turbines on the optimization of hydraulic parameters for pipeline systems are revealed. The results show that the optimization of hydraulic parameters for pipeline system is a multiobjective problem, and the several objective functions exhibit significant conflicts. Compared to the firefly algorithm and genetic algorithm, the objective function under mayfly algorithm is improved by 14.7% and 5.1%, respectively. The mayfly algorithm can make the hydraulic parameters for the pipeline system reach the Pareto optimal solution under both load decrease condition and load increase condition. The diameter of penstock has an obvious influence on the robustness of dynamic performance of HSSLHT. When the diameter of penstock increases by 30%, the robustness of HSSLHT becomes worse and the robustness index deteriorates by 57%. The reason is that the flow inertia of penstock becomes smaller with the increase of diameter, and the flow inertia of penstock is favorable for resisting disturbance of HSSLHT. The coefficient of throttled orifice head loss and the lengths and head losses of headrace tunnel and penstock are the key hydraulic parameters for matching the operation of HSSLHT. [ABSTRACT FROM AUTHOR]

Network function virtualization can increase the versatility of computing and network platforms, enabling them to provide more flexible services. In terms of a softwaredefined network and network function virtualization environment, this paper explores the joint virtual network function (VNF) deployment and traffic routing in multisource multicast for VNF service chain deployment to minimize the deployment overhead, transmission delay. Firstly, a multi-objective optimization model, which minimizes the deployment overhead and transmission delay, is established to tackle this challenge problem. Then, a highly efficient coding scheme, crossover, and mutation operators are designed. Based on these, an improved genetic algorithm in multi-objective evolutionary algorithm based on decomposition (MOEA/D) framework (GA-MOEA/D) is proposed to solve this multi-objective problem. Finally, simulation experiments are conducted using two widely used network topologies in order to demonstrate the performance of the proposed algorithm. The simulation results demonstrate that the proposed algorithm can obtain the smaller deployment overhead, transmission delay, load degree and energy consumption 5.2%-15.61%, 11.2%-26.4%, 8.3%-17.6% and 7.8%-14.4% than that of the compared algorithm, respectively. [ABSTRACT FROM AUTHOR]

To improve cargo loading efficiency and achieve diverse needs of companies for the loading process, this paper innovatively establishes a multiple objective mixed integer programming model for the three-dimensional multiple bin-size bin packing problem (3D-MBSBPP). The model is designed to maximize container space utilization rate and cargo load balance, minimize container usage costs, and incorporates some practical constraints. On this basis, we propose a novel dynamic feedback algorithm based on spatial corner fitness (SCF_DFA) to solve this model, which consists of three stages. Specifically, Stage 1 employs a heuristic algorithm based on spatial corner fitness to optimize the search of the remaining spaces. Stage 2 employs a container type selection algorithm to dynamically adjust and optimize container types. Stage 3 uses an improved genetic algorithm to improve the quality of the solutions of the first two stages. We demonstrate the effectiveness of the proposed algorithm through comparative experiments on benchmark instances, and apply it to solve the real-life instances for the 3D-MBSBPP. The results show that the proposed algorithm can make the average container space utilization rate reach 85.38%, which is 1.48% higher than that of baseline method, while the loading results obtained are more balanced, indicating the advantages of the SCF_DFA in solving 3D-MBSBPP. Furthermore, we conduct ablation experiments to confirm the effectiveness of each component within the algorithm. [ABSTRACT FROM AUTHOR]

One of the most important issues in the design of cryptographic algorithms is studying their cryptographic strength. Among the factors determining the reliability of cryptographic algorithms, a good pseudorandom sequence generator, which is used for key generation, holds particular significance. The main goal of this work is to verify the normal distribution of pseudorandom sequences obtained using the generation algorithm and demonstrate that there is no mutual statistical correlation between the values of the resulting sequence. If these requirements are met, we will consider such a generator reliable. This article describes the pseudorandom sequence generation algorithm and outlines the steps for each operation involved in this algorithm. To verify the properties of the pseudorandom sequence generated by the proposed algorithm, it was programmatically implemented in the Microsoft Visual C++ integrated development environment. To assess the statistical security of the pseudorandom sequence generation algorithm, 1000 files with a block length of 10000 bits and an initial data length of 256 bits were selected. Statistical analysis was conducted using tests by D. Knuth and NIST. As shown in the works of researchers, the pseudorandom sequence generation algorithm, verified by these tests, can be considered among the reliable algorithms. The results of each graphical test by D. Knuth are presented separately. The graphical tests were evaluated using values obtained from each test, while the chi-squared criterion with degrees of freedom 2k – 1 was used to analyze the evaluation tests. The success or failure of the test was determined using a program developed by the Information Security Laboratory. Analysis of the data from the D. Knuth tests showed good results. In the NIST tests, the P-value for the selected sequence was calculated, and corresponding evaluations were made. The output data obtained from the NIST tests also showed very good results. The proposed pseudorandom sequence generation algorithm allows generating and selecting a high-quality pseudorandom sequence of a specified length for use in the field of information security. [ABSTRACT FROM AUTHOR]

The effective functioning and regulation of power systems crucially rely on the coordination of distance and directional overcurrent relays. Accurate fault detection and successful clearing sequences require support for each relay and the maintenance of the coordination time interval (CTI) between major distance relays, directional overcurrent relay support, and other relay zones. Efficiently initiating relays while adhering to complex coordination limitations poses a challenging task that demands innovative solutions. This study addresses the intricate problem of relay coordination by employing heuristic methods, specifically genetic algorithms (GA) and biogeography-based optimization (BBO), in both a 9-bus and 39-bus system. The primary objective is to determine the most efficient time setting factor (TSM) that minimizes the duration of relay operation. Additionally, the intelligent features of the overcurrent relay are carefully chosen to enhance the research's results. The integration of edge computing capabilities plays a significant role in advancing this coordination method. By incorporating advanced algorithms and communication technologies at the edge, the prompt activation of relays becomes possible, thereby meeting coordination demands. This study explores the combination of edge-based servers with genetic algorithms (GA) and biogeography-based optimization (BBO) techniques to enhance relay coordination. The findings indicate a notable enhancement compared to conventional approaches. However, comparative research suggests that BBO's performance is similar to GA, without a distinct advantage in achieving higher outcomes. [ABSTRACT FROM AUTHOR]