Search

Environmental concerns and soaring energy prices have brought huge pressure of energy saving and emission reduction to tissue paper mills. Electricity is one of the main energy sources of tissue paper mills. The production characteristics of tissue paper mills make it easy to decrease energy cost by using time-of-use (TOU) electricity tariffs. This study investigates the bi-objective energy-efficiency scheduling of tissue paper mills under time-of-use electricity tariffs, the objectives of which are makespan and energy cost. First, considering the processing energy cost, setup energy cost, and transportation energy cost, an energy cost model of a tissue paper mill under TOU electricity tariffs is established. Second, the energy-efficiency scheduling model under TOU electricity tariffs is built based on the energy cost model. Finally, on the basis of decomposition and teaching–learning optimization, this study proposes a novel multi-objective evolutionary algorithm and further combined with the variable neighborhood search to solve the problem. The case study results demonstrate that our study of tissue paper mill energy saving is feasible, and the proposed method has better performance than the existing methods. [ABSTRACT FROM AUTHOR]

Federated learning (FL) and bioinspired computing (BIC), two distinct, yet complementary fields, have gained significant attention in the machine learning community due to their unique characteristics. FL enables decentralized machine learning by allowing models to be trained on data residing across multiple devices or servers without exchanging raw data, thus enhancing privacy and reducing communication overhead. Conversely, BIC draws inspiration from nature to develop robust and adaptive computational solutions for complex problems. This paper explores the state of the art in the integration of FL and BIC, introducing BIC techniques and discussing the motivations for their integration with FL. The convergence of these fields can lead to improved model accuracy, enhanced privacy, energy efficiency, and reduced communication overhead. This synergy addresses inherent challenges in FL, such as data heterogeneity and limited computational resources, and opens up new avenues for developing more efficient and autonomous learning systems. The integration of FL and BIC holds promise for various application domains, including healthcare, finance, and smart cities, where privacy-preserving and efficient computation is paramount. This survey provides a systematic review of the current research landscape, identifies key challenges and opportunities, and suggests future directions for the successful integration of FL and BIC. [ABSTRACT FROM AUTHOR]

In this paper, a prediction model of the coupling coefficient based on a multi-module neural network (MMNN) is developed to quickly optimize the installation position of the roof antenna of the 5G-Railway (5G-R) communication system, so as to improve the anti-interference performance of the roof antenna. Firstly, a simulation model of the coupling coefficient between the pantograph arcing and the roof antenna (a monopole antenna operating frequency of 2 GHz) was established to construct the dataset. It is also verified that the influence of the electromagnetic interference (EMI) of pantograph arcing can be significantly reduced by predicting the new installation position (minimum coupling coefficient), and the installation position optimization of roof antenna can be realized. Then, the mind evolutionary algorithm of the back propagation neural network (MEA-BP) algorithm and particle swarm optimization—extreme learning machine (PSO-ELM) algorithm were adopted, respectively. The extreme learning machine algorithm constructed a different prediction model. And, by setting the integrated strategy of piecewise prediction, the prediction results are optimized and the accuracy of the prediction model based on the MMNN is further improved. Finally, the prediction model is proven to be able to replace the complicated electromagnetic simulation work accurately and efficiently by a variety of prediction performance indices, which provides an effective prediction method for the rapid optimization of the installation position of the roof antenna. [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]

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]

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]

Vehicular ad hoc networks (VANETs) are a type of mobile ad hoc network that forms a unified wireless communication network between vehicles and roadside nodes. Roadside units (RSUs), as the infrastructure and key component of VANETs, play a critical role in improving the performance of VANETs. Their deployment can effectively improve the communication performance of the network. The goal of the RSU deployment (RSUD) problem is to install as few RSUs as possible on both sides of roads or intersections so that they can cover most areas and achieve better communication performance. This paper proposes a multi-objective optimization model to solve the RSUD problem using the characteristics of RSUDs on urban roads. Our optimized target includes three performance indicators, which are the deployment cost of RSUs, their coverage area, and communications. Since these three indicators cannot achieve consensus, this paper proposes a multi-objective evolutionary algorithm, the NSGA-II Pareto optimal solution, to solve the RSUD problem. The simulation results show the effectiveness of the multi-objective model and method. Finally, we present an experiment featuring RSU deployment that is based on a real traffic environment and uses OpenStreetMap; this experiment proves that our proposed method is practical. [ABSTRACT FROM AUTHOR]

