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]

Facial emotion detection systems have witnessed significant advancements, particularly with the utilization of convolutional neural networks (CNNs). This paper provides a thorough survey of such systems, beginning with an introduction to artificial intelligence and the evolutionary trajectory of neural networks, including artificial neural networks (ANNs), recurrent neural networks (RNNs), and CNNs. The paper elaborates on CNNs' architecture and functionality, elucidating key components such as convolutional layers, pooling layers, and fully connected layers, while also spotlighting prominent CNN architectures like AlexNet and ResNet. It delineates the broad scope and diverse applications of facial emotion detection systems across various domains, including marketing research, crowd testing, AI robots, banking, and entertainment. In the literature review section, recent research papers on CNN models for facial expression recognition are synthesized, highlighting variances in datasets, methodologies, and accuracy levels. The paper concludes that CNNs represent the current pinnacle of facial emotion classification techniques, surpassing previous methodologies such as eigenfaces. It underscores the efficacy of deep CNN architectures trained on extensive facial image datasets in proficiently identifying emotions from facial expressions. Moreover, the paper emphasizes the necessity for ongoing endeavors to enhance accuracy, particularly concerning complex emotions like disgust. In essence, CNNs exhibit substantial promise for the development of real-world facial emotion detection systems, heralding a new era of sophisticated emotion recognition technology. [ABSTRACT FROM AUTHOR]

The flying foxes optimization (FFO) algorithm, as a newly introduced metaheuristic algorithm, is inspired by the survival tactics of flying foxes in heat wave environments. FFO preferentially selects the best-performing individuals. This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area. To address this issue, the paper introduces an opposition-based learning-based search mechanism for FFO algorithm (IFFO). Firstly, this paper introduces niching techniques to improve the survival list method, which not only focuses on the adaptability of individuals but also considers the population's crowding degree to enhance the global search capability. Secondly, an initialization strategy of opposition-based learning is used to perturb the initial population and elevate its quality. Finally, to verify the superiority of the improved search mechanism, IFFO, FFO and the cutting-edge metaheuristic algorithms are compared and analyzed using a set of test functions. The results prove that compared with other algorithms, IFFO is characterized by its rapid convergence, precise results and robust stability. [ABSTRACT FROM AUTHOR]

Processes or products are typically complex systems with numerous interrelated procedures and interdependent components. This results in complex relationships between responses and input factors, as well as complex nonlinear correlations among multiple responses. If the two types of complex correlations in the quality design cannot be properly dealt with, it will affect the prediction accuracy of the response surface model, as well as the accuracy and reliability of the recommended optimal solutions. In this paper, we combine kernel trick-based kernel principal component analysis, spline-based Bayesian semiparametric additive model, and normal boundary intersection-based evolutionary algorithm to address these two types of complex correlations. The effectiveness of the proposed method in modeling and optimisation is validated through a simulation study and a case study. The results show that the proposed Bayesian semiparametric additive model can better describe the process relationships compared to least squares regression, random forest regression, and support vector basis regression, and the proposed multi-objective optimisation method performs well on several indicators mentioned in the paper. [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]

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]

Evolutionary multi-objective clustering (EMOC) algorithms have gained popularity recently, as they can obtain a set of clustering solutions in a single run by optimizing multiple objectives. Particularly, in one type of EMOC algorithm, the number of clusters k is taken as one of the multiple objectives to obtain a set of clustering solutions with different k. However, the numbers of clusters k and other objectives are not always in conflict, so it is impossible to obtain the clustering solutions with all different k in a single run. Therefore, evolutionary multi-objective k-clustering (EMO-KC) has recently been proposed to ensure this conflict. However, EMO-KC could not obtain good clustering accuracy on high-dimensional datasets. Moreover, EMO-KC's validity is not ensured as one of its objectives (SSDexp, which is transformed from the sum of squared distances (SSD)) could not be effectively optimized and it could not avoid invalid solutions in its initialization. In this paper, an improved evolutionary multi-objective clustering algorithm based on autoencoder (AE-IEMOKC) is proposed to improve the accuracy and ensure the validity of EMO-KC. The proposed AE-IEMOKC is established by combining an autoencoder with an improved version of EMO-KC (IEMO-KC) for better accuracy, where IEMO-KC is improved based on EMO-KC by proposing a scaling factor to help effectively optimize the objective of SSDexp and introducing a valid initialization to avoid the invalid solutions. Experimental results on several datasets demonstrate the accuracy and validity of AE-IEMOKC. The results of this paper may provide some useful information for other EMOC algorithms to improve accuracy and convergence. [ABSTRACT FROM AUTHOR]

