Search

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]

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]

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]

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]

Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a “dying” paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing “offspring”. Practically, this might be used to trace the successive published milestones of a research field. [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]

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]

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]

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]

Neural network pruning is a popular approach to reducing the computational complexity of deep neural networks. In recent years, as growing evidence shows that conventional network pruning methods employ inappropriate proxy metrics, and as new types of hardware become increasingly available, hardware-aware network pruning that incorporates hardware characteristics in the loop of network pruning has gained growing attention. Both network accuracy and hardware efficiency (latency, memory consumption, etc.) are critical objectives to the success of network pruning, but the conflict between the multiple objectives makes it impossible to find a single optimal solution. Previous studies mostly convert the hardware-aware network pruning to optimization problems with a single objective. In this paper, we propose to solve the hardware-aware network pruning problem with Multi-Objective Evolutionary Algorithms (MOEAs). Specifically, we formulate the problem as a multi-objective optimization problem, and propose a novel memetic MOEA, namely HAMP, that combines an efficient portfoliobased selection and a surrogate-assisted local search, to solve it. Empirical studies demonstrate the potential of MOEAs in providing simultaneously a set of alternative solutions and the superiority of HAMP compared to the state-of-the-art hardware-aware network pruning method. [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]

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]

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]

Accurate prediction of energy consumption in district heating systems plays an important role in supporting effective and clean energy production and distribution in dense urban areas. Predictive models are needed for flexible and cost-effective operation of energy production and usage, e.g., using peak shaving or load shifting to compensate for heat losses in the pipeline. This helps to avoid exceedance of power plant capacity. The purpose of this study is to automate the process of building machine learning (ML) models to solve a short-term power demand prediction problem. The dataset contains a district heating network's measured hourly power consumption and ambient temperature for 415 days. In this paper, we propose a hybrid evolutionary-based algorithm, named GA-SHADE, for the simultaneous optimization of ML models and feature selection. The GA-SHADE algorithm is a hybrid algorithm consisting of a Genetic Algorithm (GA) and success-history-based parameter adaptation for differential evolution (SHADE). The results of the numerical experiments show that the proposed GA-SHADE algorithm allows the identification of simplified ML models with good prediction performance in terms of the optimized feature subset and model hyperparameters. The main contributions of the study are (1) using the proposed GA-SHADE, ML models with varying numbers of features and performance are obtained. (2) The proposed GA-SHADE algorithm self-adapts during operation and has only one control parameter. There is no fine-tuning required before execution. (3) Due to the evolutionary nature of the algorithm, it is not sensitive to the number of features and hyperparameters to be optimized in ML models. In conclusion, this study confirms that each optimized ML model uses a unique set and number of features. Out of the six ML models considered, SVR and NN are better candidates and have demonstrated the best performance across several metrics. All numerical experiments were compared against the measurements and proven by the standard statistical tests. [ABSTRACT FROM AUTHOR]

Background: Drug design is a challenging and important task that requires the generation of novel and effective molecules that can bind to specific protein targets. Artificial intelligence algorithms have recently showed promising potential to expedite the drug design process. However, existing methods adopt multi-objective approaches which limits the number of objectives. Results: In this paper, we expand this thread of research from the many-objective perspective, by proposing a novel framework that integrates a latent Transformer-based model for molecular generation, with a drug design system that incorporates absorption, distribution, metabolism, excretion, and toxicity prediction, molecular docking, and many-objective metaheuristics. We compared the performance of two latent Transformer models (ReLSO and FragNet) on a molecular generation task and show that ReLSO outperforms FragNet in terms of reconstruction and latent space organization. We then explored six different many-objective metaheuristics based on evolutionary algorithms and particle swarm optimization on a drug design task involving potential drug candidates to human lysophosphatidic acid receptor 1, a cancer-related protein target. Conclusion: We show that multi-objective evolutionary algorithm based on dominance and decomposition performs the best in terms of finding molecules that satisfy many objectives, such as high binding affinity and low toxicity, and high drug-likeness. Our framework demonstrates the potential of combining Transformers and many-objective computational intelligence for drug design. [ABSTRACT FROM AUTHOR]