In recent years, nanogenerator technology has developed rapidly with the rise of cloud computing, artificial intelligence, and other fields. Therefore, the quick identification of the evolutionary path of nanogenerator technology from a large amount of data attracts much attention. It is of great significance in grasping technical trends and analyzing technical areas of interest. However, there are some limitations in previous studies. On the one hand, previous research on technological evolution has generally utilized bibliometrics, patent analysis, and citations between patents and papers, ignoring the rich semantic information contained therein; on the other hand, its evolution analysis perspective is single, and it is difficult to obtain accurate results. Therefore, this paper proposes a new framework based on the methods of Sentence-BERT and phrase mining, using multi-source data, such as papers and patents, to unveil the evolutionary path of nanogenerator technology. Firstly, using text vectorization, clustering algorithms, and the phrase mining method, current technical themes of significant interest to researchers can be obtained. Next, this paper correlates the multi-source fusion themes through semantic similarity calculation and demonstrates the multi-dimensional technology evolutionary path by using the "theme river map". Finally, this paper presents an evolution analysis from the perspective of frontier research and technology research, so as to discover the development focus of nanogenerators and predict the future application prospects of nanogenerator technology. [ABSTRACT FROM AUTHOR]

Technical indicators use graphic representations of datasets by applying various mathematical formulas to financial time series of prices. These formulas comprise a set of rules and parameters whose values are not necessarily known and depend on many factors, such as the market in which they operate, the size of the time window, and so on. This paper focuses on the real-time optimization of the parameters applied for analyzing time series of data. In particular, we optimize the parameters of some technical financial indicators. We propose the combination of several Multiobjective Evolutionary Algorithms. Unlike other approaches, this paper applies a set of different Multiobjective Evolutionary Algorithms, collaborating to construct a global Pareto Set of solutions. Solutions for financial problems seek high returns with minimal risk. The optimization process is continuous and occurs at the same frequency as the investment time interval. This technique permits the application of the non-dominated solutions obtained with different MOEAs at the same time. Experimental results show that Collaborative Multiobjective Evolutionary Algorithms obtain up to 22% of profit and increase the returns of the commonly used Buy and Hold strategy and other multi-objective strategies, even for daily operations. [ABSTRACT FROM AUTHOR]

The actual situation of carbon-emission reduction in China's power sector has not yet achieved the expected benefits. The rent-seeking behavior of participants in power construction projects (PCPs) hinders the realization of low-carbon benefits. It is necessary to explore the behavioral strategies of the various participants in the low-carbon transition of PCPs. This paper creatively constructs an evolutionary game model of PCPs' participants from the perspective of MRV (monitoring, reporting, and verification) and introduces the influence of the public to provide a comprehensive analysis of strategic equilibrium points. Through numerical simulations with MATLAB R2021a software, this paper explores the strategic choices of participants in different situations and gives relevant inferences and proofs. The results show that the grid company dominates at the initial stage and promotes participants to regulate behaviors. Under the premise of satisfying the system-stability requirements, setting the growth rate of the grid company's punishments to 100% can enhance the willingness for strict supervision, while the growth rate of the supervision costs to 200% significantly decreases the probability of strict supervision. With the integration of MRV and PCPs, participants spontaneously fulfill the carbon-emission-reduction tasks. Reasonable control of input costs can effectively avoid the occurrence of rent-seeking behavior. In addition, this paper sets the public-influence growth rate at 200% and finds that the public plays a greater role in driving participants to fulfill responsibilities. Based on the results, a low-carbon transition mechanism for PCPs under the MRV system is proposed by considering several dimensions, which provides suggestions for participants to fulfill carbon-reduction responsibilities. [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]

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]

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]

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]

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]

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]

