Search Results (252)

Automated generative design is increasingly used across engineering disciplines to accelerate innovation and reduce costs. Generative design offers the prospect of simplifying manual design tasks by exploring the efficacy of solutions automatically. However, existing generative design frameworks rely heavily on expensive optimisation procedures and often produce customised solutions, lacking reusable generative rules that transfer across different problems. This work presents a bioinspired generative design algorithm utilising the concept of evolutionary development (EvoDevo). This evolves a set of developmental rules that can be applied to different engineering problems to rapidly develop designs without the need to run full optimisation procedures. In this approach, an initial design is decomposed into simple entities called cells, which independently control their local growth over a development cycle. In biology, the growth of cells is governed by a gene regulatory network (GRN), but there is no single widely accepted model for this in artificial systems. The GRN responds to the state of the cell induced by external stimuli in its environment, which, in this application, is the loading regime on a bridge truss structure (but can be generalised to any engineering structure). Two GRN models are investigated: graph neural network (GNN) and graph-based Cartesian genetic programming (CGP) models. Both GRN models are evolved using a novel genetic search algorithm for parameter search, which can be re-used for other design problems. It is revealed that the CGP-based method produces results similar to those obtained using the GNN-based methods while offering more interpretability. In this work, it is shown that this EvoDevo approach is able to produce near-optimal truss structures via growth mechanisms such as moving vertices or changing edge features. The technique can be set up to provide design automation for a range of engineering design tasks. Full article

Capsicum (pepper) is an economically vital genus in the Solanaceae family, with most species possessing about 3 Gb genomes. However, the recently sequenced Capsicum rhomboideum (~1.7 Gb) represents the first reported case of an extremely compact genome in Capsicum, providing a unique and ideal model for studying genome size evolution. To elucidate the mechanisms driving this variation, we performed comparative genomic analyses between the compact Capsicum rhomboideum and the reference Capsicum annuum cv. CM334 (~2.9 Gb). Although their genome size differences initially suggested whole-genome duplication (WGD) as a potential driver, both species shared two ancient WGD events with identical timing, predating their divergence and thus ruling out WGD as a direct contributor to their size difference. Instead, transposable elements (TEs), particularly long terminal repeat retrotransposons (LTR-RTs), emerged as the dominant force shaping genome size variation. Genome size strongly correlated with LTR-RT abundance, and multiple LTR-RT burst events aligned with major phases of genome expansion. Notably, the integrity and transcriptional activity of LTR-RTs decline over evolutionary time; older insertions exhibit greater structural degradation and reduced activity, reflecting their dynamic nature. This study systematically delineated the evolutionary trajectory of LTR-RTs—from insertion and proliferation to decay–uncovering their pivotal role in driving Capsicum genome size evolution. Our findings advance the understanding of plant genome dynamics and provide a framework for studying genome size variation across diverse plant lineages. Full article

Pedestrian flow simulations play a pivotal role in urban planning, transportation engineering, and disaster response by enabling the detailed analysis of crowd dynamics and walking behavior. While physical models such as the Social Force model and Boids have been widely used, they often struggle to replicate complex inter-agent interactions. On the other hand, reinforcement learning (RL) methods, although adaptive, suffer from limited interpretability due to their opaque policy structures. To address these limitations, this study proposes a pedestrian simulation framework based on the Anticipatory Classifier System 2 (ACS2), a rule-based evolutionary learning model capable of extracting explicit behavior rules through trial-and-error learning. The proposed model captures the interactions between agents and environmental features while preserving the interpretability of the acquired strategies. Simulation experiments demonstrate that the ACS2-based agents reproduce realistic pedestrian dynamics and achieve comparable adaptability to conventional reinforcement learning approaches such as tabular Q-learning. Moreover, the extracted behavior rules enable systematic analysis of movement patterns, including the effects of obstacles and crowd composition on flow efficiency and group alignment. The results suggest that the ACS2 provides a promising approach to constructing interpretable multi-agent simulations for real-world pedestrian environments. Full article