Biomimetics is an emerging field that allows mimicry of living organisms in nature to develop different techniques so as to solve hard and complex problems related to optimization. The different techniques developed in this field takes inspiration from biology or nature. Biology acts as a powerful tool for imitating, copying, learning, understanding and inspiring the development of new systems and models. The different techniques discussed in this paper include techniques based on evolutionary algorithms, neural network and swarm intelligence. All these techniques are biologically inspired and provide good accuracy. The accuracy of all these algorithms can be increased by using them in hybrid form with other techniques and using different datasets. The comparative analysis of these techniques is done using advantages, disadvantages and applications of these techniques. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hyper-heuristic algorithm termed evolutionary multi-mode slime mold optimization (EMSMO) for addressing continuous optimization problems. The architecture of a typical hyper-heuristic algorithm comprises two main components: the high-level component and the low-level component. The low-level component contains a set of low-level heuristics (LLHs) and intrinsic problem attributes, while the high-level component manipulates the LLHs to construct the sequence of heuristics. Inspired by the foraging behaviors of slime mold, we designed four easy-implemented search strategies including the search for food, approach food, wrap food, and re-initialization as the LLHs for the low-level component. In the high-level component, we adopt an improvement-based probabilistic selection function that contains two metrics: (1) the probability of improvement and (2) the normalized improvement. The selection function cooperates with the roulette wheel strategy to construct the optimization sequence. To evaluate the performance of our proposal, we implement comprehensive numerical experiments on CEC2013 benchmark functions and three engineering optimization problems. Six classic or advanced evolutionary algorithms and three hyper-heuristic algorithms are applied as competitor algorithms to evaluate the competitiveness of EMSMO. Experimental and statistical results show that EMSMO has broad prospects for solving continuous optimization problems. [ABSTRACT FROM AUTHOR]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

This study presents a multi-objective solving indicator-based evolutionary algorithm (IBEA) to solve the optimal power flow (OPF) problem with multiple and competing objectives. The objective functions for the multi-objective OPF (MOOPF) are active power loss, aggregate voltage deviation, total generation cost, and emission pollution. This algorithm combines the shift-based density estimation method with a weighted sum approach to produce a set of non-dominated solutions on each objective space. Moreover, an S-shaped fuzzy membership approach is used to extract the best compromise solution from the obtained non-dominated solutions. To validate the IBEA's performance, standard IEEE 30-bus and IEEE 57-bus test systems with nine different cases are being used. This paper also presents a stochastic optimal power flow problem for two-objective optimization with load demand and wind power uncertainty. [ABSTRACT FROM AUTHOR]

We separate the component spectra of the composite-spectrum binary 14 Serpentis, derive a precise double-lined (SB2) orbit for the system, and investigate the physical properties and evolutionary states of its component stars. The 260-day binary is comprised of an early-K giant plus a late-Am star that is rotating at ∼60-70 km s−1. We find that the system has a mass ratio ( M1/ M2) of 1.14 ± 0.01, and that the cool star is ∼1.7 times as bright as its hot companion in V, though ∼2.5 times brighter bolometrically. We derive individual masses and logarithmic luminosities of the cool star and the hotter one as 2.05 and 1.8 M⊙, and 1.57 and 1.18 log L⊙, respectively, with corresponding uncertainties close to 0.1 M⊙ and 0.07 log L⊙. Fitting evolutionary tracks to the H-R diagram positions of the two stars suggests that the cool primary is part-way up the red-giant branch and that the system has been evolving for more than 109 years; the absence of Li from its spectrum may support the latter statement. The hotter, less massive companion appears to have left the zero-age main sequence, which accords with the log g<4.0 indicated by comparisons with synthetic spectra, though its radius is currently only 2.5 R⊙. [ABSTRACT FROM AUTHOR]

Social networks are the primary source of information sharing, and with the abundant availability of the internet, more and more information is being dumped into social networks from various sources. There is no proper credibility check, so social networks have become the main source for manipulated or inclined news. As information comes in multiple forms, there is a need for multimodal models to detect Fake News. Many features being specific to the domain may mislead the process of classifying news. Obtaining specific features that could retain the framework's capability becomes the point of interest. The paper proposes a novel method first to obtain features from a specific attribute and use a mechanism to derive optimal features that helps in attaining the ability to detect Fake News across domains. Genetic algorithms, termed nature-driven, aim at exploring the best optimal features that enhance the detection capability of the framework. Therefore, the paper proposes a model that works on textual features, metadata, and author embedding data and uses genetic algorithms to extract optimal features. These multimodal are combined using fusion methods, and finally, 2-Layer MLP is used to detect the Fake posts. Fakeddit, a multimodal dataset, is used for analysis. Text features are generated from the Title parameter, which is used as clickbait to attract attention. Genetic algorithms like two-phase gray wolf (TMGWO) and improved sine cosine algorithms (ISCA) are used to extract the best optimal features from the dataset. The proposed model has achieved an accuracy of 91.05% when ISCA is used to extract optimal features, BERT is used to analyze textual features, and metadata and author embedding are combined using Concatenate. The model has shown that extracting optimal features has enhanced the overall accuracy of the multimodal model. The proposed model is observed to outperform other state-of-the-art models working on similar data. To the best of our knowledge, the proposed framework is prominent in obtaining specific features that could help to classify news or articles as real or fake using the blend of Genetic-based and fusion-based models. [ABSTRACT FROM AUTHOR]