This paper addresses the green permutation flow shop scheduling problem (GPFSP) with energy consumption consideration, aiming to minimize the maximum completion time and total energy consumption as optimization objectives, and proposes a new method that integrates end-to-end deep reinforcement learning (DRL) with the multi-objective evolutionary algorithm based on decomposition (MOEA/D), termed GDRL-MOEA/D. To improve the quality of solutions, the study first employs DRL to model the PFSP as a sequence-to-sequence model (DRL-PFSP) to obtain relatively better solutions. Subsequently, the solutions generated by the DRL-PFSP model are used as the initial population for the MOEA/D, and the proposed job postponement energy-saving strategy is incorporated to enhance the solution effectiveness of the MOEA/D. Finally, by comparing the GDRL-MOEA/D with the MOEA/D, NSGA-II, the marine predators algorithm (MPA), the sparrow search algorithm (SSA), the artificial hummingbird algorithm (AHA), and the seagull optimization algorithm (SOA) through experimental tests, the results demonstrate that the GDRL-MOEA/D has a significant advantage in terms of solution quality. [ABSTRACT FROM AUTHOR]

The field of evolutionary multitasking optimization (EMTO) has been a highly anticipated research topic in recent years. EMTO aims to utilize evolutionary algorithms to concurrently solve complex problems involving multiple tasks. Despite considerable advancements in this field, numerous evolutionary multitasking algorithms continue to use a single evolutionary search operator (ESO) throughout the evolution process. This strategy struggles to completely adapt to different tasks, consequently hindering the algorithm's performance. To overcome this challenge, this paper proposes multitasking evolutionary algorithms via an adaptive bi-operator strategy (BOMTEA). BOMTEA adopts a bi-operator strategy and adaptively controls the selection probability of each ESO according to its performance, which can determine the most suitable ESO for various tasks. In an experiment, BOMTEA showed outstanding results on two well-known multitasking benchmark tests, CEC17 and CEC22, and significantly outperformed other comparative algorithms. [ABSTRACT FROM AUTHOR]

In recent decades, with the expansion of distributed energy generation technologies and the increasing need for more flexibility and efficiency in energy distribution systems, microgrids have been considered a promising innovative solution for local energy supply and enhancing resilience against network fluctuations. One of the basic challenges in the operation of microgrids is the optimal management of voltage and frequency in the network, which has been the subject of extensive research in the field of microgrid operational optimization. The energy demand is considered a crucial element for energy management due to its fluctuating nature over the day. The use of demand response strategies for energy management is one of the most important factors in dealing with renewables. These strategies enable better energy management in microgrids, thereby improving system efficiency and stability. Given the complexity of optimization problems related to microgrid management, evolutionary optimization algorithms such as the Imperialist Competitive Algorithm (ICA) and Genetic Algorithm (GA) have gained great attention. These algorithms enable solving high-complexity optimization problems by considering various constraints and multiple objectives. In this paper, both ICA and GA, as well as their hybrid application, are used to significantly enhance the voltage regulation in microgrids. The integration of optimization techniques with demand response strategies improves the overall system efficiency and stability. The results proved that the hybrid method provides valuable insights for optimizing energy management systems. [ABSTRACT FROM AUTHOR]

In this paper, we address the challenge of creating candidate sets for large-scale Traveling Salesman Problem (TSP) instances, where choosing a subset of edges is crucial for efficiency. Traditional methods for improving tours, such as local searches and heuristics, depend greatly on the quality of these candidate sets but often struggle in large-scale situations due to insufficient edge coverage or high time complexity. We present a new heuristic based on fuzzy clustering, designed to produce high-quality candidate sets with nearly linear time complexity. Thoroughly tested on benchmark instances, including VLSI and Euclidean types with up to 316,000 nodes, our method consistently outperforms traditional and current leading techniques for large TSPs. Our heuristic's tours encompass nearly all edges of optimal or best-known solutions, and its candidate sets are significantly smaller than those produced with the POPMUSIC heuristic. This results in faster execution of subsequent improvement methods, such as Helsgaun's Lin–Kernighan heuristic and evolutionary algorithms. This substantial enhancement in computation time and solution quality establishes our method as a promising approach for effectively solving large-scale TSP instances. [ABSTRACT FROM AUTHOR]

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