High-accuracy streamflow forecasting with long lead times can help promote the efficient utilization of water resources. However, the construction of cascade reservoirs has allowed the evolution of natural continuous rivers into multi-block rivers. The existing streamflow forecasting methods fail to consider the impact of reservoir operation. Thus, a novel short-term streamflow forecasting method for multi-block watersheds was proposed by integrating machine learning and hydrological models. Firstly, based on IMERG precipitation, the forecast precipitation product’s error is corrected by the long short-term memory neural network (LSTM). Secondly, coupling convolutional LSTM (ConvLSTM) and LSTM, operation rules for cascade reservoirs are extracted. Thirdly, a short-term deterministic streamflow forecasting model was built for multi-block watersheds. Finally, according to the sources of forecasting errors, probabilistic streamflow forecasting models based on the Gaussian mixture model (GMM) were proposed, and their performances were compared. Taking the Yalong River as an example, the main results are as follows: (1) Deep learning models (ConvLSTM and LSTM) show good performance in forecast precipitation correction and reservoir operation rule extraction, contributing to streamflow forecasting accuracy. (2) The proposed streamflow deterministic forecasting method has good forecasting performance with NSE above 0.83 for the following 1–5 days. (3) The GMM model, using upstream evolutionary forecasted streamflow, interval forecasted streamflow, and downstream forecasted streamflow as the input–output combination, has good probabilistic forecasting performance and can adequately characterize the “non-normality” and “heteroskedasticity” of forecasting uncertainty. Full article

Background: Siphonaria is a genus of false limpets belonging to the Gastropoda class. Only two species of this genus have been described with mitochondrial genomes. Moreover, the codon usage patterns and factors influencing them have not been studied. This study aims to expand the mitochondrial genome data of this genus and clarify the codon usage patterns. Methods: The complete mitochondrial genome of Siphonaria japonica was sequenced using next-generation sequencing. The gene arrangement and phylogenetic status were compared with Siphonaria gigas and Siphonaria pectinata. The codon usage bias of the three mitochondrial genomes was analyzed based on the relative synonymous codon usage (RSCU), the effective number of codons (ENC) plot, the parity rule 2 (PR2)-bias plot, and neutrality plot analyses. Results: The gene arrangement and maximum-likelihood phylogenetic tree support a close relationship between S. japonica and S. pectinata. The codon usage bias analysis indicated that the codon usage bias of mitochondrial PCGs in the three species was primarily influenced by natural selection. Conclusions: This study offers significant evolutionary insights into the phylogenetic relationships and molecular adaptation strategies among Siphonaria species. Full article

This paper is a critical, historical review of the literature on intelligence and moral development. In this review we come to a number of conclusions. For example, we identify methodological issues in past research on intelligence in relation to moral development, from Wiggam’s paper in 1941 through the first quarter of the 21st century, and we commend research done with methodological improvements we specify. Also, we conclude that Heyes’ evolutionary psychology that humans have a specifiable “starter kit” of processes that produce “cognitive gadgets,” including those used in normative thinking, should be given further attention. But, importantly, we note that these “gadgets” may be “malware” or be missing. Another conclusion is that Gert’s account of harms and benefits, of the moral rules, of how the rules are justified, and of how violations are justified, can be a fruitful component of the study of moral development. Furthermore, we argue that the work on wisdom by Sternberg, Kristjansson, and others is important to grasp for its relevance to putting morality into action. Lastly, we discuss areas for future research, especially in neuroscience, and we recommend paying attention to practices for the building of practical wisdom and morality. Full article