This paper provides a systematic review of the Genetic Algorithm (GA)s proposed to solve planning and scheduling problems in Engineer-To-Order (ETO) contexts. Our review focuses on how the key characteristics of ETO projects affect both the problem studied and the GA algorithmic features. Typical ETO projects consist of one-of-a-kind products with complex structures and uncertain designs. A deep analysis of the papers published between 2000 and 2022 enables identifying 10 main characteristics of ETO projects, six activity types, 10 decision types, eight groups of constraints, and 10 optimisation objectives. Our study shows that none of the reported papers integrates all 10 ETO characteristics. The less studied ETO characteristics are incorporating design and engineering information in the problem definition and the design uncertainty. Our review also identifies 10 recurrent encoding formats and emphasises the most frequently used genetic operators. We observed that most planning and scheduling problems consider objectives and decisions related to product customisation or supply chain configuration yielding multi-objective problems. Most multi-objective GAs use a weighted sum or are based on NSGAII. Diversity maintenance methods, adaptive and parameter tunning mechanisms, or hybridisation with machine learning models are still not used in this context. A systematic review of genetic algorithms dedicated to industrial planning and scheduling Analysis on how the characteristics of ETO projects impact the design of genetic representation and operators Recommendation on approaches employed to reach high-quality solutions [ABSTRACT FROM AUTHOR]

As potent approaches for addressing computationally expensive optimization problems, surrogate-assisted evolutionary algorithms (SAEAs) have garnered increasing attention. Prevailing endeavors in evolutionary computation predominantly concentrate on expensive continuous optimization problems, with a notable scarcity of investigations directed toward expensive combinatorial optimization problems (ECOPs). Nevertheless, numerous ECOPs persist in practical applications. The widespread prevalence of such problems starkly contrasts the limited development of relevant research. Motivated by this disparity, this paper conducts a comprehensive survey on SAEAs tailored to address ECOPs. This survey comprises two primary segments. The first segment synthesizes prevalent global, local, hybrid, and learning search strategies, elucidating their respective strengths and weaknesses. Subsequently, the second segment furnishes an overview of surrogate-based evaluation technologies, delving into three pivotal facets: model selection, construction, and management. The paper also discusses several potential future directions for SAEAs with a focus towards expensive combinatorial optimization. [ABSTRACT FROM AUTHOR]

Manually designed convolutional neural networks have demonstrated excellent performance in various domains, but designing neural networks suitable for specific tasks poses significant challenges, and the emergence of Neural Structure Search (NAS) provides a new solution to this problem. However, existing algorithms either focus solely on network lightweight, resulting in subpar network performance, or excessively emphasize performance, leading to substantial network redundancy. With consideration for both network parameters and performance, this paper designs a hybrid search space based on residual modules and RepVGG modules using genetic algorithm, and stacks them together to form a more efficient network. To achieve this, we propose an efficient variable-length encoding strategy, utilizing units as the fundamental encoding space to encode variable-length individuals; we design evolutionary operations encompassing single-point crossover and three types of mutation operators to ensure population diversity; during training, a random forest-based performance predictor is employed to significantly shorten the network search time. To demonstrate the effectiveness of the proposed algorithm, we introduce the concept of transfer learning, which involves decoding the globally optimal solution, fine-tuning it, and then transferring it to three categories of real-world application datasets. Through comparisons with various algorithms, our approach consistently achieved leading performance. [ABSTRACT FROM AUTHOR]