Although Cyber–Physical Systems (CPSs) provide a flexible architecture for enterprises to deal with changing demand, an effective method to organize and allocate resources while considering sustainability factors is required to meet customers' order requirements and mitigate negative impacts on the environment. The planning of processes to achieve sustainable CPSs becomes an important issue to meet demand timely in a dynamic environment. The problem with planning processes in sustainable CPSs is the determination of the configuration of workflows/resources to compose processes with desirable properties, taking into account time and energy consumption factors. The planning problem in sustainable CPSs can be formulated as an integer programming problem with constraints, and this poses a challenge due to computational complexity. Furthermore, the ever-shrinking life cycle of technologies leads to frequent changes in processes and makes the planning of processes a challenging task. To plan processes in a changing environment, an effective planning method must be developed to automate the planning task. To tackle computational complexity, evolutionary computation approaches such as bio-inspired computing and metaheuristics have been adopted extensively in solving complex optimization problems. This paper aims to propose a solution methodology and an effective evolutionary algorithm with a local search mechanism to support the planning of processes in sustainable CPSs based on an auction mechanism. To achieve this goal, we focus on developing a self-adaptive neighborhood search-based Differential Evolution method. An effective planning method should be robust in terms of performance with respect to algorithmic parameters. We assess the performance and robustness of this approach by performing experiments for several cases. By comparing the results of these experiments, it shows that the proposed method outperforms several other algorithms in the literature. To illustrate the robustness of the proposed self-adaptive algorithm, experiments with different settings of algorithmic parameters were conducted. The results show that the proposed self-adaptive algorithm is robust with respect to algorithmic parameters. [ABSTRACT FROM AUTHOR]

This paper introduces an evolutionary algorithm for objective functions defined over clouds of points of varying sizes. Such design variables are modeled as uniform discrete measures with finite support and the crossover and mutation operators of the algorithm are defined using the Wasserstein barycenter. We prove that the Wasserstein-based crossover has a contracting property in the sense that the support of the generated measure is included in the closed convex hull of the union of the two parents' supports. We introduce boundary mutations to counteract this contraction. Variants of evolutionary operators based on Wasserstein barycenters are studied. We compare the resulting algorithm to a more classical, sequence-based, evolutionary algorithm on a family of test functions that include a wind-farm layout problem. The results show that Wasserstein-based evolutionary operators better capture the underlying geometrical structures of the considered test functions and outperform a reference evolutionary algorithm in the vast majority of the cases. The tests indicate that the mutation operators play a major part in the performances of the algorithms. [ABSTRACT FROM AUTHOR]

Numerous surrogate-assisted evolutionary algorithms have been proposed for expensive optimization problems. However, each surrogate model has its own characteristics and different applicable situations, which caused a serious challenge for model selection. To alleviate this challenge, this paper proposes an adaptive surrogate-assisted particle swarm optimization (ASAPSO) algorithm by effectively combining global and local surrogate models, which utilizes the uncertainty level of the current population state to evaluate the approximation ability of the surrogate model in its predictions. In ASAPSO, the transformation between local and global surrogate models is controlled by an adaptive Gaussian distribution parameter with a gauge of the advisability to improve the search process with better local exploration and diversity in uncertain solutions. Four expensive optimization benchmark functions and an airfoil aerodynamic real-world engineering optimization problem are utilized to validate the effectiveness and performance of ASAPSO. Experimental results demonstrate that ASAPSO has superiority in terms of solution accuracy compared with state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Traditional path planning algorithms typically focus only on path length, which fails to meet the low energy consumption requirements for wall-climbing robots in bridge inspection. This paper proposes an improved sparrow search algorithm based on logistic–tent chaotic mapping and differential evolution, aimed at addressing the issue of the sparrow search algorithm's tendency to fall into local optima, thereby optimizing path planning for bridge inspection. First, the initial population is optimized using logistic–tent chaotic mapping and refracted opposition-based learning, with dynamic adjustments to the population size during the iterative process. Second, improvements are made to the position updating formulas of both discoverers and followers. Finally, the differential evolution algorithm is introduced to enhance the global search capability of the algorithm, thereby reducing the robot's energy consumption. Benchmark function tests verify that the proposed algorithm exhibits superior optimization capabilities. Further path planning simulation experiments demonstrate the algorithm's effectiveness, with the planned paths not only consuming less energy but also exhibiting shorter path lengths, fewer turns, and smaller steering angles. [ABSTRACT FROM AUTHOR]

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

