Search

This article discusses a new paper published in Development that explores the mechanisms behind the growth and shrinkage dynamics of planarians, a type of flatworm. The authors, Jason Ko and Daniel Lobo, investigate how planarians maintain appropriate body proportions as their size changes. They develop a mathematical model to understand the differences between growth and shrinkage and the underlying mechanisms. The study combines experimental data, image analysis, and computational methods to gain insights into the interactions between genetic signals and tissue growth in planarians. The research aims to pave the way for identifying the exact genes and signals that control shape regulation in planarians. [Extracted from the article]

In this paper, an ultra-thin absorber with a total thickness of 9.2 mm is designed and verified at the frequency band of 1–5.34 GHz. The absorber is composed of a layer of metasurface, multi-layered magnetic substrate, a layer of fragmented magnetic structure obtained by improved MOEA/D-GO (Multi-Objective Evolutionary Algorithm based on Decomposition combined with Enhanced Genetic Operators), and a copper back plate. The absorber is achieved by two steps. First, we designed and measured an ultra-thin absorber at 0.78–2.04 GHz by adding a layer metasurface onto the top of a basic multi-layer absorber composed of magnetic materials. The fractional bandwidth (FBW) of the absorber is 89.4%, and the electrical thickness is only 0.024 λ 0 at the lowest operating frequency. Second, to broaden the bandwidth, we use an improved MOEA/D-GO to optimize one magnetic layer of the absorber. The working frequency band of the optimized absorber is 1–5.34 GHz, covering L- (1–2 GHz), S- (2–4 GHz), and partial C-bands (4–8 GHz). Furthermore, we modified the structure of the metasurface to make the absorber polarization-independent. The FBW of the final absorber is 136.4%, and the electrical thickness is 0.031 λ 0 at the lowest operating frequency. The prototype of the absorber is measured, and the experimental results agree well with the simulated performance. The results show that the improved MOEA/D-GO can be used to design and optimize sophisticated electromagnetic (EM) structures with the predesigned properties, and the absorber with ultrathin thickness and light weight verified in this paper have great application potentials in EM compatibility, EM shielding, and radar cross section reduction at the low bands of the microwave spectrum. [ABSTRACT FROM AUTHOR]

In a seminal paper in 2013, Witt showed that the (1+1) Evolutionary Algorithm with standard bit mutation needs time (1 + o (1)) n ln n / p 1 to find the optimum of any linear function, as long as the probability p 1 to flip exactly one bit is Θ (1) . In this paper we investigate how this result generalizes if standard bit mutation is replaced by an arbitrary unbiased mutation operator. This situation is notably different, since the stochastic domination argument used for the lower bound by Witt no longer holds. In particular, starting closer to the optimum is not necessarily an advantage, and OneMax is no longer the easiest function for arbitrary starting positions. Nevertheless, we show that Witt's result carries over if p 1 is not too small, with different constraints for upper and lower bounds, and if the number of flipped bits has bounded expectation χ . Notably, this includes some of the heavy-tail mutation operators used in fast genetic algorithms, but not all of them. We also give examples showing that algorithms with unbounded χ have qualitatively different trajectories close to the optimum. [ABSTRACT FROM AUTHOR]

This paper presents a new version of Multi Agent Collaborative Search (MACS) with Adaptive Weights (named MACS‐AW). MACS is a multi‐agent memetic scheme for multi‐objective optimization originally developed to mix local and population‐based search. MACS was proven to perform well on a number of test cases but had three limitations: (i) the amount of computational resources allocated to each agent was not proportional to the difficulty of the sub‐problem the agent had to solve; (ii) the population‐based search (called social actions in the following) was using only one differential evolution (DE) operator with fixed parameters; (iii) the descent directions were not adapted during convergence, leading to a loss of diversity. In this paper, we propose an improved version of MACS, that implements: (i) a new utility function to better manage computational resources; (ii) new social actions with multiple adaptive DE operators; (iii) an automatic adaptation of the descent directions with an innovative trigger to initiate adaptation. First, MACS‐AW is compared against some state‐of‐art algorithms and its predecessor MACS2.1 on some standard benchmarks. Then, MACS‐AW is applied to the solution of two real‐life optimization problems and compared against MACS2.1. It will be shown that MACS‐AW produces competitive results on most test cases analysed in this paper. On the standard benchmark test set, MACS‐AW outperforms all other algorithms in 11 out of 30 cases and comes second in other 8 cases. On the two real engineering test set, MACS‐AW and its predecessor obtain same results. [ABSTRACT FROM AUTHOR]

The intrusion detection system is responsible for revealing different intrusion activities, including the denial of service, man-in-middle, Mirai, Scan, and other types of intrusion activities. It is used in many applications, including the smart home Internet of Things networks, where security risks threaten the privacy of individuals. In this context, many works were proposed for detecting and classifying the different types of attacks. However, many challenges are identified for this type of problem, such as the large amount of data available, the imbalanced nature of the data, and the quality of detection and classification outcomes. This paper aims to address these challenges by proposing an approach that considers a metaheuristic-based random weight neural network to detect intrusion activities and classify the different types and subtypes of activities. The following points summarize the contribution of this paper. First, the automatic tuning of the neural network parameters where the weights, biases, regularization value, the number of neurons, and the type of activation function are optimized by different metaheuristic algorithms to produce high-quality results. Second, the proposed approach adopts a clustering with reduction technique to tackle the challenge of processing large volumes of data. Third, oversampling the dataset is also embedded in the proposed approach to avoid a biased classification of the majority class. The experiments are conducted based on a large dataset with more than half a million instances. The results show that the proposed approach outperforms the other classification approaches in geometric mean (G-Mean) and has promising results. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of accurate and interpretable prediction of energy consumption in residential buildings. The solution that we propose in this work employs the knowledge discovery machine learning approach combining fuzzy systems with evolutionary optimization. The contribution of this work is twofold, including both methodology and experimental investigations. As far as methodological contribution is concerned, in this paper, we present an original designing procedure of fuzzy rule-based prediction systems (FRBPSs) for accurate and transparent energy consumption prediction in residential buildings. The proposed FRBPSs are characterized by a genetically optimized accuracy–interpretability trade-off. The trade-off optimization is carried out by means of multi-objective evolutionary optimization algorithms—in particular, by our generalization of the well-known strength Pareto evolutionary algorithm 2 (SPEA2). The proposed FRBPSs' designing procedure is our original extension and generalization (for regression problems operating on continuous outputs) of an approach to designing fuzzy rule-based classifiers (FRBCs) we developed earlier and published in 2020 in this journal. FRBCs operate on discrete outputs, i.e., class labels. The experimental contribution of this work includes designing the collection of FRBPSs for residential building energy consumption prediction using the data set published in 2024 and available from Kaggle Database Repository. Moreover, the comparison with 20 available alternative approaches is carried out, demonstrating that our approach significantly outperforms alternative methods in terms of interpretability and transparency of the energy consumption predictions made while remaining comparable or slightly superior in terms of the accuracy of those predictions. [ABSTRACT FROM AUTHOR]