K-Means is a "de facto" standard clustering algorithm due to its simplicity and efficiency. K-Means, though, strongly depends on the initialization of the centroids (seeding method) and often gets stuck in a local sub-optimal solution. K-Means, in fact, mainly acts as a local refiner of the centroids, and it is unable to move centroids all over the data space. Random Swap was defined to go beyond K-Means, and its modus operandi integrates K-Means in a global strategy of centroids management, which can often generate a clustering solution close to the global optimum. This paper proposes an approach which extends both K-Means and Random Swap and improves the clustering accuracy through an evolutionary technique and careful seeding. Two new algorithms are proposed: the Population-Based K-Means (PB-KM) and the Population-Based Random Swap (PB-RS). Both algorithms consist of two steps: first, a population of J candidate solutions is built, and then the candidate centroids are repeatedly recombined toward a final accurate solution. The paper motivates the design of PB-KM and PB-RS, outlines their current implementation in Java based on parallel streams, and demonstrates the achievable clustering accuracy using both synthetic and real-world datasets. [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]

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]

Feature selection in classification is a complex optimization problem that cannot be solved in polynomial time. Bi-objective feature selection, aiming to minimize both selected features and classification errors, is challenging due to the conflict between objectives, while one of the most effective ways to tackle this is to use multi-objective evolutionary algorithms. However, very few of these have ever reflected an evolutionary multi-tasking framework, despite the implicit parallelism offered by the population-based search characteristic. In this paper, a dynamic multi-tasking-based multi-objective evolutionary algorithm (termed DTEA) is proposed for handling bi-objective feature selection in classification, which is not only suitable for datasets with relatively lower dimensionality of features, but is also suitable for datasets with relatively higher dimensionality of features. The role and influence of multi-tasking on multi-objective evolutionary feature selection were studied, and a dynamic tasking mechanism is proposed to self-adaptively assign multiple evolutionary search tasks by intermittently analyzing the population behaviors. The efficacy of DTEA is tested on 20 classification datasets and compared with seven state-of-the-art evolutionary algorithms. A component contribution analysis was also conducted by comparing DTEA with its three variants. The empirical results show that the dynamic-tasking mechanism works efficiently and enables DTEA to outperform other algorithms on most datasets in terms of both optimization and classification. [ABSTRACT FROM AUTHOR]

Running time analysis of evolutionary algorithms for continuous optimization is one research challenge in the field of evolutionary algorithms (EAs). However, the theoretical analysis results have rarely been applied to evolutionary algorithms for continuous optimization in practice, let alone their variants for evolution strategy. In this paper, we regarded the first hitting time of evolution strategy as the stopping time of the renewal process on the basis of the renewal process and in combination with Wald's inequality and stopping time theory. Afterwards, to demonstrate the application of the proposed model in the first hitting time analysis of (1 + 1) ES, we analyzed it with different mutation operators on the sphere function. First, we significantly improved the lower bound on the first hitting time of (1 + 1) ES with a uniform mutation operator, i.e., from Ω (n) to Ω (e c n) . Next, O (n 2 n) was the upper bound on the first hitting time of (1 + 1) ES with a Gaussian mutation operator from the initial distance R to half of the initial distance R /2. The numerical experimental results showed that the theoretical calculation was consistent with the actual running time, which provides a novel method for analyzing the first hitting time of EAs. [ABSTRACT FROM AUTHOR]

As the power source of the engine, the Fuel Pump(FP) plays a vital role in the safe operation of the aircraft. Due to the complexity of the working mechanism of Aviation Fuel Pumps (AFP) and the strong correlation between the components, the assessment model cannot reflect the health state of the FPs better, while the initial parameters in the assessment model will affect the assessment effect of the model. Therefore, this paper proposes a health status assessment model that can fully integrate monitoring data. To improve the accuracy of the model parameters, the Random Forest algorithm is used to give the feature weights to make up for the limitation of relying on expert knowledge, and the model parameters are optimized by the Covariance Matrix Adaptive Evolutionary Strategy algorithm, which achieves an accurate assessment of the state. Finally, the AFP test bed was built and the AFP was tested. Compared with other methods, the accuracy of the proposed method in this question reaches 96%, which is greatly superior to other methods and verifies the effectiveness of the proposed method. It also provides an outlook on future research directions for health state assessment. [ABSTRACT FROM AUTHOR]