This study employs text mining techniques to conduct a systematic quantitative analysis of cybersecurity-related scientific publications and technological research. It aims to break through the limitations of traditional unidirectional evolutionary research, reveal the knowledge evolution rules between scientific theories and technical practices in this field, and provide valuable references and decision-making support for optimizing the collaborative innovation ecosystem. Firstly, we took academic papers and patent research on cybersecurity from 2005 to 2024 as the research objects and divided them into ten stages according to the time series. Subsequently, we identified scientific and technological topics and formed science–technology topics to assess their similarity. Then, we selected 3040 pairs of collaborative topic pairs and categorized them into three distinct groups: weak, moderate, and strong correlation. Finally, we constructed a science–technology topic association evolution atlas and analyzed the types of evolutionary pathways of topic associations and their mechanisms of action accordingly. The results demonstrate five evolutionary patterns in science–technology topic associations: division, merging, inheritance, co-occurrence, and independent development. Additionally, the science–technology topics demonstrate a high degree of collaboration, exhibiting a collaborative effect of “initial accumulation–fluctuating differentiation–deep collaboration”. Meanwhile, the correlation evolution of strongly related science–technology topics presents a symmetrical effect of “technology–science–technology” and “science–technology/technology–science”. Full article

Background: Preeclampsia remains a leading cause of maternal morbidity worldwide. There is a critical need for predictive systems that not only perform accurately but also provide interpretable insights for clinical decision-making. This work introduces SK-MOEFS, an explainable framework based on fuzzy logic and multi-objective evolutionary optimization, designed to classify preeclampsia risk while generating clinically interpretable rules. Methods: The model integrates fuzzy decision trees with a genetic algorithm to identify a compact and relevant set of rules, optimized for both accuracy and interpretability. The system was trained and evaluated on third-trimester pregnancy data from a publicly available, multi-ethnic cohort comprising 574 individuals. All processes, including preprocessing, training, and evaluation, were conducted using open-source tools, ensuring reproducibility. Results: SK-MOEFS achieved 91% classification accuracy, an AUC of 0.89, and a recall of 0.88—outperforming other standard interpretable models while maintaining high transparency. The model emphasizes minimizing false negatives, which is critical in clinical risk stratification for preeclampsia. Conclusions: Beyond predictive performance, SK-MOEFS offers a rule translation and defuzzification layer that outputs probabilistic interpretations in natural language, enhancing its suitability for clinical use. This framework provides an effective bridge between algorithmic inference and human clinical judgment, supporting transparent and reliable decision-making in maternal care. Full article

Model checking has become a widely used and precise technique for verifying software systems. However, a major challenge in model checking is state space explosion, which occurs due to the exponential memory usage required by the model checker. To address this issue, meta-heuristic and evolutionary algorithms offer a promising solution by searching for a state where a property is either satisfied or violated. Recently, various evolutionary algorithms, such as Genetic Algorithms and Particle Swarm Optimization, have been applied to detect deadlock states. While these approaches have been useful, they primarily focus on deadlock detection. This paper proposes a fuzzy algorithm to analyse reachability properties in systems specified through Graph Transformation Systems with large state spaces. To achieve this, the existing Particle Swarm Optimisation algorithm, which is typically used for deadlock detection, has been extended to analyse reachability properties. To further enhance accuracy, a Fuzzy Adaptive Particle Swarm Optimization algorithm is introduced to determine which states and paths should be explored at each step-in order to find the corresponding reachable state. Additionally, the proposed hybrid algorithm was applied to models generated through rule composition to assess the impact of rule composition on execution time and the number of explored states. These approaches were implemented within an open-source toolset called GROOVE, which is used for designing and model checking Graph Transformation Systems. Experimental results demonstrate that proposed hybrid algorithm reduced verification time by up to 49.86% compared to Particle Swarm Optimization and 65.17% compared to Genetic Algorithms in reachability analysis of complex models. Furthermore, it explored 32.7% fewer states on average than the hybrid method based on Particle Swarm Optimization and Gravitational Search Algorithms, and 57.4% fewer states compared to Genetic Algorithms, indicating improved search efficiency. The application of rule composition further reduced execution time by 35.7% and the number of explored states by 41.2% in large-scale models. These results confirm that proposed hybrid algorithm significantly enhances reachability analysis in the systems modelled via Graph Transformation, improving both computational efficiency and scalability. Full article