The advancement toward sustainable infrastructure presents complex multi-objective optimization (MOO) challenges. This paper expands the current understanding of design frameworks that balance cost, environmental impacts, social factors, and structural integrity. Integrating MOO with multi-criteria decision-making (MCDM), the study targets enhancements in life cycle sustainability for complex engineering projects using precast modular road frames. Three advanced evolutionary algorithms—NSGA-II, NSGA-III, and RVEA—are optimized and deployed to address sustainability objectives under performance constraints. The efficacy of these algorithms is gauged through a comparative analysis, and a robust MCDM approach is applied to nine non-dominated solutions, employing SAW, FUCA, TOPSIS, PROMETHEE, and VIKOR decision-making techniques. An entropy theory-based method ensures systematic, unbiased criteria weighting, augmenting the framework's capacity to pinpoint designs balancing life cycle sustainability. The results reveal that NSGA-III is the algorithm converging towards the most cost-effective solutions, surpassing NSGA-II and RVEA by 21.11% and 10.07%, respectively, while maintaining balanced environmental and social impacts. The RVEA achieves up to 15.94% greater environmental efficiency than its counterparts. The analysis of non-dominated solutions identifies the A 4 design, utilizing 35 MPa concrete and B500S steel, as the most sustainable alternative across 80% of decision-making algorithms. The ranking correlation coefficients above 0.94 demonstrate consistency among decision-making techniques, underscoring the robustness of the integrated MOO and MCDM framework. The results in this paper expand the understanding of the applicability of novel techniques for enhancing engineering practices and advocate for a comprehensive strategy that employs advanced MOO algorithms and MCDM to enhance sustainable infrastructure development. [ABSTRACT FROM AUTHOR]

Reconfigurable hardware, extensively employed in mission-critical digital applications like space and military electronics due to its adaptability, encounters the issue of soft errors, especially in control path elements, which could result in functional failure. Various system-level fault tolerance methodologies exist, and this paper implements a bio-inspired fault tolerance technique called evolvable hardware (EHW). The preferred implementation of the EHW system involves hosting the evolutionary algorithm on the processor alongside the reconfigurable hardware. However, this approach encounters delays in the intercommunication of the evolved circuit between the reconfigurable hardware and the processor. To address this issue, the paper proposes a two-tier architecture to achieve absolute fault mitigation in the controller. In this architecture, Tier-1 involves the digital implementation of the genetic algorithm on the reconfigurable hardware to mitigate errors in the controller, while Tier-2 focuses on mitigating errors occurring in Tier-1. The aim is to establish an absolute and self-resilient controller hardware to mitigate faults. The study simulates faults at the target circuit and genetic module as a proof of concept. The proposed two-tier single event upset (SEU) mitigation is deployed on Microsemi's ProAsic3e FPGA (Field Programmable Gate Array), achieving an average efficiency of 91%. This efficiency is accompanied by ten times lesser resource utilization compared to traditional methodologies and a 30% accelerated speed when compared to hybrid evolvable systems. [ABSTRACT FROM AUTHOR]

BACKGROUND: The scientific revolution in the treatment of many illnesses has been significantly aided by stem cells. This paper presents an optimal control on a mathematical model of chemotherapy and stem cell therapy for cancer treatment. OBJECTIVE: To develop effective hybrid techniques that combine the optimal control theory (OCT) with the evolutionary algorithm and multi-objective swarm algorithm. The developed technique is aimed to reduce the number of cancerous cells while utilizing the minimum necessary chemotherapy medications and minimizing toxicity to protect patients' health. METHODS: Two hybrid techniques are proposed in this paper. Both techniques combined OCT with the evolutionary algorithm and multi-objective swarm algorithm which included MOEA/D, MOPSO, SPEA II and PESA II. This study evaluates the performance of two hybrid techniques in terms of reducing cancer cells and drug concentrations, as well as computational time consumption. RESULTS: In both techniques, MOEA/D emerges as the most effective algorithm due to its superior capability in minimizing tumour size and cancer drug concentration. CONCLUSION: This study highlights the importance of integrating OCT and evolutionary algorithms as a robust approach for optimizing cancer chemotherapy treatment. [ABSTRACT FROM AUTHOR]

When constructing an investment portfolio, it is important to maximize returns while minimizing risks. This portfolio optimization can be considered as a multi-objective optimization problem that is solved by means of multi-objective evolutionary algorithms. The use of multi-objective evolutionary algorithms (MOEAs) provides an effective approach for dealing with the complex data involved in multi-objective optimization problems. However, current MOEAs often rely on a single strategy to obtain optimal solutions, leading to premature convergence and an insufficient population diversity. In this paper, a new MOEA called the Synergistic MOEA with Diffusion Population Generation (DPG-SMOEA) is proposed to address these limitations by integrating MOEAs with diffusion models. To train the diffusion model, a mixed memory pool strategy is optimized, which collects improved solutions from the MOEA/D-AEE, an optimized MOEA, as training samples. The trained model is then used to generate offspring. Considering the cold-start mechanism of the diffusion model, particularly during the training phase where it is not suitable for generating initial offspring, this paper adjusts and optimizes the collaborative strategy to enhance the synergy between the diffusion model and MOEA/D-AEE. Experimental validation of the DPG-SMOEA demonstrates the advantages of using diffusion models in low-dimensional and relatively continuous data analysis. The results show that the DPG-SMOEA performs well on the low-dimensional Hang Seng Index test dataset, while achieving average performance on other high-dimensional datasets, consistent with theoretical predictions. Overall, the DPG-SMOEA achieves better results compared to MOEA/D-AEE and other multi-objective optimization algorithms. [ABSTRACT FROM AUTHOR]