The efficiency of multi-objective evolutionary algorithms (MOEAs) in tackling issues with multiple objectives is examined. However, it is noted that current MOEA-based feature selection techniques often converge towards the center of the Pareto front due to inadequate selection forces. The study proposes the utilization of a novel approach known as MOEA/D, which partitions complex multi-objective problems into smaller, more feasible single-objective sub-problems. Each sub-problem may then be addressed using an equal amount of computational resources. The predetermined size of the neighborhood used by MOEA/D may lead to a delay in the algorithm's merging and reduce the effectiveness of the failure. The paper proposes the Adaptive Neighbourhood Adjustment Strategy (ANAS) as a novel approach to improve the efficiency of multi-objective optimisation algorithms in order to tackle this issue. The ANAS algorithm allows for adaptive adjustment of the subproblem neighborhood size, hence enhancing the trade-off between merging and variety. In the following section of the study, a novel feature selection technique called MOGHHNS3/DANA is introduced. This technique utilizes ANAS to expand the potential solutions for a particular subproblem. The approach evaluates the chosen features using the Regulated Extreme Learning Machine (RELM) classifier on sixteen benchmark datasets. The experimental results demonstrate that MOGHHNS3/D-ANA outperforms four commonly employed multi-objective techniques in terms of accuracy, precision, recall, F1 score, coverage, hamming loss, ranking loss, and training time, error. The APBI approach in decomposition-based multiobjective optimization focuses on handling constraints by adjusting penalty parameters to guide the search towards feasible solutions. On the other hand, the ANA approach focuses on dynamically adjusting the neighborhood size or search direction based on the proximity of solutions in the detached space to adapt the search process. The proposed approach achieves convergence by minimizing redundancy, preserving diversity in the decision space, and simultaneously enhancing classification accuracy. [ABSTRACT FROM AUTHOR]

Optimization is a process of minimizing or maximizing a given objective function under specified constraints. In multi-objective optimization (MOO), multiple conflicting functions are optimized within defined criteria. Numerous MOO techniques have been developed utilizing various meta-heuristic methods such as Evolutionary Algorithms (EAs), Genetic Algorithms (GAs), and other biologically inspired processes. In a cooperative environment, a Pareto front is generated, and an MOO technique is applied to solve for the solution set. On other hand, Multi-Criteria Decision Making (MCDM) is often used to select a single best solution from a set of provided solution candidates. The Multi-Criteria Decision Making–Pareto Front (M-PF) optimizer combines both of these techniques to find a quality set of heuristic solutions. This paper provides an improved version of the M-PF optimizer, which is called the elite Multi-Criteria Decision Making–Pareto Front (eMPF) optimizer. The eMPF method uses an evolutionary algorithm for the meta-heuristic process and then generates a Pareto front and applies MCDM to the Pareto front to rank the solutions in the set. The main objective of the new optimizer is to exploit the Pareto front while also exploring the solution area. The performance of the developed method is tested against M-PF, Non-Dominated Sorting Genetic Algorithm-II (NSGA-II), and Non-Dominated Sorting Genetic Algorithm-III (NSGA-III). The test results demonstrate the performance of the new eMPF optimizer over M-PF, NSGA-II, and NSGA-III. eMPF was not only able to exploit the search domain but also was able to find better heuristic solutions for most of the test functions used. [ABSTRACT FROM AUTHOR]

Performance adaptation is an effective way to improve the accuracy of gas turbine performance models. Although current performance adaptation methods, such as those using genetic algorithms or evolutionary computation to modify component characteristic maps, are useful for finding good solutions, they are essentially searching methods and suffer from long computation time. This paper presents a novel approach that can achieve good performance adaptation with low time complexity and without using any searching method. In this method, the actual component performance parameters are first estimated using engine measurements at different operating conditions. For each operating condition, some scaling factors are introduced and calculated to indicate the difference between the actual and predicted component performance parameters. Afterward, an interpolating algorithm is adopted to synthesize the scaling factors for modifying all major component maps. The adapted component maps are then able to make the engine model match all the gas path measurements and achieve the required accuracy of the engine performance model. The proposed approach has been tested with a model high-bypass turbofan engine using simulated data. The results show that the proposed performance adaptation approach can effectively improve the model's accuracy. Specifically, the prediction errors can be reduced from about 9% to about 0.6%. In addition, this approach has much less computational complexity compared to other optimization-based counterparts. [ABSTRACT FROM AUTHOR]