The study of the flexible job shop scheduling problem (FJSP) is of great importance in the context of green manufacturing. In this paper, with the optimization objectives of minimizing the maximum completion time and the total machine energy consumption, an improved multi-objective evolutionary algorithm with decomposition (MOEA/D) based on reinforcement learning is proposed. Firstly, three initialization strategies are used to generate the initial population in a certain ratio, and four variable neighborhood search strategies are combined to increase the local search capability of the algorithm. Second, a parameter adaptation strategy based on Q-learning is proposed to guide the population to select the optimal parameters to increase diversity. Finally, the performance of the proposed algorithm is analyzed and evaluated by comparing Q-MOEA/D with IMOEA/D and NSGA-II through different sizes of Kacem and BRdata benchmark cases and production examples of automotive engine cooling system manufacturing. The results show that the Q-MOEA/D algorithm outperforms the other two algorithms in solving the energy-efficient scheduling problem for flexible job shops. [ABSTRACT FROM AUTHOR]

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

This paper proposes a parameter coordination optimization design of a power system stabilizer (PSS) based on an improved quasi-affine transformation evolutionary (QUATRE) algorithm to suppress low-frequency oscillation and improve the dynamic stability of power systems. To begin, the simulated annealing (SA) algorithm randomly updates the globally optimal solution of each QUATRE iteration and matches the inferior solution with a certain probability to escape the local extreme point. This new algorithm is first applied to the power system. Since the damping ratio is one of the criteria with which to measure the dynamic stability of the power system, this paper sets the objective function according to the principle of maximization of the damping coefficient of the electromechanical mode, and uses SA-QUATRE to search a group of global optimal PSS parameter combinations to improve the safety factor of the system as much as possible. Finally, the method's rationality and validity were validated by applying it to the simulation examples of the IEEE 4-machine 2-area system with different operation states. The comparison with the traditional optimization algorithm shows that the proposed method has more advantages for multi-machine PSS parameter coordination optimization, can restrain the low-frequency oscillation of the power system more effectively and can enhance the system's stability. [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]

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]

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]

This manuscript explores the problem of deploying sensors in networks to detect intrusions as effectively as possible. In water distribution networks, intrusions can cause a spread of contaminants over the whole network; we are searching for locations for where to install sensors in order to detect intrusion contaminations as early as possible. Monitoring epidemics can also be modelled into this framework. Given a network of interactions between people, we want to identify which "small" set of people to monitor in order to enable early outbreak detection. In the domain of the Web, bloggers publish posts and refer to other bloggers using hyperlinks. Sensors are a set of blogs that catch links to most of the stories that propagate over the blogosphere. In the sensor placement problem, we have to manage a trade-off between different objectives. To solve the resulting multi-objective optimization problem, we use a multi-objective evolutionary algorithm based on the Tchebycheff scalarization (MOEA/D). The key contribution of this paper is to interpret the weight vectors in the scalarization as probability measures. This allows us to use the Wasserstein distance to drive their selection instead of the Euclidean distance. This approach results not only in a new algorithm (MOEA/D/W) with better computational results than standard MOEA/D but also in a new design approach that can be generalized to other evolutionary algorithms. [ABSTRACT FROM AUTHOR]