Regarding to the complex chaotic non-linear behaviour in nature and the impossibility of their accurate modelling with current chaotic models, the development of Cascade Hyper-Chaotic System is necessary. Therefore, in this paper, new cascade hyper chaotic systems are proposed. Cascade hyper-chaotic systems have more parameters than the above-mentioned systems, and in most cases, they show more complex behaviour. On the other hand, due to the complexity of these systems and their high parameters, the identification of this kind of systems is difficult. For this reason, a new Adaptive Chaotic Grey Wolf Optimisation algorithm is presented in this article in order to estimate the parameters of these systems. Numerical simulations have been performed on the above-mentioned systems of Lu-Chen, Chen-Lorenz and Lu-Lorenz cascading. The results show that the systems have more complex behaviour than the seed systems and the proposed grey wolf algorithm is also an effective tool for estimating the parameter of the above-mentioned cascade Hyper-Chaotic System. [ABSTRACT FROM AUTHOR]

This paper introduces a comprehensive three-step framework for fault classification in underground cable systems. The first step involves the implementation of the Cumulative Sum (CUSUM) technique to detect the fault instances, which will help in precisely tracking the affected portions. The second step focuses on parameter estimation techniques, followed by the third step, which incorporates classification techniques. The study employs a range of evolutionary optimization algorithms, including Ant Colony Optimization, Bacteria Foraging Optimization, Simulated Annealing, Genetic Algorithm, and Particle Swarm Optimization. These algorithms are effectively employed to track and estimate parameters like amplitude, phase, frequency, and damping factor associated with various types of permanent faults, such as L-G fault, L-L fault, L-L-G fault, and L-L-L-G fault generated in the underground cable. The optimized parameters extracted through these algorithms are utilized as features within a Support Vector Classifier for fault classification. The overall accuracy of the classifier using these features is reported to be 0.944, which is quite high and indicates a strong performance in classifying faults. The study includes a brief comparison of the performance of these bio-inspired algorithms. The effectiveness of the tracking algorithms is validated through the use of laboratory-tested current signals. In addition, the signals are subjected to varying signal-to-noise ratios to evaluate the robustness of the tracking algorithm. A comparative analysis is performed to estimate the accurate parameters and highlights the significant tracking ability of the Particle Swarm Optimization (PSO) algorithm, which outperforms other algorithms.The Root Mean Squared Percentage Error (RMSPE) for the L-G fault in PSO is 0.3082, showing superior performance compared to other algorithms. [ABSTRACT FROM AUTHOR]

Tactile paving is a ground‐texture display device installed on sidewalks to guide visually impaired people. In recent years, many studies have been conducted on tactile paving detection using cameras to help visually impaired people walk independently. In addition, several computer vision‐based tactile paving detection methods have been proposed. However, it is difficult to compare the detection accuracy of different proposed algorithms because there are no publicly available tactile paving datasets, and the ground truth and evaluation criteria used for evaluation are often inconsistent or not clearly presented. To this end, in this paper, we collect a tactile paving dataset and name it 'Tenji10K'. The dataset is constructed with 20 sequences consisting of 10 K first‐person tactile paving images taken in Japan, and 'Tenji block' refers to Japanese‐style tactile paving. For detailed evaluation analysis, up to six sequence attributes are assigned, taking into account various real‐world situations. On the other hand, we also proposed a tactile paving tracking algorithm based on an evolutionary algorithm. The effectiveness of the dataset is evaluated by conducting a comparative experiment based on Tenji10K with respect to four different methods, including our proposed method. © 2024 Institute of Electrical Engineers of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Wireless sensor network is large-scale, self-organizing and reliable. It is widely used in the military, disaster management, environmental monitoring, and other fields. Algorithms for localization can be classified as range-based or range-free based on their ability to achieve effective localization. Range-based algorithms require hardware support, which increases deployment costs and complexity. Instead of measuring distance directly, range-free algorithms estimate the position based on hop counts between nodes. While simpler in terms of hardware requirements, this algorithm suffers from large localization errors. To address this problem, this paper proposes an improved 3D DV-Hop localization algorithm (3D DEHDV-Hop) using a differential evolutionary algorithm. First of all, theoretical analysis shows a correlation between the volume of the intersection area containing the communication range between neighbors and the number of shared single-hop nodes. Then, using the number of shared single-hop nodes between nodes, the number of hops is converted from a discrete value to an exact continuous value. Finally, the localization problem is transformed into a minimum optimization problem by incorporating a differential evolutionary algorithm. As compared to the other four algorithms compared, 3D DEHDV-Hop improves localization accuracy by an average of 10.3% under different anchor node densities, 13.7% under different communication radiuses, and 12.1% under different anchor node numbers. [ABSTRACT FROM AUTHOR]

Based on the principles of biomimicry, evolutionary algorithms (EAs) have been widely applied across diverse domains to tackle practical challenges. However, the inherent limitations of these algorithms call for further refinement to strike a delicate balance between global exploration and local exploitation. Thus, this paper introduces a novel multi-strategy enhanced hybrid algorithm called MHWACO, which integrates a Whale Optimization Algorithm (WOA) and Ant Colony Optimization (ACO). Initially, MHWACO employs Gaussian perturbation optimization for individual initialization. Subsequently, individuals selectively undertake either localized exploration based on the refined WOA or global prospecting anchored in the Golden Sine Algorithm (Golden-SA), determined by transition probabilities. Inspired by the collaborative behavior of ant colonies, a Flight Ant (FA) strategy is proposed to guide unoptimized individuals toward potential global optimal solutions. Finally, the Gaussian scatter search (GSS) strategy is activated during low population activity, striking a balance between global exploration and local exploitation capabilities. Moreover, the efficacy of Support Vector Regression (SVR) and random forest (RF) as regression models heavily depends on parameter selection. In response, we have devised the MHWACO-SVM and MHWACO-RF models to refine the selection of parameters, applying them to various real-world problems such as stock prediction, housing estimation, disease forecasting, fire prediction, and air quality monitoring. Experimental comparisons against 9 newly proposed intelligent optimization algorithms and 9 enhanced algorithms across 34 benchmark test functions and the CEC2022 benchmark suite, highlight the notable superiority and efficacy of MSWOA in addressing global optimization problems. Finally, the proposed MHWACO-SVM and MHWACO-RF models outperform other regression models across key metrics such as the Mean Bias Error (MBE), Coefficient of Determination ( R 2 ), Mean Absolute Error (MAE), Explained Variance Score (EVS), and Median Absolute Error (MEAE). [ABSTRACT FROM AUTHOR]