Multi-objective evolutionary algorithms (MOEA) have attracted much attention because of their good global exploration ability; however, their local search ability near the optimal value is weak, and for large-scale decision-variable optimization problems the number of populations and iterations required by MOEA are very large, so the optimization efficiency is low. Gradient optimization algorithms can overcome these difficulties well, but gradient search methods are difficult to apply to multi-objective optimization problems (MOPs). To this end, this paper introduces a stochastic weighting function based on the weighted average gradient and proposes two multi-objective stochastic gradient operators. Further, two efficient evolutionary algorithms, MOGBA and HMOEA, are developed. Their local search capability has been greatly enhanced while retaining the good global exploration capability by using different offspring update strategies for different subpopulations. Numerical experiments show that HMOEA has excellent capture ability for various Pareto formations, and it can easily solve multi-objective optimization problems with many objectives, which improves the efficiency by a factor of 5–10 compared with typical multi-objective evolutionary algorithms. HMOEA is further applied to the multi-objective aerodynamic optimization design of the RAE2822 airfoil and the ideal Pareto front is obtained, which indicates that HMOEA is an efficient optimization algorithm with potential applications in aerodynamic optimization design. [ABSTRACT FROM AUTHOR]

Numerous studies revealed optimization techniques' applicability in minimizing the costs of reinforced concrete buildings. However, the existing literature has narrowly focused on optimizing buildings with a single function, such as residential or office buildings, hindering the generalization of the results. This paper aims to bridge the gap between optimization and structural engineering by obtaining the minimum-cost design of flat slab buildings with different intended functions. In this context, the optimal designs of 120 alternatives were obtained, considering various spans (4–8 m), live loads (2–10 kPa), and concrete compressive strength (25–40 MPa). The optimization was executed using the evolutionary algorithm provided in Microsoft Excel's Solver tool. The optimization model permits the utilization of drop panels to resist punching stresses developed from the slab-column interaction. The objective function is the cost of materials and labor involved in constructing floors and columns. The decision variables are the floor dimensions and column configurations in dimensions and reinforcement. The structural constraints were applied per the Egyptian design code (ECP203-2020). Eventually, guidelines were developed to help the designers choose the economic floor system and quantities of materials based on the building's intended function. [ABSTRACT FROM AUTHOR]

Artificial Neural Networks (ANNs) have been used in a multitude of real-world applications given their predictive capabilities, and algorithms based on gradient descent, such as Backpropagation (BP) and variants, are usually considered for their optimisation. However, these algorithms have been shown to get stuck at local optima, and they require a cautious design of the architecture of the model. This paper proposes a novel memetic training method for simultaneously learning the ANNs structure and weights based on the Coral Reef Optimisation algorithms (CROs), a global-search metaheuristic based on corals' biology and coral reef formation. Three versions based on the original CRO combined with a Local Search procedure are developed: (1) the basic one, called Memetic CRO; (2) a statistically guided version called Memetic SCRO (M-SCRO) that adjusts the algorithm parameters based on the population fitness; (3) and, finally, an improved Dynamic Statistically-driven version called Memetic Dynamic SCRO (M-DSCRO). M-DSCRO is designed with the idea of improving the M-SCRO version in the evolutionary process, evaluating whether the fitness distribution of the population of ANNs is normal to automatically decide the statistic to be used for assigning the algorithm parameters. Furthermore, all algorithms are adapted to the design of ANNs by means of the most suitable operators. The performance of the different algorithms is evaluated with 40 classification datasets, showing that the proposed M-DSCRO algorithm outperforms the other two versions on most of the datasets. In the final analysis, M-DSCRO is compared against four state-of-the-art methods, demonstrating its superior efficacy in terms of overall accuracy and minority class performance. [ABSTRACT FROM AUTHOR]