Neuronal models have remained an important area of research in computer science. The dendritic neuron model (DNM) is a novel neuronal model in recent years. Previous studies have focused on training DNM using more appropriate algorithms. This paper proposes an improvement to DNM based on the activity of excitation and proposes three new models. Each of the three improved models are designed to mimic the excitation and inhibition activity of neurons. The improved model proposed in this paper is shown to be effective in the experimental part. All three models and original DNM have their own strengths, so it can be considered that the new model proposed in this paper well enriches the diversity of neuronal models and contributes to future research on networks models. [ABSTRACT FROM AUTHOR]

Network robustness is of paramount importance. Although great progress has been achieved in robustness optimization using single measures, such networks may still be vulnerable to many attack scenarios. Consequently, multi-objective network robustness optimization has recently garnered greater attention. A complex network structure plays an important role in both node-based and link-based attacks. In this paper, since multi-objective robustness optimization comes with a high computational cost, a surrogate model is adopted instead of network controllability robustness in the optimization process, and the Dempster–Shafer theory is used for selecting and mixing the surrogate models. The method has been validated on four types of synthetic networks, and the results show that the two selected surrogate models can effectively assist the multi-objective evolutionary algorithm in finding network structures with improved controllability robustness. The adaptive updating of surrogate models during the optimization process leads to better results than the selection of two surrogate models, albeit at the cost of longer processing times. Furthermore, the method demonstrated in this paper achieved better performance than existing methods, resulting in a marked increase in computational efficiency. [ABSTRACT FROM AUTHOR]

To involve more key EMO researchers in the decision-making of future EMO conference events, Eckart, Lothar and I decided to form an EMO Steering Committee with a total of seven members, which has been recently extended to have 11 members. On a different note, EMO researchers should also find ways to utilize EC and EMO algorithms for enhancing ML's performance to make EMO an integral part of the current ML revolution. I began to combine EMO and MCDM methods, a process which resulted in reference-point-based NSGA-II, reference-direction-based NSGA-II, light-beam-search-based EMO, progressively interactive EMO, and others which also combined EMO with MCDM methods to find a single preferred Pareto-optimal solution at the end. [Extracted from the article]

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

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]

The number of real-time dynamic satellite observation missions has been rapidly increasing recently, while little attention has been paid to the dynamic mission-scheduling problem. It is crucial to reduce perturbations to the initial scheduling plan for the dynamic mission-scheduling as the perturbations have a significant impact on the stability of the Earth observation satellites (EOSs). In this paper, we focus on the EOS dynamic mission-scheduling problem, where the observation profit and perturbation are considered simultaneously. A multi-objective dynamic mission-scheduling mathematical model is first formulated. Then, we propose a multi-objective dynamic mission-scheduling algorithm (MODMSA) based on the improved Strength Pareto Evolutionary Algorithm (SPEA2). In the MODMSA, a novel two-stage individual representation, a minimum perturbation random initialization, multi-point crossover, and greedy mutation are designed to expand the search scope and improve the search efficiency. In addition, a profit-oriented local search algorithm is introduced into the SPEA2 to improve the convergence speed. Furthermore, an adaptive perturbation control strategy is adopted to improve the diversity of non−dominated solutions. Extensive experiments are conducted to evaluate the performance of the MODMSA. The simulation results show that the MODMSA outperforms other comparison algorithms in terms of solution quality and diversity, which demonstrates that the MODMSA is promising for practical EOS systems. [ABSTRACT FROM AUTHOR]

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

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]

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]

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]

Human beings have created numerous laws, sayings and proverbs that still influence behaviors and decision-making processes of people. Some of the laws, sayings or proverbs are used by people to understand the phenomena that may take place in daily life. For example, Murphy's law states that "Anything that can go wrong will go wrong." Murphy's law is helpful for project planning with analysis and the consideration of risk. Similar to Murphy's law, the old saying "Two heads are better than one" also influences the determination of the ways for people to get jobs done effectively. Although the old saying "Two heads are better than one" has been extensively discussed in different contexts, there is a lack of studies about whether this saying is valid and can be applied in evolutionary computation. Evolutionary computation is an important optimization approach in artificial intelligence. In this paper, we attempt to study the validity of this saying in the context of evolutionary computation approach to the decision making of ridesharing systems with trust constraints. We study the validity of the saying "Two heads are better than one" by developing a series of self-adaptive evolutionary algorithms for solving the optimization problem of ridesharing systems with trust constraints based on the saying, conducting several series of experiments and comparing the effectiveness of these self-adaptive evolutionary algorithms. The new finding is that the old saying "Two heads are better than one" is valid in most cases and hence can be applied to facilitate the development of effective self-adaptive evolutionary algorithms. Our new finding paves the way for developing a better evolutionary computation approach for ridesharing recommendation systems based on sayings created by human beings or human intelligence. [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]