In the past few decades, many multi-objective evolution algorithms (MOEAs) have been proposed, often emphasizing a single crossover operator, which has a significant impact on the algorithm's performance. This paper proposed a novel MOEA, based on the MOEA/D framework and employing Q-learning for adaptive operator selection (QLMOEA/D-AOS). In every Iteration, Q-learning is used to dynamically choose an operator among five crossover operators. To obtain a better distribution of solutions in multi-objective optimization problems with irregular PFs, a new approach for weight vector initializing is proposed. Additionally, to enhance population diversity, a reward calculation method based on two metrics, Spacing and PD, is proposed. Finally, the proposed algorithm is validated for different numbers of objectives, ranging from two to five for multi/many-objective optimization problems. The experimental results demonstrate the significant advantages of the proposed algorithm compared to state-of-the-art MOEAs across multiple test cases. [ABSTRACT FROM AUTHOR]

The dung beetle optimization (DBO) algorithm is acknowledged for its robust optimization capabilities and rapid convergence as an efficient swarm intelligence optimization technique. Nevertheless, DBO, similar to other swarm intelligence algorithms, often gets trapped in local optima during the later stages of optimization. To mitigate this challenge, we propose the Move-to-Escape dung beetle optimization (MEDBO) algorithm in this paper. MEDBO utilizes a good point set strategy for initializing the swarm's initial population, ensuring a more uniform distribution and diminishing the risk of local optima entrapment. Moreover, it incorporates convergence factors and dynamically balances the number of offspring and foraging individuals, prioritizing global exploration initially and local exploration subsequently. This dynamic adjustment not only enhances the search speed but also prevents local optima stagnation. The algorithm's performance was assessed using the CEC2017 benchmark suite, which confirmed MEDBO's significant improvements. Additionally, we applied MEDBO to three engineering problems: pressure vessel design, three-bar truss design, and spring design. MEDBO exhibited an excellent performance in these applications, demonstrating its practicality and efficacy in real-world problem-solving contexts. [ABSTRACT FROM AUTHOR]

Genetic programming (GP) has a long-standing tradition in the evolution of computer programs, predominantly utilizing tree and linear paradigms, each with distinct advantages and limitations. Despite the rapid growth of the GP field, there have been disproportionately few attempts to evolve 'real' Turing-like imperative programs (as contrasted with functional programming) from the ground up. Existing research focuses mainly on specific special cases where the structure of the solution is partly known. This paper explores the potential of integrating tree and linear GP paradigms to develop an encoding scheme that universally supports genetic operators without constraints and consistently generates syntactically correct Python programs from scratch. By blending the symmetrical structure of tree-based representations with the inherent asymmetry of linear sequences, we created a versatile environment for program evolution. Our approach was rigorously tested on 35 problems characterized by varying Halstead complexity metrics, to delineate the approach's boundaries. While expected brute-force program solutions were observed, our method yielded more sophisticated strategies, such as optimizing a program by restricting the division trials to the values up to the square root of the number when counting its proper divisors. Despite the recent groundbreaking advancements in large language models, we assert that the GP field warrants continued research. GP embodies a fundamentally different computational paradigm, crucial for advancing our understanding of natural evolutionary processes. [ABSTRACT FROM AUTHOR]

Learners' emotional states might change during the learning process, and unpredictable variations of a person's emotions raise the demand for regular assessment of feelings during learning. In this paper, an AI-based decision framework is proposed and implemented for e-learning systems that identify suitable micro-brake activities based on the learner's emotional state through an evolutionary genetic algorithm to change learner's mood and increase learning performance. This proposed framework was tested using a case study of English as a second language learner during one semester. The students were divided into two groups of participants (each group containing twenty students, forming a total of 40 students). The results of this study demonstrated the importance of learners' emotions in their learning performance and proved the effectiveness of our proposed framework and the success of the recommended micro-break activities chosen based on learners' emotions and preferences. The findings of this study have important practical implications in designing adaptive e-learning systems and learning management systems such as Moodle. They also contribute to theoretical implications in the field of AI and learner emotions by suggesting a novel approach to identifying, categorizing, and offering a learning path that can cater to the needs of individual learners. [ABSTRACT FROM AUTHOR]

To address the issue of high communication cost under the federated learning framework in multi-tenant data centers, this paper proposed an optimization algorithm based on ternary evolutionary model parameters. Firstly, it constructed a federated learning architecture tailored to multi-tenant data centers for data privacy protection. Secondly, in response to the excessive communication overhead stemming from the implementation of the federated learning framework, which increasing interactions between tenants and the data center, it proposed an optimization algorithm that utilized ternary evolutionary model parameters. This algorithm aimed to reduce redundant communication in the exchange of model parameters between tenants and the data center by integrating the optimal local model with the evolutionary direction of ternary vectorized model parameters. Moreover, by analyzing privacy research based on federated learning, the algorithm effectively ensured the privacy of tenants participating in the training during the communication process. Finally, experimental results demonstrate that, while maintaining training accuracy, the proposed method can effectively reduce redundant communication costs by 30% compared to the federated averaging baseline algorithm. [ABSTRACT FROM AUTHOR]

The weighted set covering problem (WSCP) is a famous NP-hard problem. In order to solve the WSCP efficiently by using artificial bee colony algorithm(ABC), this paper proposed a novel binary ABC(nBABC). In nBABC, it proposed a global evolution operator which combined random learning and inheritance to improve the global exploration ability of the algorithm. Secondly, based on the dynamic adjustment strategy, it proposed an adaptive random inversion operator to maintain the balance between exploration and development. Based on the idea of approximate algorithm, it proposed the repair algorithm WSCP-GRA and optimization algorithm WSCP-GOA for dealing with the infeasible solution of WSCP, on the basis of which a new method for solving WSCP was given by using nBABC. In order to verify the efficiency of nBABC in solving WSCP, using it to solve 45 WSCP instances in OR-Library. The comparison with several algorithms shows that nBABC can obtain the optimal values of all instances, which is more competitive than the existing algorithms for solving WSCP. [ABSTRACT FROM AUTHOR]

Accurate diagnosis and effective treatment of thyroid conditions, such as hypothyroidism and hyperthyroidism, are crucial due to their wide-ranging symptoms and consequences. However, conventional back-propagation neural networks have limitations, including slow convergence and susceptibility to local minima. To deal with these problems, the paper suggests an integrated strategy that includes back-propagation (BP) and genetic algorithms (GA). The suggested method uses evolutionary algorithms to investigate various weight combinations and back-propagation to modify weights in response to the discrepancy between expected and actual results. The study evaluated the method using three steps of experimentation, including network building, local search and optimization, and evaluation, on a real-world dataset of thyroid illnesses. The obtained results are very satisfying and promising, indicating that the MLP-GA/BP model is robust enough to detect and categorize thyroid disorders effectively and efficiently. This makes it a reliable diagnostic tool for medical practitioners, allowing them to effectively diagnose and treat patients with thyroid diseases. [ABSTRACT FROM AUTHOR]