This paper proposes an algorithm for solving multiobjective optimization problems using the attack technique of the Grey Wolf. It is a metaheuristic method called a Multiobjective Optimizer based on Grey Wolf Attack Technique (MOGWAT). In fact, it is inspired by the modified Hybrid Grey Wolf Optimizer and Genetic Algorithm (HmGWOGA), which is a single objective optimization algorithm specially designed for positive objective functions. The MOGWAT method combines the multiple objective functions of the initial problem into a single objective function, and then penalizes constraint functions to get an unconstrained single-objective optimization. The use of an effective single-objective optimizer allows reaching the optimal solutions. These solutions are also the Pareto optimal solutions of the initial problem according to some parameters. Through some theorems, we have established the theoretical foundation and performance of our method. Furthermore, in order to highlight the numerical performance of the method, we have tackled three groups of problems: 16 test problems from the Zitzler-Deb-Thiele benchmarks, 2 instances from the CEC 2009 benchmarks, and 2 real-world problems from literature. Our numerical results have been compared to the ones obtained with the NSGA-II method. This comparison was made using some computed performance parameters. The outcomes of the comparison have enabled us to prove the effectiveness and efficiency of our new approach in terms of speed and convergence. [ABSTRACT FROM AUTHOR]

Theoretical studies on evolutionary algorithms have developed vigorously in recent years. Many such algorithms have theoretical guarantees in both running time and approximation ratio. Some approximation mechanism seems to be inherently embedded in many evolutionary algorithms. In this paper, we identify such a relation by proposing a unified analysis framework for a global simple multiobjective evolutionary algorithm (GSEMO) and apply it on a minimum weight general cover problem, which is general enough to subsume many important problems including the minimum submodular cover problem in which the submodular function is real-valued, and the minimum connected dominating set problem for which the potential function is nonsubmodular. We show that GSEMO yields theoretically guaranteed approximation ratios matching those achievable by a greedy algorithm in expected polynomial time when the potential function g is polynomial in the input size and the minimum gap between different g-values is a constant. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by National Natural Science Foundation of China [11771013, U20A2068]; Zhejiang Provincial Natural Science Foundation of China [LD19A010001]. [ABSTRACT FROM AUTHOR]

This paper investigates the trajectory design problem in the scenario of a multiple Sun-synchronous Orbit (SSO) space debris flyby mission from a DRO space station. At first, the characteristics of non-planar transfer from DRO to SSO in the Earth–Moon system are analyzed. The methods of large-scale ergodicity and pruning are utilized to investigate single-impulse and two-impulse DRO–Earth transfers. Using a powered lunar flyby, the two-impulse DRO–Earth transfer is able to fly by SSO debris while satisfying the requirements of the mission. After the local optimization, the optimal result of two-impulse DRO–Earth transfer and flyby is obtained. A multi-objective evolutionary algorithm is used to design the Pareto-optimal trajectories of multiple flybys. The semi-analytical optimization method is developed to provide the estimations of the transfer parameters in order to reduce the computations caused by the evolutionary algorithm. Simulations show that transferring from the 3:2 resonant DRO to a near-coplanar flyby of a SSO target debris using a powered lunar gravity assist needs a 0.47 km/s velocity increment. The mission's total velocity increment is 1.39 km/s, and the total transfer time is 2.23 years. [ABSTRACT FROM AUTHOR]

Land use allocation (LUA) is of prime importance for the development of urban sustainability and resilience. Since the process of planning and managing land use requires balancing different conflicting social, economic, and environmental factors, it has become a complex and significant issue in urban planning worldwide. LUA is usually regarded as a spatial multi-objective optimization (MOO) problem in previous studies. In this paper, we develop an MOO approach for tackling the LUA problem, in which maximum economy, minimum carbon emissions, maximum accessibility, maximum integration, and maximum compactness are formulated as optimal objectives. To solve the MOO problem, an improved non-dominated sorting genetic algorithm III (NSGA-III) is proposed in terms of mutation and crossover operations by preserving the constraints on the sizes for each land use type. The proposed approach was applied to KaMavota district, Maputo City, Mozambique, to generate a proper land use plan. The results showed that the improved NSGA-III yielded better performance than the standard NSGA-III. The optimal solutions produced by the MOO approach provide good trade-offs between the conflicting objectives. This research is beneficial for policymakers and city planners by providing alternative land use allocation plans for urban sustainability and resilience. [ABSTRACT FROM AUTHOR]