This review comprehensively examines the burgeoning field of intelligent techniques to enhance power systems' stability, control, and protection. As global energy demands increase and renewable energy sources become more integrated, maintaining the stability and reliability of both conventional power systems and smart grids is crucial. Traditional methods are increasingly insufficient for handling today's power grids' complex, dynamic nature. This paper discusses the adoption of advanced intelligence methods, including artificial intelligence (AI), deep learning (DL), machine learning (ML), metaheuristic optimization algorithms, and other AI techniques such as fuzzy logic, reinforcement learning, and model predictive control to address these challenges. It underscores the critical importance of power system stability and the new challenges of integrating diverse energy sources. The paper reviews various intelligent methods used in power system analysis, emphasizing their roles in predictive maintenance, fault detection, real-time control, and monitoring. It details extensive research on the capabilities of AI and ML algorithms to enhance the precision and efficiency of protection systems, showing their effectiveness in accurately identifying and resolving faults. Additionally, it explores the potential of fuzzy logic in decision-making under uncertainty, reinforcement learning for dynamic stability control, and the integration of IoT and big data analytics for real-time system monitoring and optimization. Case studies from the literature are presented, offering valuable insights into practical applications. The review concludes by identifying current limitations and suggesting areas for future research, highlighting the need for more robust, flexible, and scalable intelligent systems in the power sector. This paper is a valuable resource for researchers, engineers, and policymakers, providing a detailed understanding of the current and future potential of intelligent techniques in power system stability, control, and protection. [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 development of offshore oil fields confronts challenges associated with high water cut and low displacement efficiency. Reservoir injection-production optimization stands out as an effective means to reduce costs and enhance efficiency in offshore oilfield development. The process of optimizing injection and production in offshore oil reservoirs involves designing strategies for a large number of wells and optimization time steps, constituting a large-scale, complex, and costly optimization computation problem. In recent years, with the rapid advancements in big data and artificial intelligence technologies, sophisticated evolutionary computation methods have found widespread application in reservoir injection-production optimization problems. However, the abundance of intelligent optimization algorithms raises the question of how to choose a method suitable for the complex optimization background of offshore oilfield injection-production optimization. This paper provides a detailed overview of the application of an existing differential evolution algorithm (DE), conventional surrogate-assisted evolutionary algorithm (CSAEA), and global–local surrogate-assisted differential evolution (GLSADE) in the context of practical offshore oilfield injection-production optimization problems. A comprehensive comparison of their performance differences is presented. The study concludes that the global–local surrogate-assisted evolutionary algorithm is the most suitable method for addressing the current challenges in offshore oilfield injection-production optimization. [ABSTRACT FROM AUTHOR]

Background: Channel selection has become the pivotal issue a ecting the widespread application of non-invasive brain-computer interface systems in the real world. However, constructing suitable multi-objective problem models alongside e ective search strategies stands out as a critical factor that impacts the performance of multi-objective channel selection algorithms. This paper presents a two-stage sparse multi-objective evolutionary algorithm (TS-MOEA) to address channel selection problems in brain-computer interface systems. Methods: In TS-MOEA, a two-stage framework, which consists of the early and late stages, is adopted to prevent the algorithm from stagnating. Furthermore, The two stages concentrate on di erent multi-objective problem models, thereby balancing convergence and population diversity in TS-MOEA. Inspired by the sparsity of the correlation matrix of channels, a sparse initialization operator, which uses a domain-knowledge-based score assignment strategy for decision variables, is introduced to generate the initial population. Moreover, a Score-based mutation operator is utilized to enhance the search efficiency of TS-MOEA. Results: The performance of TS-MOEA and five other state-of-the-art multi-objective algorithms has been evaluated using a 62-channel EEG-based brain-computer interface system for fatigue detection tasks, and the results demonstrated the e ectiveness of TS-MOEA. Conclusion: The proposed two-stage framework can help TS-MOEA escape stagnation and facilitate a balance between diversity and convergence. Integrating the sparsity of the correlation matrix of channels and the problem-domain knowledge can e ectively reduce the computational complexity of TS-MOEA while enhancing its optimization efficiency. [ABSTRACT FROM AUTHOR]