Traditional off-the-job training is becoming ineffective in high-end equipment research and development (R&D) projects due to the contradiction between rapid technological progress and the slow growth of newcomers, calling for “on-the-job mentoring” to enable synchronized advancement of project execution and newcomer cultivation. For this, we propose the multi-skilled project scheduling problem with newcomer cultivation under uncertain durations (MSPSP-NCU) and abstract it as a stochastic programming model. The model aims to minimize expected makespan and maximize newcomers’ skill efficiency by optimizing workforce assignment that enables experienced workers to mentor newcomers while simultaneously optimizing task scheduling. Solving the model is blocked by the inherently NP-hard nature of the project scheduling problem and the stochasticity of the durations. Therefore, we put forward an adaptive simulation–optimization approach featuring two-fold: a simulation module capable of dynamically adjusting sample sizes based on convergence feedback and evaluating solutions with improved efficiency and stable accuracy; a tailored non-dominated sorting genetic algorithm II (NSGA-II) with adaptive evolutionary operators that enhance search effectiveness and ensure the identification of a well-distributed Pareto front. By using data from an aerospace component R&D project, the proposed approach is validated for its performance in identifying Pareto-optimal solutions. Several personalized rules are designed by integrating workforce development strategies into the selection process, providing actionable guidelines for cultivating newcomers in technology-intensive projects. Full article

Hyper-parameters play a critical role in neural networks; they significantly impact both training effectiveness and overall model performance. Proper hyper-parameter settings can accelerate model convergence and improve generalization. Among various hyper-parameters, the learning rate is particularly important. However, optimizing the learning rate typically requires extensive experimentation and tuning, as its setting is often dependent on specific tasks and datasets and therefore lacks universal rules or standards. Consequently, adjustments are generally made through trial and error, thereby making the selection of the learning rate complex and time-consuming. In an attempt to surmount this challenge, evolutionary computation algorithms can automatically adjust the hyper-parameter learning rate to improve training efficiency and model performance. In response to this, we propose a black widow optimization algorithm based on Lagrange interpolation (LIBWONN) to optimize the learning rate of ResNet18. Moreover, we evaluate LIBWONN’s effectiveness using 24 benchmark functions from CEC2017 and CEC2022 and compare it with nine advanced metaheuristic algorithms. The experimental results indicate that LIBWONN outperforms the other algorithms in convergence and stability. Additionally, experiments on publicly available datasets from six different fields demonstrate that LIBWONN improves the accuracy on both training and testing sets compared to the standard BWO, with gains of 6.99% and 4.48%, respectively. Full article

Path-planning algorithms for planetary rovers are critical for autonomous robotic exploration, enabling the efficient and safe traversal of complex and dynamic extraterrestrial terrains. Unlike terrestrial mobile robots, planetary rovers must navigate highly unpredictable environments influenced by diverse factors such as terrain variability, obstacles, illumination conditions, and temperature fluctuations, necessitating advanced path-planning strategies to ensure mission success. This review comprehensively synthesizes recent advancements in planetary rover path-planning algorithms. First, we categorize these algorithms from a constraint-oriented perspective, distinguishing between internal rover state constraints and external environmental constraints. Next, we examine rule-based path-planning approaches, including graph search-based methods, potential field methods, sampling-based techniques, and dynamic window approaches, analyzing representative algorithms in each category. Subsequently, we explore bio-inspired path-planning methods, such as evolutionary algorithms, fuzzy computing, and machine learning-based approaches, with a particular emphasis on the latest developments and prospects of machine learning techniques in planetary rover navigation. Finally, we synthesize key insights from existing algorithms and discuss future research directions, highlighting their potential applications in planetary exploration missions. Full article