This paper presents a novel two-stage progressive search approach with unsupervised feature learning and Q-learning (TSLL) to enhance surrogate-assisted evolutionary optimization for medium-scale expensive problems. The method attempts to address the challenges posed by multi-polar and multi-variable coupling properties in such problems. During the iteration, TSLL splits the optimization process into two distinct stages. First, two unsupervised feature learning techniques: principal component analysis (PCA) and Autoencoder, are utilized to improve the representation of potential optimal samples in the solution space. PCA is used for feature reduction, extracting the most important features. On the other hand, Autoencoder focuses on reconstructing features within the medium-scale solution space. To ensure comprehensive exploration of the entire solution space, TSLL employs two distinct surrogate modeling approaches along with Q-learning in the second stage to dynamically select the mutation strategy for the differential evolution operator. Numerous experiments demonstrate the superiority of TSLL over five state-of-the-art surrogate-assisted approaches and two sophisticated evolutionary algorithms including the winner of CEC 2017 on medium-scale benchmark problems and a wind farm layout problem. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) struggle with energy efficiency because of limited node power. This paper presents an approach that uses evolutionary algorithms to choose the Cluster Head (CH) and optimize routing in wireless sensor networks (WSNs) using grid-based topologies. The proposed method repeatedly develops solutions based on criteria for node density, distance, and energy level by using the evolutionary capabilities of the genetic algorithm. A fitness function that considers latency, coverage, and energy efficiency is used to evaluate the solutions. The process selects CHs dynamically and uses GA-guided optimization to construct paths. Simulation results indicate improved network performance and energy efficiency over existing protocols. Evolutionary algorithm integration enables flexibility and optimization for energy-efficient CH selection and routing in WSNs with a grid-based design. [ABSTRACT FROM AUTHOR]

This paper emphasizes the integration of wind and photovoltaic (PV) generation with battery energy storage systems (BESS) in distribution networks (DNs) to enhance grid sustainability, reliability, and flexibility. A novel multi‐objective optimization framework is introduced in this study to minimize energy supply costs, emissions, and energy losses while improving voltage deviation (VD) and voltage stability index (VSI). The proposed framework comprising normal boundary intersection (NBI) and decomposition‐based evolutionary algorithms (DBEA) determines the optimal siting and sizing of renewable‐based distributed resources, considering load demand variations and the intermittency of wind and solar outputs. The comparative analysis establishes that the proposed strategy performs better than many contemporary algorithms, specifically when all the objective functions are optimized simultaneously. The validation of the proposed framework was carried out on the standard IEEE‐33 bus test network, which demonstrates significant percentage savings in energy supply costs (49.6%), emission rate (62.2%), and energy loss (92.3%), along with enormous improvements in VSI (91.9%) and VD (99.8953%). The obtained results categorically underline the efficiency, reliability, and robustness of the proposed approach when employed on any complex distribution network comprising multiple renewable energy sources and battery storage systems. [ABSTRACT FROM AUTHOR]

When aimed at minimizing both the classification error and the number of selected features, feature selection can be treated as a bi-objective optimization problem suitable for solving with multi-objective evolutionary algorithms (MOEAs). However, traditional MOEAs may encounter difficulties due to discrete optimization environments and the curse of dimensionality in the feature space, especially for high-dimensional datasets. Therefore, in this paper an interpolation-based evolutionary algorithm (termed IPEA) is proposed for tackling bi-objective feature selection in classification, where an interpolation based initialization method is designed for covering a wide range of search space and exploring the adaptively detected regions of interest. In experiments, IPEA is been compared with four state-of-the-art MOEAs in terms of two widely-used performance metrics on a list of 20 public real-world classification datasets with the dimensionality ranging from low to high. The overall empirical results suggest that IPEA generally performs the best of all tested algorithms, with significantly better search abilities and much lower computational time cost. [ABSTRACT FROM AUTHOR]

In this paper, we aim to enhance genetic algorithms (GAs) by integrating a dynamic model based on biological life cycles. This study addresses the challenge of maintaining diversity and adaptability in GAs by incorporating stages of birth, growth, reproduction, and death into the algorithm's framework. We consider an asynchronous execution of life cycle stages to individuals in the population, ensuring a steady-state evolution that preserves high-quality solutions while maintaining diversity. Experimental results demonstrate that the proposed extension outperforms traditional GAs and is as good or better than other well-known and well established algorithms like PSO and EvoSpace in various benchmark problems, particularly regarding convergence speed and solution qu/ality. The study concludes that incorporating biological life-cycle dynamics into GAs enhances their robustness and efficiency, offering a promising direction for future research in evolutionary computation. [ABSTRACT FROM AUTHOR]

Differential evolution algorithm is a very powerful and recently proposed evolutionary algorithm. Generally, only a mutation operator and predefined parameter values of differential evolution algorithm are utilized to solve various optimization problems, which limits the performance of the algorithm. In this paper, six commonly used mutation operators are divided into three categories according to their own features. A mutation pool is established based on the three categories. A parameter pool with three predefined values is designed. During evolution, three mutation operators are randomly chosen from the three categories, and three parameter values are also randomly selected from the parameter pool. The three groups of mutation operators and parameter values are employed to produce trial vectors. The proposed algorithm makes good use of different mutation operators. Three recently proposed differential evolution variants and three non-differential evolution algorithms are used to make comparisons on the 29 testing functions from CEC. The experimental results have demonstrated that the proposed algorithm is very competitive. The proposed algorithm is utilized to solve three real applications, and the results are superior. [ABSTRACT FROM AUTHOR]