In real-world applications, feature selection is crucial for enhancing the performance of data science and machine learning models. Typically, feature selection is a complex combinatorial optimization problem and a multi-objective optimization problem. Its primary goals are to reduce the dimensionality of the dataset and enhance the performance of machine learning algorithms. The selection of features in high-dimensional datasets is challenging due to the intricate relationships between features, which pose significant challenges to the performance and computational efficiency of algorithms. This paper introduces a Knowledge-Guided Competitive Co-Evolutionary Algorithm (KCCEA) for feature selection, especially for high-dimensional features. In the proposed algorithm, we make improvements to the foundational dominance-based multi-objective evolutionary algorithm in two aspects. First, the use of feature correlation as knowledge to guide evolution enhances the search speed and quality of traditional multi-objective evolutionary algorithm solutions. Second, a dynamically allocated competitive–cooperative evolutionary mechanism is proposed, integrating the improved knowledge-guided evolution with traditional evolutionary algorithms, further enhancing the search efficiency and diversity of solutions. Through rigorous empirical testing on various datasets, the KCCEA demonstrates superior performance compared to basic multi-objective evolutionary algorithms, providing effective solutions to multi-objective feature selection problems while enhancing the interpretability and effectiveness of prediction models. [ABSTRACT FROM AUTHOR]

This paper addresses the parameter identification of a one-link flexible manipulator based on the experimental measurement of the inputs/outputs, the finite element model, and the application of evolutionary algorithms. A novel approach is proposed to find the values of inertia, stiffness, and damping parameters by minimizing the difference between the numerical model's outputs and the testbed's outputs, thus considering the joint position and acceleration of the link's tip. The dynamic model is initially obtained using the finite element method and the Lagrange principle. A prototype of a single one-link flexible manipulator is used in the experimental application, wherein the servomotor applies the input torque, and the outputs are the joint angle and the link's tip acceleration. Then, an optimization problem minimizes the difference between the numerical and experimental outputs to determine the set of parameters using evolutionary algorithms. A comparative analysis to obtain the identified parameters is established using genetic algorithms, particle swarm optimization, and differential evolution. The proposed identification approach permitted the determination of the dynamic parameters based on the complete dynamic model of the flexible-link manipulator, which is different from the approaches reported in the literature that identify a simplified model. This information is essential for the design of the motion and vibration control laws. [ABSTRACT FROM AUTHOR]

Friction is an inherent nonlinear disturbance that can lead to creeping, jitter, and decreased tracking precision in an electro-hydraulic servo system. In this paper, the LuGre friction model is used to describe the dynamic and static characteristics of the friction force of a servo system comprehensively. Accurate identification of model parameters is key to implementing friction compensation. However, traditional genetic identification algorithms have the shortcomings of a premature solution, slow convergence, and poor accuracy. To address these shortcomings, this paper proposes an improved adaptive genetic identification algorithm. The proposed algorithm selects evolutionary processes adaptively according to the population concentration in the initial stage of population evolution. Moreover, it adjusts the crossover probability and the mutation probability to identify a local optimum accurately and converge to the global optimum rapidly. During the late stage of population evolution, the accuracy of the global optimal solution can be improved by reducing the search range of identification parameters. The simulation results show that the relative error of the model parameter values identified by the proposed algorithm is reduced to less than 1% and the convergence speed is faster. Compared with the existing traditional genetic algorithm and adaptive genetic algorithm, the overall performance of the proposed method is better. This study provides a feasible and highly accurate identification method for parameter identification of friction models used in electro-hydraulic servo systems. [ABSTRACT FROM AUTHOR]