Autonomous region protection is a significant research area in multi-agent systems, aiming to empower defenders in preventing intruders from accessing specific regions. This paper presents a Multi-agent Region Protection Environment (MRPE) featuring fewer defenders, defender damages, and intruder evasion strategies targeting defenders. MRPE poses challenges for traditional protection methods due to its high nonstationarity and limited interception time window. To surmount these hurdles, we modify evolutionary reinforcement learning, giving rise to the corresponding multi-agent region protection method (MRPM). MRPM amalgamates the merits of evolutionary algorithms and deep reinforcement learning, specifically leveraging Differential Evolution (DE) and Multi-Agent Deep Deterministic Policy Gradient (MADDPG). DE facilitates diverse sample exploration and overcomes sparse rewards, while MADDPG trains defenders and expedites the DE convergence process. Additionally, an elite selection strategy tailored for multi-agent systems is devised to enhance defender collaboration. The paper also presents ingenious designs for the fitness and reward functions to effectively drive policy optimizations. Finally, extensive numerical simulations are conducted to validate the effectiveness of MRPM. [ABSTRACT FROM AUTHOR]

In the field of expensive optimization, numerous papers have proposed surrogate-assisted evolutionary algorithms (SAEAs) for a few thousand or even hundreds of function evaluations. However, in reality, low-cost simulations suffice for a lot of real-world problems, in which the number of function evaluations is moderately restricted, e.g., to several thousands. In such moderately restricted scenario, SAEAs become unnecessarily time-consuming and tend to struggle with premature convergence. In addition, tuning the SAEA parameters becomes impractical under the restricted budgets of function evaluations—in some cases, inadequate configuration may degrade performance instead. In this context, this paper presents a fast and auto-tunable evolutionary algorithm for solving moderately restricted expensive optimization problems. The presented algorithm is a variant of adaptive differential evolution (DE) algorithms, and is called emulation-based adaptive DE or EBADE. The primary aim of EBADE is to emulate the principle of sample-efficient optimization, such as that in SAEAs, by adaptively tuning the DE parameter configurations. Specifically, similar to Expected Improvement-based sampling, EBADE identifies parameter configurations that may produce expected-to-improve solutions, without using function evaluations. Further, EBADE incepts a multi-population mechanism and assigns a parameter configuration to each subpopulation to estimate the effectiveness of parameter configurations with multiple samples carefully. This subpopulation-based adaptation can help improve the selection accuracy of promising parameter configurations, even when using an expected-to-improve indicator with high uncertainty, by validating with respect to multiple samples. The experimental results demonstrate that EBADE outperforms modern adaptive DEs and is highly competitive compared to SAEAs with a much shorter runtime. [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]

In the trajectory planning of crewless ships, the artificial potential field method is commonly used. The results obtained using the classic potential field model for path design are not optimal and cannot fully meet the trajectory design requirements of uncrewed ships. This paper uses the evolutionary potential field model for trajectory planning. The evaluation formula of the potential path is combined with the differential evolution algorithm to evaluate and optimize the potential. A quadratic optimization smoothing algorithm is designed to limit the maximum turning angle of the uncrewed ship. Simulation experiments show that this method is effective and reliable. [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]

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]

To address the challenges posed by the fast-charging demand of electric vehicles, causing feeder load and voltage imbalances during operation, this paper introduces a spatio-temporal pricing strategy tailored to enhance feeder operation equilibrium. This approach facilitates the spatio-temporal guidance of fast-charging loads for electric vehicles in operation. This paper begins by formulating a spatio-temporal distribution model for electric vehicle fast-charging loads, considering owners' preferences. It further develops a behavioral model for the travel choices of electric vehicles, illustrating the impact of spatio-temporal electricity pricing at fast-charging stations on load distribution. Next, it proposes a multi-objective spatio-temporal pricing model and its solution method specifically designed for feeder-balance-oriented fast-charging stations. This model targets the minimization of the spatio-temporal imbalance in feeder voltage and load. It takes a comprehensive approach, considering the constraints of the spatio-temporal load distribution model and optimal power flow model. The resulting spatio-temporal pricing model for fast-charging stations is effectively solved using the extended Pareto evolutionary algorithm. To validate the effectiveness of the proposed method in achieving feeder balancing, this paper analyzes two examples: a self-built 29- node road network and a 9-node distribution network, as well as a 66-node road network and a 33-node distribution network in the Xinjiang region. The results show that the proposed method can effectively guide the charging of electric vehicles and make the load distribution more balanced. [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]

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]