Recently, learning classifier systems (LCS) have been used for a variety of Internet of Things (IoT) devices and multi-cloud services, including cloud-based centralized control of physical robots and actuators in continuous-time environments. Performance analysis of sensors, navigation of humanoid robots and intelligent control of rescue systems. In these systems, we can run evolutionary or intuitive algorithms on cloud servers to search the space of rules and simultaneously other learning processes to assign how to interact with the environment to the rules in the classification. Also, the problem of continuous congestion, traffic reduction, network routing and predicting traffic conditions in wireless networks is the main challenge facing these systems in real environments. Usually such systems are non-Markovian. Therefore, they need memory to save system states. This paper presents a framework for XCS-based memory-based LCS. In addition to identifying optimal rules in overlapping modes, the XCS architecture is equipped with a memory. Memory stores the most efficient classifier rules. These rules reduce the steps to reach the goal. In the first proposed method, only those rules that affect the moving motion are kept in memory. As the number of rules increases, some of them are deleted according to memory space. In the second proposed method, some features are added to the rules of this memory and the performance of the memory is optimized using evolutionary algorithms, which are used to remove the less used rules. The relative success of the proposed LCS architecture in solving well-known maze problems compared to the conventional XCS architecture confirms its efficiency in increasing the number of successes and reducing the steps to reach the goals. The results of this research are suggested as a suitable solution for reducing routing time, reducing network load in the problem of congestion and traffic in solving problems related to wireless networks. [ABSTRACT FROM AUTHOR]

In this paper, genomics and precision medicine have witnessed remarkable progress with the advent of high-throughput sequencing technologies and advances in data analytics. However, because of the data’s great dimensionality and complexity, the processing and interpretation of large-scale genomic data present major challenges. In order to overcome these difficulties, this research suggests a novel Intelligent Mutation-Based Evolutionary Optimization Algorithm (IMBOA) created particularly for applications in genomics and precision medicine. In the proposed IMBOA, the mutation operator is guided by genome-based information, allowing for the introduction of variants in candidate solutions that are consistent with known biological processes. The algorithm’s combination of Differential Evolution with this intelligent mutation mechanism enables effective exploration and exploitation of the solution space. Applying a domain-specific fitness function, the system evaluates potential solutions for each generation based on genomic correctness and fitness. The fitness function directs the search toward ideal solutions that achieve the problem’s objectives, while the genome accuracy measure assures that the solutions have physiologically relevant genomic properties. This work demonstrates extensive tests on diverse genomics datasets, including genotype-phenotype association studies and predictive modeling tasks in precision medicine, to verify the accuracy of the proposed approach. The results demonstrate that, in terms of precision, convergence rate, mean error, standard deviation, prediction, and fitness cost of physiologically important genomic biomarkers, the IMBOA consistently outperforms other cutting-edge optimization methods. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. DE boasts several advantages, such as ease of implementation, reliability, speed, and adaptability. However, DE does have certain limitations, such as suboptimal solution exploitation and challenging parameter tuning. To address these challenges, this research paper introduces a novel algorithm called Enhanced Binary JADE (EBJADE), which combines differential evolution with multi-population and elites regeneration. The primary innovation of this paper lies in the introduction of strategy with enhanced exploitation capabilities. This strategy is based on utilizing the sorting of three vectors from the current generation to perturb the target vector. By introducing directional differences, guiding the search towards improved solutions. Additionally, this study adopts a multi-population method with a rewarding subpopulation to dynamically adjust the allocation of two different mutation strategies. Finally, the paper incorporates the sampling concept of elite individuals from the Estimation of Distribution Algorithm (EDA) to regenerate new solutions through the selection process in DE. Experimental results, using the CEC2014 benchmark tests, demonstrate the strong competitiveness and superior performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Unfair competition on internet platforms (UCIP) has become a critical issue restricting the platform economy's healthy development. This paper applies evolutionary game theory to study how to utilize multiple subjects' synergy to supervise UCIP effectively. First, the "multi-agent co-governance" mode of UCIP is constructed based on the traditional "unitary supervision" mode. Second, the government and internet platform evolutionary game models are built under two supervision modes. Finally, MATLAB is used to simulate and analyze the evolutionary stage and parameter sensitivity. In addition, we match the model's evolutionary stage with China's supervisory process. The results show that (1) the Chinese government's supervision of UCIP is in the transitional stage from "campaign-style" to "normalization." (2) Moderate government supervision intensity is essential to guide the game system to evolve toward the ideal state. If the supervision intensity is too high, it will inhibit the enthusiasm for supervision. If the supervision intensity is too low, it cannot form an effective deterrent to the internet platforms. (3) When the participation of industry associations and platform users is low, it can only slow down the evolutionary speed of the game system's convergence to the unfavorable state. Nevertheless, it cannot reverse the evolutionary result. (4) Maintaining the participation level of industry associations and platform users above a specific threshold value while increasing punishment intensity will promote the transition of government supervision from the "campaign-style" to the "normalization" stage. This paper provides ideas and references for the Chinese government to design a supervision mechanism for UCIP. [ABSTRACT FROM AUTHOR]

The popularity of the average current mode (ACM) controlled boost type power factor correction (PFC) topologies is increasing due to their suitability for power quality problems. Proportional-Integral (PI) controller method is generally used in ACM controlled boost PFC circuits which include two controllers. However, the most important complexity of ACM controlled PFC circuits is tuning the coefficients of the PI controllers optimally. Therefore, this paper proposes the optimal tuning of PI coefficients used in ACM controlled boost PFC circuits using different meta-heuristics algorithms. First, the proposed ACM controller-based boost PFC topology is analyzed in MATLAB/Simulink software by using variable loads. Then the simulation results of the Cuckoo Optimization Algorithm (COA) based ACM controlled boost PFC converter are compared with the results determined via Ziegler-Nichols (ZN), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Imperialistic Competitive Algorithm (ICA), and Invasive Weed Optimization (IWO). Finally, the experimental verification of the topology has been done using a 600 W prototype and eZdsp F28335. As COA showed better results among other evolutionary algorithms used in this paper, we used COA parameters to observe the performance of the proposed tuning method. The experimental studies have been done under different load variations similar to the simulation studies. [ABSTRACT FROM AUTHOR]

This paper investigates the performance of a two-stage multi-criteria decision-making procedure for order scheduling problems. These problems are represented by a novel nonlinear mixed integer program. Hybridizations of three Multi-Objective Evolutionary Algorithms (MOEAs) based on dominance relations are studied and compared to solve small, medium, and large instances of the joint order batching and picking problem in storage systems with multiple blocks of two and three dimensions. The performance of these methods is compared using a set of well-known metrics and running an extensive battery of simulations based on a methodology widely used in the literature. The main contributions of this paper are (1) the hybridization of MOEAs to deal efficiently with the combination of orders in one or several picking tours, scheduling them for each picker, and (2) a multi-criteria approach to scheduling multiple picking teams for each wave of orders. Based on the experimental results obtained, it can be stated that, in environments with a large number of different items and orders with high variability in volume, the proposed approach can significantly reduce operating costs while allowing the decision-maker to anticipate the positioning of orders in the dispatch area. [ABSTRACT FROM AUTHOR]