This paper presents an innovative optimization algorithm based on differential evolution that combines advanced mutation techniques with intelligent termination mechanisms. The proposed algorithm is designed to address the main limitations of classical differential evolution, offering improved performance for symmetric or non-symmetric optimization problems. The core scientific contribution of this research focuses on three key aspects. First, we develop a hybrid dual-strategy mutation system where the first strategy emphasizes exploration of the solution space through monitoring of the optimal solution, while the second strategy focuses on exploitation of promising regions using dynamically weighted differential terms. This dual mechanism ensures a balanced approach between discovering new solutions and improving existing ones. Second, the algorithm incorporates a novel majority dimension mechanism that evaluates candidate solutions through dimension-wise comparison with elite references (best sample and worst sample). This mechanism dynamically guides the search process by determining whether to intensify local exploitation or initiate global exploration based on majority voting across all the dimensions. Third, the work presents numerous new termination rules based on the quantitative evaluation of metric value homogeneity. These rules extend beyond traditional convergence checks by incorporating multidimensional criteria that consider both the solution distribution and evolutionary dynamics. This system enables more sophisticated and adaptive decision-making regarding the optimal stopping point of the optimization process. The methodology is validated through extensive experimental procedures covering a wide range of optimization problems. The results demonstrate significant improvements in both solution quality and computational efficiency, particularly for high-dimensional problems with numerous local optima. The research findings highlight the proposed algorithm’s potential as a high-performance tool for solving complex optimization challenges in contemporary scientific and technological contexts. Full article

Predicting the energy consumption of buildings plays a critical role in supporting utility providers, users, and facility managers in minimizing energy waste and optimizing operational efficiency. However, this prediction becomes difficult because of the limited availability of supervised labeled data to train Artificial Intelligence (AI) models. This data availability becomes either expensive or difficult due to privacy protection. To overcome the scarcity of balanced labeled data, semi-supervised learning utilizes extensive unlabeled data. Motivated by this, we propose semi-supervised learning to train AI model. For the AI model, we employ the Belief Rule-Based Expert System (BRBES) because of its domain knowledge-based prediction and uncertainty handling mechanism. For improved accuracy of the BRBES, we utilize initial labeled data to optimize BRBES’ parameters and structure through evolutionary learning until its accuracy reaches the confidence threshold. As semi-supervised learning, we employ a self-training model to assign pseudo-labels, predicted by the BRBES, to unlabeled data generated through weak and strong augmentation. We reoptimize the BRBES with labeled and pseudo-labeled data, resulting in a semi-supervised BRBES. Finally, this semi-supervised BRBES explains its prediction to the end-user in nontechnical human language, resulting in a trust relationship. To validate our proposed semi-supervised explainable BRBES framework, a case study based on Skellefteå, Sweden, is used to predict and explain energy consumption of buildings. Experimental results show 20 ± 0.71% higher accuracy of the semi-supervised BRBES than state-of-the-art semi-supervised machine learning models. Moreover, the semi-supervised BRBES framework turns out to be 29 ± 0.67% more explainable than these semi-supervised machine learning models. Full article

In real-life mixed-model assembly lines, multiple problems collectively affect the final production’s performance. In this study, mixed-model assembly lines integrated with balancing and sequencing problems are considered simultaneously solved. A comprehensive mathematical model is formulated to evaluate the current multi-objective problem. An intelligent hybrid genetic algorithm (IHGA) is proposed to solve the integrated mixed-model assembly line balancing and sequencing problem. The performance of the proposed algorithm is triggered by integrating heuristic rules through a generation gap mechanism which helps in reducing search space without succumbing to local optima. Additionally, parametric tuning of the algorithm is performed using Q-learning, enabling adaptive optimization through reinforcement learning. This helps to enhance computational efficiency and achieve robust performance of the proposed algorithm. The performance of the IHGA algorithm is rigorously compared with existing approaches, including a non-dominated sorting genetic algorithm, multi-objective artificial bee colony, multi-objective particle swarm optimization, multi-objective evolutionary algorithm based on Decomposition, and multi-objective grey wolf optimizer. Results demonstrate the superior performance of the proposed algorithm across various metrics, showcasing its efficacy in optimizing mixed-model assembly lines, where symmetry in task allocation and sequencing can significantly enhance operational efficiency in contemporary industrial settings. Additionally, a real-life case study is solved to validate the empirical applicability of the proposed IHGA. The extensive experimental analysis notably shows that the proposed IHGA outperforms the existing methods. Full article