Cognitive Radio (CR) is developed to provide effective spectrum usage. CR is much significant in improving the efficiency of the global internet in applications. The evolutionary measurement technology is utilised to improve the evaluation of channel-state information. The outcome attained very few spectrums sensing in CR for complex mobility. A good optimisation method is needed to improve the accurate channel state prediction in successful channel access. Thus, this paper aims to implement a novel power and channel allocation mechanism with the help of a new Modified Levy Flight-based Artificial Ecosystem Optimisation (MLF-AEO) Optimisation Strategy. This paper achieves the optimal power control and channel allocation mechanism intending to solve the multiple objective functions based on the constraints like Interference among users, Outage Probability, and throughput. The superiority of the proposed algorithm is thoroughly verified by various simulation results. [ABSTRACT FROM AUTHOR]

This study seeks to plan and evaluate the cost of the logistics in manufacturing tetra duplex board using prime grade and recycled materials. The real-world data for this study is obtained from one of the largest paper and board industries in Asia. The bi-objective problem is formulated by developing a mixed integer linear programming (MILP) model considering the constraints related to raw material supplies, processing, and storage. The metaheuristic optimization techniques are applied based on the concept of epsilon dominance to balance the conflicting objectives to counter the complex problem in the real world of transportation for the ease of the decision-makers to make the best-informed decisions in the selection of raw material. The investigation results indicate that the cost of prime-grade material in the tetra duplex board supply chain is 71 percent higher than recycled fiber. Furthermore, this study can be extended by evaluating the environmental aspects of prime and recycled-grade transportation. Moreover, the logistics of the prime grade can further be narrowed down by investigating it in various modes of transportation such as highways, waterways, rail, and air. [ABSTRACT FROM AUTHOR]

Flood control operation of cascade reservoirs is an important technology to reduce flood disasters and increase economic benefits. Flood forecast information can help reservoir managers make better use of flood resources and reduce flood risks. In this paper, a hierarchical pre-release flood operation rule considering the flood forecast and its uncertainty information is proposed for real-time flood control. A many-objective optimization model considering the cascade reservoir's power generation objective, flood control objective, and navigation objective is established. Then, a region search evolutionary algorithm is applied to optimize the many-objective optimization model in a real-world case study upstream of the Yangtze River basin. The optimization experimental results show that the region search evolutionary algorithm can balance convergence and diversity well, and the HV value is 40% higher than the MOEA/D algorithm. The simulation flood control results of cascade reservoirs upstream of the Yangtze River demonstrate that the optimized flood control rule can increase the average multi-year power generation of cascade reservoirs by a maximum of 27.72 × 108 kWh under the condition of flood control safety. The rules proposed in this paper utilize flood resources by identifying runoff forecast information, and pre-release to the flood limit level 145 m before the big flood occurs, so as to ensure the safety downstream and the dam's own flood control and provide reliable decision support for reservoir managers. [ABSTRACT FROM AUTHOR]

PID controllers can regulate and stabilize processes in response to changes and disturbances. This paper provides a comprehensive review of PID controller tuning methods for industrial applications, emphasizing intelligent and nature-inspired algorithms. Techniques such as Fuzzy Logic (FL), Artificial Neural Networks (ANN), and Adaptive Neuro Fuzzy Inference System (ANFIS) are explored. Additionally, nature-inspired algorithms, including evolutionary algorithms like Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Ant Colony Optimization (ACO), Simulated Annealing (SA), Artificial Bee Colony (ABC), Firefly Algorithm (FA), Cuckoo Search (CS), Harmony Search (HS), and Grey Wolf Optimization (GWO), are examined. While conventional PID tuning methods are valuable, the evolving landscape of control engineering has led to the exploration of intelligent and nature-inspired algorithms to further enhance PID controller performance in specific applications. The study conducts a thorough analysis of these tuning methods, evaluating their effectiveness in industrial applications through a comprehensive literature review. The primary aim is to offer empirical evidence on the efficacy of various algorithms in PID tuning. This work presents a comparative analysis of algorithmic performance and their real-world applications, contributing to a comprehensive understanding of the discussed tuning methods. Findings aim to uncover the strengths and weaknesses of diverse PID tuning methods in industrial contexts, guiding practitioners and researchers. This paper is a sincere effort to address the lack of specific quantitative comparisons in existing literature, bridging the gap in empirical evidence and serving as a valuable reference for optimizing intelligent and nature-inspired algorithms-based PID controllers in various industrial applications. [ABSTRACT FROM AUTHOR]