Rank aggregation combines the preference rankings of multiple alternatives from different voters into a single consensus ranking, providing a useful model for a variety of practical applications but posing a computationally challenging problem. In this paper, we provide an effective hybrid evolutionary ranking algorithm to solve the rank aggregation problem with both complete and partial rankings. The algorithm features a semantic crossover based on concordant pairs and an enhanced late acceptance local search method reinforced by a relaxed acceptance and replacement strategy and a fast incremental evaluation mechanism. Experiments are conducted to assess the algorithm, indicating a highly competitive performance on both synthetic and real-world benchmark instances compared with state-of-the-art algorithms. To demonstrate its practical usefulness, the algorithm is applied to label ranking, a well-established machine learning task. We additionally analyze several key algorithmic components to gain insight into their operation. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grant 72371157] and Shanghai Pujiang Programme [Grant 23PJC069]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0019) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0019). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The coati optimization algorithm (COA) is a recently proposed heuristic algorithm. The COA algorithm, which solved the continuous optimization problems in its original paper, has been converted to a binary optimization solution by using transfer functions in this paper. Thus, binary COA (BinCOA) is proposed for the first time in this study. In this study, twenty transfer functions are used (four S-shaped, four V-shaped, four Z-shaped, four U-shaped, and four taper-shaped transfer functions). Thus, twenty variations of BinCOA are obtained, and the effect of each transfer function on BinCOA is examined in detail. The knapsack problem (KP) and uncapacitated facility location problem (UFLP), which are popular binary optimization problems in the literature, are chosen to test the success of BinCOA. In this study, small-, middle-, and large-scale KP and UFLP datasets are selected. Real-world problems are not always low-dimensional. Although a binary algorithm sometimes shows superior success in low dimensions, it cannot maintain the same success in large dimensions. Therefore, the success of BinCOA has been tested and demonstrated not only in low-dimensional binary optimization problems, but also in large-scale optimization problems. The most successful transfer function is T3 for KPs and T20 for UFLPs. This showed that S-shaped and taper-shaped transfer functions obtained better results than others. After determining the most successful transfer function for each problem, the enhanced BinCOA (EBinCOA) is proposed to increase the success of BinCOA. Two methods are used in the development of BinCOA. These are the repair method and the XOR gate method. The repair method repairs unsuitable solutions in the population in a way that competes with other solutions. The XOR gate is one of the most preferred methods in the literature when producing binary solutions and supports diversity. In tests, EBinCOA has achieved better results than BinCOA. The added methods have proven successful on BinCOA. In recent years, the newly proposed evolutionary mating algorithm, fire hawk optimizer, honey badger algorithm, mountain gazelle optimizer, and aquila optimizer have been converted to binary using the most successful transfer function selected for KP and UFLP. BinCOA and EBinCOA have been compared with these binary heuristic algorithms and literature. In this way, their success has been demonstrated. According to the results, it has been seen that EBinCOA is a successful and preferable algorithm for binary optimization problems. [ABSTRACT FROM AUTHOR]

This paper addresses the optimal control problems with an interval-valued objective function. We consider a type of total order relationships ≤ adm between two intervals. For each total order relationship, Kuhn–Tucker sufficient conditions for the optimal control problems with an interval-valued objective function are obtained. A numerical example is considered and solved. Kuhn–Tucker sufficient conditions provided under the total order relationship ≤ adm are sufficient conditions under the partial order relationship ⪯ LU for interval-valued optimal control problems. The results of this paper could help construct evolutionary algorithms to solve interval-valued optimal control problems. [ABSTRACT FROM AUTHOR]

Purpose: Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs). Design/methodology/approach: The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity. Findings: The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value. Originality/value: This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

AbstractIn order to improve the global search ability of the optimization algorithm when solving the path synthesis problem, this paper proposes a synthesis method of a four-bar mechanism based on the bisection strategy of the Lévy-PSO evolutionary algorithm. First, a synthesis equation of the target point is established based on the closed-loop vector method. Use the bisection strategy to cut the hinge coordinate variation range to reduce the probability of premature maturity of the algorithm. The error algorithm of the circular proximity function is used to reduce the search dimension of the optimization algorithm and improve search efficiency. Use the improved particle swarm algorithm based on Lévy to improve global search capabilities. Four multi-point path synthesis problem examples are given to verify the effectiveness and accuracy of the method. [ABSTRACT FROM AUTHOR]

Evolutionary multitask optimization (EMTO) has developed fast recently, and many algorithms have emerged that solve several different problems simultaneously through knowledge transfer. Most algorithms use a single search operator in their processing. However, different tasks have distinct characteristics, and a single operator is often inadequate to adapt to different stages of the same task. In this paper, we propose a multiple search operator selection strategy by adaptive probability allocation, named adaptive multi-operator selection (AMOS) to address EMTO that features rapid convergence of populations. It can automatically select the best multiple search operators based on the characteristics of specific tasks and different stages of evolution. The primary contributions of the proposed algorithm are as follows: (1) It combines the basic concepts of multi-operator integration and adaptive search operator selection to select the best multiple search operators for each task at different evolutionary stages; (2) It facilitates the knowledge transfer through different solving operators between tasks; (3) It can be flexibly embedded into various frameworks of general EMTO algorithms with good results. In the experiments, we validate the performance of AMOS on CEC2017 benchmark suite, CMTOPs benchmark suite, and real-world EMTO problems, and experimental results demonstrate the effectiveness and generality of the proposed strategy. [ABSTRACT FROM AUTHOR]