The escalating reliance of modern society on information and communication technology has rendered it vulnerable to an array of cyber-attacks, with distributed denial-of-service (DDoS) attacks emerging as one of the most prevalent threats. This paper delves into the intricacies of DDoS attacks, which exploit compromised machines numbering in the thousands to disrupt data services and online commercial platforms, resulting in significant downtime and financial losses. Recognizing the gravity of this issue, various detection techniques have been explored, yet the quantity and prior detection of DDoS attacks has seen a decline in recent methods. This research introduces an innovative approach by integrating evolutionary optimization algorithms and machine learning techniques. Specifically, the study proposes XGB-GA Optimization, RF-GA Optimization, and SVM-GA Optimization methods, employing Evolutionary Algorithms (EAs) Optimization with Tree-based Pipelines Optimization Tool (TPOT)-Genetic Programming. Datasets pertaining to DDoS attacks were utilized to train machine learning models based on XGB, RF, and SVM algorithms, and 10-fold cross-validation was employed. The models were further optimized using EAs, achieving remarkable accuracy scores: 99.99% with the XGB-GA method, 99.50% with RF-GA, and 99.99% with SVM-GA. Furthermore, the study employed TPOT to identify the optimal algorithm for constructing a machine learning model, with the genetic algorithm pinpointing XGB-GA as the most effective choice. This research significantly advances the field of DDoS attack detection by presenting a robust and accurate methodology, thereby enhancing the cybersecurity landscape and fortifying digital infrastructures against these pervasive threats. [ABSTRACT FROM AUTHOR]

Cost prediction can provide a pharma supply chain industry with completing their projects on schedule and within budget. This paper provides a new multi-function Blockchain Technology-enabled Pharmaceutical Supply Chain (BT-enabled PSC) mathematical cost model, including PSC costs, BT costs, and uncertain demand. The purpose of this study is to find the most appropriate algorithm(s) with minimum prediction errors to predict the costs of the BT-enabled PSC model. This paper also aims to determine the importance and cost of each component of the multi-function model. To reach these goals, we combined four Supervised Learning algorithms (KNN, DT, SVM, and NB) with two Evolutionary Computation algorithms (HS and PSO) after data generation. Each component of the multi-function model has its importance, and we applied the Feature Weighting approach to analyze their importance. Next, four performance metrics evaluated the multi-function model, and the Total Ranking Score determined predictive algorithms with high reliability. The results indicate the HS-NB and PSO-NB algorithms perform better than the other six algorithms in predicting the costs of the multi-function model with small errors. The findings also show that the Raw Materials cost has a more substantial influence on the model than the other components. This study also introduces the components of the multi-function BT-enabled PSC model. [ABSTRACT FROM AUTHOR]

Artificial intelligence is changing and influencing our world. As one of the main algorithms in the field of artificial intelligence, convolutional neural networks (CNNs) have developed rapidly in recent years. Especially after the emergence of NASNet, CNNs have gradually pushed the idea of AutoML to the public's attention, and large numbers of new structures designed by automatic searches are appearing. These networks are usually based on reinforcement learning and evolutionary learning algorithms. However, sometimes, the blocks of these networks are complex, and there is no small model for simpler tasks. Therefore, this paper proposes POSS-CNN aiming at target recognition and detection, which employs a multi-branch CNN structure with PSNC and a method of automatic parallel selection for super parameters based on a multi-branch CNN structure. Moreover, POSS-CNN can be broken up. By choosing a single branch or the combination of two branches as the "benchmark", as well as the overall POSS-CNN, we can achieve seven models with different precision and operations. The test accuracy of POSS-CNN for a recognition task tested on a CIFAR10 dataset can reach 86.4%, which is equivalent to AlexNet and VggNet, but the operation and parameters of the whole model in this paper are 45.9% and 45.8% of AlexNet, and 29.5% and 29.4% of VggNet. The mAP of POSS-CNN for a detection task tested on the LSVH dataset is 45.8, inferior to the 62.3 of YOLOv3. However, compared with YOLOv3, the operation and parameters of the model in this paper are reduced by 57.4% and 15.6%, respectively. After being accelerated by WRA, POSS-CNN for a detection task tested on an LSVH dataset can achieve 27 fps, and the energy efficiency is 0.42 J/f, which is 5 times and 96.6 times better than GPU 2080Ti in performance and energy efficiency, respectively. [ABSTRACT FROM AUTHOR]