As a new production pattern, the hybrid seru system (HSS) originated from the actual production scenario. In the HSS, the implementation of the worker transfer strategy can further enhance the system's flexibility but is rarely studied at present. In this paper, we develop a reinforcement learning driven two-stage evolutionary algorithm (RL-TEA) to address the hybrid seru system scheduling problem with worker transfer (HSSSP-WT). To conquer this complex problem, the HSSSP-WT is divided into worker assignment-related subproblems (WS) and batch scheduling-related subproblems (BS) according to the problem characteristics. To effectively solve the subproblems, a probability modelbased exploration and a lower bound-guided heuristic are presented for the WS, and a greedy search is designed for the BS. Meanwhile, to improve search efficiency and effectiveness, a knowledgebased selection mechanism is proposed to determine which subproblem group to optimise in each generation by fusing a reinforcement learning technique and a lower bound filtering strategy. Moreover, an elite enhancement strategy inspired by the problem property is designed to improve the solution quality. Experimental results demonstrate the effectiveness of the worker transfer strategy and the superior performance of the RL-TEA compared with the state-of-the-art algorithms in solving the HSSSP-WT. [ABSTRACT FROM AUTHOR]

The dismantling and protection of networks is a significant problem that has wide-ranging applications and attracts many researchers. Most current studies only focus on single-layer or one-to-one interdependent networks. However, this paper considers the more realistic case where the links between layers in interdependent networks are one-to-many, and the networks' robustness is studied accordingly. To solve the problem of dissolving interdependent networks under the premise of heterogeneous costs, we propose a cost-constrained elite quadratic evolutionary algorithm (CCEEA) based on cost constraints. Based on the network's prior information, the initial optimal feasible solutions derived from four classical algorithms are regarded as the initial elite individuals of CCEEA. The set of attack nodes is then continuously updated interactively according to a new evolutionary mechanism with flexible updates so that the combination of nodes in the final set of attack nodes can maximally facilitate the disintegration of the network. We conducted experiments on a series of representative networks and showed that on synthetic networks, the CCEEA algorithm outperforms the other four state-of-the-art attack strategies by more than 13% in terms of disintegration, which is up to 25% higher. In particular, it can be up to more than 90% higher in real networks. [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]

This paper investigates the application of genetic programming (GP) for dynamic symbolic regression (SR), addressing the challenge of adapting machine learning models to evolving data in practical applications. Benchmark instances with changing underlying functions over time are defined to assess the performance of a genetic algorithm (GA) as a traditional evolutionary algorithm and an age-layered population structure (ALPS) as an open-ended evolutionary algorithm for dynamic symbolic regression. This study analyzes population dynamics by examining variable frequencies and impact changes over time in response to dynamic shifts in the training data. The results demonstrate the effectiveness of both the GA and ALPS in handling changing data, showcasing their ability to recover and evolve improved solutions after an initial drop in population quality following data changes. Population dynamics reveal that variable impacts respond rapidly to data changes, while variable frequencies shift gradually across generations, aligning with the indirect measure of fitness represented by variable impacts. Notably, the GA shows a strong dependence on mutation to avoid variables becoming permanently extinct, contrasting with the ALPS's unexpected insensitivity to mutation rates owing to its reseeding mechanism for effective variable reintroduction. [ABSTRACT FROM AUTHOR]

Portfolio design is the most difficult aspect of financial investment decisions. This paper presents a trade-off solution between low returns and portfolio stability by a fixed predetermined niveau of conservatism. A conservative model that combines both risk-free assets as agricultural land and risky assets is proposed. An experimental model with one-year historical data for four assets was built and tested to find a globally optimal solution using an evolutionary algorithm. The results showed that a positive return can be realized with a share of 13-14% in the assets of agricultural land. [ABSTRACT FROM AUTHOR]