Without a well-defined energy management plan, achieving meaningful improvements in human lifestyle becomes challenging. Adequate energy resources are essential for development, but they are both limited and costly. In the literature, several solutions have been proposed for energy management but they either minimize energy consumption or improve the occupant's comfort index. The energy management problem is a multi-objective problem where the user wants to reduce energy consumption while keeping the occupant's comfort index intact. To address the multi-objective problem this paper proposed an energy control system for a green environment called PMC (Power Management and Control). The system is based on hybrid energy optimization, energy prediction, and multi-preprocessing. The combination of GA (Genetic Algorithm) and PSO (Particle Swarm Optimization) is performed to make a fusion methodology to improve the occupant comfort index (OCI) and decrease energy utilization. The proposed framework gives a better OCI when compared with its counterparts, the Ant Bee Colony Knowledge Base framework (ABCKB), GA-based prediction framework (GAP), Hybrid Prediction with Single Optimization framework (SOHP), and PSO-based power consumption framework. Compared with the existing AEO framework, the PMC gives practically the same OCI but consumes less energy. The PMC framework additionally accomplished the ideal OCI (i-e 1) when compared with the existing model, FA–GA (i-e 0.98). The PMC model consumed less energy as compared to existing models such as the ABCKB, GAP, PSO, and AEO. The PMC model consumed a little bit more energy than the SOHP but provided a better OCI. The comparative outcomes show the capability of the PMC framework to reduce energy utilization and improve the OCI. Unlike other existing methodologies except for the AEO framework, the PMC technique is additionally confirmed through a simulation by controlling the indoor environment using actuators, such as fan, light, AC, and boiler. [ABSTRACT FROM AUTHOR]

Nonlinear equation systems (NESs) are ubiquitous in scientific and engineering domains, necessitating efficient methods for discovering multiple roots simultaneously. Employing evolutionary algorithms to solve NESs has received significant attention. To simultaneously locate multiple roots in a single run, this paper proposes a differential evolution algorithm with adaptive niching and reinitialisation (DE-ANR). The proposed differential evolution algorithm integrates four strategies to address the challenges posed by NESs. Firstly, DE-ANR employs a dynamic niche size control mechanism to adjust the niche size during evolution, striking a balance between exploration and exploitation. Secondly, a lifetime mechanism is introduced to identify stagnating individuals for reinitialisation, ensuring diversity of the population and preventing premature convergence. Thirdly, an improved archive technique is employed to conserve computational resources by eliminating redundant solutions, directing the algorithm's efforts toward unexplored regions of the solution space. Finally, an adaptive strategy is introduced to dynamically adjust the scaling factor F based on the feedback of evolving population, simplifying parameter tuning. Extensive evaluations on 30 diverse NES problems and the comparison results with 12 state-of-the-art algorithms clearly show the superiority of proposed method. [ABSTRACT FROM AUTHOR]

This paper focuses on robustly stabilizing stable and unstable fractional-order plants with one uncertain fractional-order term and interval uncertainties using fractional order $ PI^{\mu }D^{\lambda } $ PIμDλ controllers. Two necessary and sufficient conditions are provided to check the robust stability of the closed-loop control system. Moreover, the D-decomposition technique is utilized to determine the robust stability region of the system. Subsequently, evolutionary algorithms, such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Differential Evolution (DE), can be utilized to discover a fractional-order controller within the region of robust stability. This work introduces three primary contributions, outlined as follows: (1) Utilizing a graphical approach, a set of stabilizing controller is obtained. (2) Rather than employing just a single stabilizing fractional-order controller, a collection of controllers is provided for the control system. (3) Employing evolutionary algorithms to find an optimal fractional-order controller. Finally, four numerical examples are presented to validate the results. [ABSTRACT FROM AUTHOR]

This paper aims to solve the multi-objective operating planning problem in the radioactive environment. First, a more complicated radiation dose model is constructed, considering difficulty levels at each operating point. Based on this model, the multi-objective operating planning problem is converted to a variant traveling salesman problem (VTSP). Second, with respect to this issue, a novel combinatorial algorithm framework, namely hyper-parameter adaptive genetic algorithm (HPAGA), integrating bio-inspired optimization with reinforcement learning, is proposed, which allows for adaptive adjustment of the hyperparameters of GA so as to obtain optimal solutions efficiently. Third, comparative studies demonstrate the superior performance of the proposed HPAGA against classical evolutionary algorithms for various TSP instances. Additionally, a case study in the simulated radioactive environment implies the potential application of HPAGA in the future. [ABSTRACT FROM AUTHOR]

Accurate short-time passenger volume prediction can guarantee the efficient scheduling command of urban rail transit. However, the short-time passenger flow of rail transit has the characteristics of nonlinearity and high randomness. In order to improve the prediction accuracy of short-time passenger volume, the Seasonal-Trend decomposition using Loess (STL) method and Human Evolutionary Optimization Algorithm (HEOA) is employed to optimize the bi-directional long short-term memory neural network (BiLSTM). Thus, a combined STL-HEOA-BiLSTM prediction model is proposed. Firstly, the inbound passenger volume along the urban rail transit is classified according to the Pearson correlation number. Secondly, the STL algorithm decomposes different types of short-time passenger flow data into Trend component (Tt), Seasonal component (St) and Residual component (Rt). Thirdly, the HEOA optimizes the various types of hyper-parameters of the BiLSTM model. Finally, the optimized BiLSTM model predicts Tt, St and Rt individually, and the final prediction value is obtained based on the combination of the three predictions. Three evaluation metrics are used to assess the results and quantify the effectiveness of the combined model. The example analysis shows that the prediction accuracy of the combined STL-HEOA-BiLSTM model surpasses that of the other six common and combined models in forecasting short-duration passenger flow. This experimental result shows the effectiveness, accuracy and applicability of the STL-HEOA-BiLSTM model proposed in this paper. It is demonstrated that the proposed model has a reference value for urban rail transit operators. [ABSTRACT FROM AUTHOR]

With the development of digital economy technologies, mobile edge computing (MEC) has emerged as a promising computing paradigm that provides mobile devices with closer edge computing resources. Because of high mobility, unmanned aerial vehicles (UAVs) have been extensively utilized to augment MEC to improve scalability and adaptability. However, with more UAVs or mobile devices, the search space grows exponentially, leading to the curse of dimensionality. This paper focus on the combined challenges of the deployment of UAVs and the task of offloading mobile devices in a large-scale UAV-assisted MEC. Specifically, the joint UAV deployment and task offloading problem is first modeled as a large-scale multiobjective optimization problem with the purpose of minimizing energy consumption while improving user satisfaction. Then, a large-scale UAV deployment and task offloading multiobjective optimization method based on the evolutionary algorithm, called LDOMO, is designed to address the above formulated problem. In LDOMO, a CSO-based evolutionary strategy and a MLP-based evolutionary strategy are proposed to explore solution spaces with different features for accelerating convergence and maintaining the diversity of the population, and two local search optimizers are designed to improve the quality of the solution. Finally, simulation results show that our proposed LDOMO outperforms several representative multiobjective evolutionary algorithms. [ABSTRACT FROM AUTHOR]