As a new abstract computational model in evolutionary transfer optimization (ETO), single-objective to multi-objective optimization (SMO) is conducted at the macroscopic level rather than the intermediate level for specific algorithms or the microscopic level for specific operators; this method aims to develop systems with a profound grasp of evolutionary dynamic and learning mechanism similar to human intelligence via a "decomposition" style (in the abstract of the well-known "Transformer" article "Attention is All You Need", they use "attention" instead). To the best of our knowledge, it is the first work of SMO for discrete cases because we extend our conference paper and inherit its originality status. In this paper, by implementing the abstract SMO in specialized memetic algorithms, key knowledge from single-objective problems/tasks to the multi-objective core problem/task can be transferred or "gathered" for permutation flow shop scheduling problems, which will reduce the notorious complexity in combinatorial spaces for multi-objective settings in a straight method; this is because single-objective tasks are easier to complete than their multi-objective versions. Extensive experimental studies and theoretical results on benchmarks (1) emphasize our decomposition root in mathematical programming, such as Lagrangian relaxation and column generation; (2) provide two "where to go" strategies for both SMO and ETO; and (3) contribute to the mission of building safe and beneficial artificial general intelligence for manufacturing via evolutionary computation. [ABSTRACT FROM AUTHOR]

Inspired by the migration and reproduction of species in nature to explore suitable habitats, this paper proposed a new swarm intelligence algorithm called the Migration and Reproduction Algorithm (MARA). This new algorithm discusses how to transform the behavior of an organism looking for a suitable habitat into a mathematical model, which can solve optimization problems. MARA has some common features with other optimization methods such as particle swarm optimization (PSO) and the fireworks algorithm (FWA), which means MARA can also solve the optimization problems that PSO and FWA are used to, namely, high-dimensional optimization problems. MARA also has some unique features among biology-based optimization methods. In this paper, we articulated the structure of MARA by correlating it with natural biogeography; then, we demonstrated the performance of MARA on sets of 12 benchmark functions. In the end, we applied it to optimize a practical problem of power dispatching in a multi-microgrid system that proved it has certain value in practical applications. [ABSTRACT FROM AUTHOR]

The paper considers an innovative model of autonomous charging stations where a program implementing a scheduling algorithm and a set of jobs being scheduled are driven by the same common power source. It is assumed that one of the well-known local search metaheuristics—an evolutionary algorithm—is used for the scheduling process. The algorithm is designed to search for a sequence of charging jobs resulting in a schedule of the minimum length. Since processors with variable processing speeds can be used for computations, this has interesting consequences both from a theoretical and practical point of view. It is shown in the paper that the problem of choosing the right processor speed under given constraints and an assumed scheduling criterion is a non-trivial one. We formulate a general problem of determining the computation speed of the evolutionary algorithm based on the proposed model of a computational task and the adopted problem of scheduling charging jobs. The novelty of the paper consists of two aspects: (i) proposing the new model of the autonomous charging station operating according to the basics of edge computing; and (ii) developing the methodology for dynamically changing the computational speed, taking into account power and energy constraints as well as the results of computations obtained in the current iteration of the algorithm. Some approaches for selecting the appropriate speed of computations are proposed and discussed. Conclusions and possible directions for future research are also given. [ABSTRACT FROM AUTHOR]

Large scale databases are critical for helping scientists decipher long-term patterns in human evolution. This paper describes the conception and development of such a research database and illustrates how big data can be harnessed to formulate new ideas about the past. The Role of Culture in Early Expansions of Humans (ROCEEH) is a transdisciplinary research center whose aim is to study the origins of culture and the multifaceted aspects of human expansions across Africa and Eurasia over the last three million years. To support its research, the ROCEEH team developed an online tool named the ROCEEH Out of Africa Database (ROAD) and implemented its web-based applications. ROAD integrates geographical data as well as archaeological, paleoanthropological, paleontological and paleobotanical content within a robust chronological framework. In fact, a unique feature of ROAD is its ability to dynamically link scientific data both spatially and temporally, thereby allowing its reuse in ways that were not originally conceived. The data stem from published sources spanning the last 150 years, including those generated by the research team. Descriptions of these data rely on the development of a standardized vocabulary and profit from online explanations of each table and attribute. By synthesizing legacy data, ROAD facilitates the reuse of heritage data in novel ways. Database queries yield structured information in a variety of interoperable formats. By visualizing data on maps, users can explore this vast dataset and develop their own theories. By downloading data, users can conduct further quantitative analyses, for example with Geographic Information Systems, modeling programs and artificial intelligence. In this paper, we demonstrate the innovative nature of ROAD and show how it helps scientists studying human evolution to access datasets from different fields, thereby connecting the social and natural sciences. Because it permits the reuse of "old" data in new ways, ROAD is now an indispensable tool for researchers of human evolution and paleogeography. [ABSTRACT FROM AUTHOR]