Evolutionary algorithms have found enormous applications in solving real-world problems due to their stochastic nature. They have a set of control parameters, which are used to perform certain operations to induce randomness, scalar displacement etc. Various works have been done for tuning these parameters, as appropriate parameter tuning can enhance the performance of algorithm greatly. Inertia weights based parameter tuning is one of the widely used techniques for this purpose. In this paper, we have reviewed some of the inertia weight strategies and applied them to Social Group Optimization (SGO) to study the changes in its performance and have performed a thorough analysis on the same. Following the analysis, the need of a more generalized inertia weight strategy was felt which could be used in parameter tuning for different variety of problems and hence Sigmoid adaptive inertia weight have been proposed. SGO with sigmoid-adaptive inertia weight (SGOSAIW) has been simulated on twenty-seven benchmark functions suite and further simulated on few mechanical and chemical engineering problems and compared to other similar algorithms for performance analysis. In eight-benchmark function suite, SGOSAIW obtained better minima except one i.e. 'Schwefel 2.26' with respect to other algorithms investigated in this work. In nineteen-benchmark function suite, SGOSAIW obtained better minima except one i.e. 'Noisy function'. Thus, the proposed algorithm yielded promising results which are well represented with suitable tables and graphs in the paper. [ABSTRACT FROM AUTHOR]

This paper deals with an industrial problem of machining line design, which consists in partitioning a given set of operations into several subsets corresponding to workstations and sequencing the operations to satisfy the technical requirements and achieve the best performance of the line. The problem has a complex set of constraints that include partial order on operations, part positioning, inclusion, exclusion, cycle time, and installation of parallel machines on a workstation. The problem is NP-hard and even finding a feasible solution can be a difficult task from the practical point of view. A parallel evolutionary algorithm (EA) is proposed and implemented for execution on a Graphics Processing Unit (GPU). The parallelization in the EA is done by working on several parents in one iteration and in multiple application of mutation operator to the same parent to produce the best offspring. The proposed approach is evaluated on large scale instances and demonstrated superior performance compared to the algorithms from the literature in terms of running time and ability to obtain feasible solutions. It is shown that in comparison to the traditional populational EA scheme the newly proposed algorithm is more suitable for advanced GPUs with a large number of cores. [ABSTRACT FROM AUTHOR]

The techniques for solving complex optimization problems using nature inspired metaheuristic algorithms are widely accepted. Nature inspired methods use nature derived approaches to offer an efficient solution within polynomial time. This paper presents analytics of some of the significant nature inspired metaheuristic algorithms. It elaborates on the principles and concepts that are used in these algorithms representing their similarities, variations, and exceptions. The taxonomical classification and analytics presented in this paper list the nature derived phenomenon used to develop a wide variety of nature-inspired techniques. The algorithms are classified as per the type of agents used, search techniques, sub-optimization methods, type of constraints, and nature of problems. The survey comprehends the use of control parameters like exploration and convergence applicable to these algorithms and their domain specifications. The sources of nature inspiration are also presented with their variants. It establishes the analytics required to choose a specific nature-inspired heuristic algorithm for smart farming and related applications. Metaheuristic algorithms like Particle Swarm optimization, Ant colony optimization, Whale optimization, Firefly optimization, etc. have contributed significantly in assisting smart farming methods for better productivity of crops. [ABSTRACT FROM AUTHOR]

Formulations of structural optimization problems are proposed in this paper to automatically find the best grouping of columns in 3D steel buildings. In these formulations, the conflicting objective functions, minimized simultaneously, are the weight of the structure and the number of different groups of columns. In other words, the smaller the number of different groups of columns, the greater the weight of the structure, and the greater the number of groups, the smaller the structure's weight. The design variables are the bracing system configuration, column cross-section orientation, and assigned W-shaped profile indices for columns, beams, and braces. The design constraints are the allowable displacements, strength, and geometric considerations. After solving the multi-objective optimization problem, the result is a Pareto front, presenting non-dominated solutions. Three evolutionary algorithms based on differential evolution are adopted in this paper to solve three computational experiments. Even if preliminary groupings of columns are adopted, considering architectural aspects such as the symmetry of the structure, it is possible to discover other interesting structural configurations that will be available to the decision maker, who will be able to make their choices based on the impacts on manufacturing, cutting, transporting, checking and welding. [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]

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]