Search

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]

The train stowage planning problem (TSPP) of the steel industry aims to select steel coils and allocate them to trains cost-effectively. It is a key component in the transportation of steel products. This study focuses on a multiobjective train stowage planning problem (MoTSPP) that maximises both the loading efficiency of the crane and the loading rate of the train. The MoTSPP also considers operation constraints related to steel coils, train wagons, and stowage modes in real-life railway transportation. An integer programming model is established to mathematically describe this problem. To obtain an efficient solution, a multiobjective analytical evolutionary algorithm (MAEA) that combines evolutionary algorithm (EA) with machine learning (ML) is presented. The EA part is a multiobjective differential evolution that introduces guided evolution and parameter adaptation to produce promising individuals and parameters, respectively. ML part adopts clustering algorithm and surrogate model to accelerate the search. Extensive comparisons and insight analyses are conducted from various perspectives to demonstrate the effectiveness and efficiency of the MAEA for solving the MoTSPP. [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]

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]

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

The efficiency of material supply for workstations using Automatic Guided Vehicles (AGVs) is largely determined by the performance of the AGV dispatching scheme. This paper proposes a new solution approach for the AGV dispatching problem (AGVDP) for material replenishment in a general manufacturing workshop where workstations are in a matrix layout, and where uncertainty in replenishment time of workstations and stochastic unloading efficiencies of AGVs are dynamic contextual factors. We first extend the literature proposing a mixed integer optimisation model with a delivery satisfaction soft constraint of material orders and two objectives: transportation costs and delivery time deviation. We then develop a new knowledge-guided estimation of distribution algorithm with delivery satisfaction evaluation for solving the model. Our algorithm fuses three knowledge-guided strategies to enhance optimisation capabilities at its respective execution stages. Comprehensive numerical experiments with instances built from a real-world scenario validate the proposed model and algorithm. Results demonstrate that the new algorithm outperforms three popular multi-objective evolutionary algorithms, a discrete version of a recent multi-objective particle swarm optimisation, and a multi-objective estimation of distribution algorithm. Findings of this work provide major implications for workshop management and algorithm design. [ABSTRACT FROM AUTHOR]

Disassembly recovers the valuable parts/subassemblies or materials from old and outdated products. The collected old and outdated products have inherent variability in quality, which frequently results in task failure. In disassembly line balancing literature, the authors have handled task failure situations using a predictive-reactive approach which relaxes the cycle time constraint. This relaxation disturbs the paced setting of the disassembly line, which chokes or blocks the workflow in downstream stations. In this manuscript, a station crashing-based recursive solution approach is proposed and a mathematical model is presented to address the task failure problem without relaxing the cycle time constraint. The aim of the proposed approach is to maximise the profit of the disassembly line and minimise the number of workstations required for accommodating all corrective actions. The proposed algorithm is demonstrated with the help of a case study of a toy car. Numerical experiments are performed on the proposed recursive solution framework to (i) test its compatibility with other evolutionary algorithms; (ii) compare its performance with the predictive-reactive approach; and (iii) validate the use of a probability-based station crashing scheme. The results indicate that the proposed approach can consistently produce a significantly better solution (19–28.5% improvement) than the PR approach. [ABSTRACT FROM AUTHOR]

Due to ease of dissemination, humankind is facing an "infodemic" that has spread through electronic and social media. Therefore, there is a need to combat fake news using text classification techniques. However, textual data contains a lot of redundant useless features which can cause issues during the learning and classification phase. Therefore, an effective feature selection method is required to select the important features only. Filter-based methods exist in the literature for feature selection but their performance is average at best. Similarly, many wrapper-based methods also exist but very few are specialized for textual features. In this study, a meta-heuristic based filter-wrapper approach to feature selection is proposed for fake news classification. The proposed algorithm combines three filter-based measures with Binary Dragonfly Algorithm. Moreover, a mechanism for dynamically adjusting the exploratory and exploitative behavior of the said algorithm is also proposed. The hybrid model is evaluated on three datasets of fake news. Additionally, it is also evaluated on the task of sentiment analysis of news. Both binary and multi-class classification tasks were used in our experiments. The proposed algorithm has been compared with several state-of-the-art wrapper-based and filter-based feature selection methods. For fake news detection, Macro F-1 Scores of 0.897, 0.782 and 0.667 were achieved on the three datasets. Moreover, for multi-class sentiment analysis task, Macro F-1 Scores of 0.553 and 0.597 were achieved. [ABSTRACT FROM AUTHOR]

Since the advent of computational analysis and visualization of chemical compounds, Computer-Aided Drug Design has made significant contributions to drug discovery. Recently, de novo drug design and molecular optimization have garnered considerable attention. Traditional optimization methods often struggle with the discrete nature of molecular space, but evolutionary computations have demonstrated their versatility across various optimization problems, regardless of the nature of the objective functions. This paper introduces a novel evolutionary algorithm, the Swarm Intelligence-Based Method for Single-Objective Molecular Optimization. Several experiments were conducted to showcase the efficiency of the proposed method, which identifies near-optimal solutions in a remarkably short time. The results were then compared with those of other state-of-the-art methods in the field. [ABSTRACT FROM AUTHOR]

Quantum architecture search (QAS) involves optimizing both the quantum parametric circuit configuration but also its parameters for a variational quantum algorithm. Thus, the problem is known to be multi-level as the performance of a given architecture is unknown until its parameters are tuned using classical routines. Moreover, the task becomes even more complicated since well-known trainability issues, e.g., barren plateaus (BPs), can occur. In this paper, we aim to achieve two improvements in QAS: (1) to reduce the number of measurements by an online surrogate model of the evaluation process that aggressively discards architectures of poor performance; (2) to avoid training the circuits when BPs are present. To detect the presence of the BPs, we employed a recently developed metric, information content, which only requires measuring the energy values of a small set of parameters to estimate the magnitude of cost function's gradient. The main idea of this proposal is to leverage a recently developed metric which can be used to detect the onset of vanishing gradients to ensure the overall search avoids such unfavorable regions. We experimentally validate our proposal for the variational quantum eigensolver and showcase that our algorithm is able to find solutions that have been previously proposed in the literature for the Hamiltonians; but also to outperform the state of the art when initializing the method from the set of architectures proposed in the literature. The results suggest that the proposed methodology could be used in environments where it is desired to improve the trainability of known architectures while maintaining good performance. [ABSTRACT FROM AUTHOR]

Background: The transition from explanative modeling of fitted data to the predictive modeling of unseen data for systems biology endeavors necessitates the effective recovery of reaction parameters. Yet, the relative efficacy of optimization algorithms in doing so remains under-studied, as to the specific reaction kinetics and the effect of measurement noises. To this end, we simulate the reactions of an artificial pathway using 4 kinetic formulations: generalized mass action (GMA), Michaelis–Menten, linear-logarithmic, and convenience kinetics. We then compare the effectiveness of 5 evolutionary algorithms (CMAES, DE, SRES, ISRES, G3PCX) for objective function optimization in kinetic parameter hyperspace to determine the corresponding estimated parameters. Results: We quickly dropped the DE algorithm due to its poor performance. Baring measurement noise, we find the CMAES algorithm to only require a fraction of the computational cost incurred by other EAs for both GMA and linear-logarithmic kinetics yet performing as well by other criteria. However, with increasing noise, SRES and ISRES perform more reliably for GMA kinetics, but at considerably higher computational cost. Conversely, G3PCX is among the most efficacious for estimating Michaelis–Menten parameters regardless of noise, while achieving numerous folds saving in computational cost. Cost aside, we find SRES to be versatilely applicable across GMA, Michaelis–Menten, and linear-logarithmic kinetics, with good resilience to noise. Nonetheless, we could not identify the parameters of convenience kinetics using any algorithm. Conclusions: Altogether, we identify a protocol for predicting reaction parameters under marked measurement noise, as a step towards predictive modeling for systems biology endeavors. [ABSTRACT FROM AUTHOR]

Aiming at the multi-objective vehicle path planning problem with time windows (VRPTW), a Spark-based parallel Adaptive Large Neighborhood Search algorithm (Spark-ALNS) is proposed to solve it. The main design of the 4-point strategy: (1) Design a new simulated annealing algorithm cooling strategy to achieve a better jump out of the local optimal solution. (2) Adopt CW initialization to accelerate the convergence speed. (3) Use three destruction operators and three repair operators to implement local path optimization. (4) A new parallel strategy is proposed to improve the algorithm's accuracy and reduce the running time. To illustrate the algorithm's effectiveness, the arithmetic example in Solomon is used as an example. The experimental results show that the proposed Spark-ALNS can find better solutions, get the known optimal solutions for 41 out of 56 instances, and find new optimal solutions for 31 algorithms, which outperforms other evolutionary algorithms. The runtime is 3–5 times better than other parallel algorithms and is able to solve VRPTW effectively. [ABSTRACT FROM AUTHOR]

The atmosphere is one of the game elements that can significantly influence player's emotions. However, creating an immersive atmosphere that effectively influences player emotions poses several challenges, necessitating the utilization of various elements, such as audio-visual coordination and gameplay design. This paper introduces a general framework for procedurally generating dungeons with joyful and horror atmospheres in games, providing an abstract perspective to address these challenges. The proposed framework introduces a categorization system for game elements based on their role within the game. Leveraging this categorization, the Comprehensive Arrangement of Game Elements (CAGE) pattern is introduced, which facilitates the appropriate placement of elements within the dungeon environment. Subsequently, the General Framework for Generating Dungeons with Atmosphere (GFGDA) is employed to procedurally create the dungeon using the Feasible–Infeasible Two-Population (FI-2Pop) algorithm. To enhance gameplay experience, similar elements in the dungeon environment that impact gameplay are grouped and their coordination is evaluated by creating a graph based on the CAGE pattern. The transition and coordination of audio-visual elements along the path between these impactful elements are assessed in order to generate an immersive atmosphere within the dungeon. To ensure diversity, examining the variety of dungeons generated over 100 runs demonstrates that our method consistently produces distinct results in each iteration. Moreover, two comparative studies were conducted, one with 51 volunteers and another with 10 volunteers. In the first study, the Game Experience Questionnaire (GEQ) was utilized to assess the emotional impact of dungeons generated by our method. These were compared to dungeons created using a uniform random approach, alongside relevant research. The results suggest that our method significantly influences player emotions across the four components of the GEQ—sensory and imaginary immersion, flow, negative effects, and challenge—when compared to dungeons generated by the uniform random approach and another researched method. In another study, the emotional impact of two dungeons, one generated with joyful elements and the other with eerie elements, was evaluated using the GEQ. The findings indicate significant differences between the two components of the GEQ—tension and positive effects—when players interacted with the level containing joyful elements compared to the one with eerie elements. [ABSTRACT FROM AUTHOR]

Energy-efficient building design is often challenged by multiple optimization problems due to contradictory objectives that are often hard to balance, so an effective optimization method should be thoroughly considered. Accordingly, a multi-objective evolutionary algorithm is then proposed. Firstly, the multi-agent auxiliary objective evolutionary algorithm for building energy efficiency model is established. According to model result analysis, the proposed algorithm runs fastest for 1640s with the average running time of 1710s in a single-room building, comparing to the least running time of 1680s for the multi-objective particle swarm optimization algorithm. In multi-room buildings, the proposed algorithm runs from 3350s to 3650s, with the average running time of 3500s. In conclusion, the model proposed in this study can comprehensively consider multiple objectives such as energy consumption, cost, comfort, etc. No matter in single-room or multi-room buildings, the model demonstrates superior performance and stability to realize comprehensive optimization of energy conservation design. [ABSTRACT FROM AUTHOR]

Generating uniform design tables (UDTs) is the first step to experimenting efficiently and effectively, and is also one of the most critical steps. Thus, the construction of uniform design tables has received much attention over the past decades. This paper presents a new algorithm for constructing uniform design tables: restart discrete dynamical evolutionary algorithm (RDDE). This algorithm is based on a well-designed dynamical evolutionary algorithm and utilizes discrete rounding technology to convert continuous variables into discrete variables. Considering the optimization of UDT is a multi-objective optimization problem, RDDE uses Friedman rank to select the optimal solution with better comprehensive comparison ranking. RDDE also utilizes a simulated annealing-based restart technology to select control parameters, thereby increasing the algorithm's ability to jump out of local optima. Comparisons with state-of-the-art UDTs and two practical engineering examples are presented to verify the uniformity of the design table constructed by RDDE. Numerical results indicate that RDDE can indeed construct UDTs with excellent uniformity at different levels, factors, and runs. Especially, RDDE can flexibly construct UDTs with unequal intervals of factors that cannot be directly processed by other designs of experiment. [ABSTRACT FROM AUTHOR]

Traditional portfolio construction primarily revolves around a bi-objective approach, focusing on minimizing portfolio variance while maximizing expected returns. However, this approach leaves out other objectives that could interest decision makers. In this work, we incorporate an extra objective, namely the environmental, social, and governance index (ESG), as a secondary objective. This addition empowers investors to customize their portfolios by defining explicit trade-off thresholds between expected returns and risk, considering the ESG index. To achieve this goal, we make use of external archiving techniques and evolutionary algorithms. In particular, we first find approximate solutions to the bi-objective problem; then, we look for efficient solutions for ESG. We tested our approach with data on the Dow Jones, S&P500, and Nasdaq100 from Yahoo Finance. The results show that the proposed methodology can identify portfolios with good returns and risks considering ESG. [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]

Plant breeding is a complex endeavor that is almost always multi-objective in nature. In recent years, stochastic breeding simulations have been used by breeders to assess the merits of alternative breeding strategies and assist in decision-making. In addition to simulations, visualization of a Pareto frontier for multiple competing breeding objectives can assist breeders in decision-making. This paper introduces Python Breeding Optimizer and Simulator (PyBrOpS), a Python package capable of performing multi-objective optimization of breeding objectives and stochastic simulations of breeding pipelines. PyBrOpS is unique among other simulation platforms in that it can perform multi-objective optimizations and incorporate these results into breeding simulations. PyBrOpS is built to be highly modular and has a script-based philosophy, making it highly extensible and customizable. In this paper, we describe some of the main features of PyBrOpS and demonstrate its ability to map Pareto frontiers for breeding possibilities and perform multi-objective selection in a simulated breeding pipeline. [ABSTRACT FROM AUTHOR]

The optimization of imaging reconnaissance constellation is of great significance for reconnaissance timeliness. At present, evolutionary algorithms based on Pareto are often used in the optimization of reconnaissance constellation. In order to solve the problems of insufficient selection pressure and poor diversity of such algorithms in the optimization of reconnaissance constellation whose objective function dimension is greater than three, the improved particle swarm optimization algorithm based on relative entropy of fuzzy sets(IFREM-PSO) is proposed. The algorithm improves the adaptive inertial weight strategy and enhances the convergence speed and accuracy. The introduction of variation strategy is conducive to jumping out of the local optimal solution. Improve external archive maintenance policy to enhance diversity. Based on the design and optimization of regional target-oriented visible light reconnaissance constellation, MOPSO, FREM-PSO and the IFREM-PSO are used to optimize the reconnaissance constellation. The experimental results show that the algorithm based on fuzzy relative entropy has a better performance in this problem, and compared with FREM-PSO algorithm, IFREM-PSO algorithm has a significant improvement in convergence speed, and a better performance in convergence effect and diversity. [ABSTRACT FROM AUTHOR]

Random forest is a classic black-box model that is widely used in various fields. The structural characteristics of black-box models lead to weak model interpretability, which can be optimized with the help of interpretable techniques to promote the application and development of random forest in scenarios with high reliability requirements. This paper constructed a rule extraction model based on ensemble pruning and multi-objective evolutionary algorithm. Ensemble pruning is an effective method for solving the problem of extracting rules from tree models that tend to fall into local optima, and multi-objective evolutionary has several applications in balancing rule accuracy and interpretability. This paper found that it improved interpretability without sacrificing accuracy. This study integrated ensemble pruning technique with a multi-objective evolutionary algorithm, which enhances the interpretability of random forests and helps promote the decision-making application of this model in areas with high interpretability requirements. [ABSTRACT FROM AUTHOR]

The limited ensemble sizes and the neglected model errors in ensemble-based Data Assimilation (DA) usually lead to underestimation of the error variance, and covariance inflation ‘inflates’ the covariance of a forecast or analysis ensemble by some positive factor in each assimilation cycle. In practice, the value of the inflation factor is often set by trial and error. Thus, a variety of adaptive covariance inflation (ACI) algorithms have been proposed to improve assimilation performance by adjusting the optimal parameters. Most of these used traditional optimization algorithms, such as gradient methods and relaxation methods. However, Evolutionary Algorithms(EAs), which encompass a range of population-based stochastic search techniques widely used in various engineering optimization problems, are rarely seen in DA. In this study, we developed a new framework for adaptive inflation factors, introducing differential evolution (DE) algorithm into local ensemble Transform Kalman filter (LETKF) that can explore the most suitable/optimal inflation factors online. A ‘micro-DE’ based data assimilation method can obtain better assimilation results step by step without taking a much longer time. The feasibility and effectiveness of the algorithm is demonstrated in an idealized Lorenz-96 model with simulated observations. Under both perfect and imperfect-model scenarios, it is found that the ‘micro-DE’LETKF method is capable of outperforming the original LETKF with a considerable lower computational cost. The adaptive inflation factor is optimally updated at each assimilation cycle either around the upper bound or around the lower bound, which means that only an adaptive factor helps mitigate the ensemble collapse due to a lack of spread. However, the further study will consider the application of the methodology to more complex atmospheric models. [ABSTRACT FROM AUTHOR]

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

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

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

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

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

Edge bundling is a technique used to improve the readability of large graph drawings by grouping edges to reduce visual complexity. This paper treats this task as a clustering problem, using compatibility metrics to evaluate solutions in an optimization pipeline combined with a clustering ensemble approach. The aim is to present the Clustering Ensemble-based Edge Bundling (CEBEB) method for solving the General-based Edge Bundling (GBEB) problem and report results for some given graphs. The CEBEB method proved very promising and generated better solutions than an existing evolutionary algorithm. Additionally, the paper introduces a new ensemble algorithm, specific for the GBEB, and reviews some previous results. [ABSTRACT FROM AUTHOR]

In many industrial real-world environments, scheduling necessitates continual reactive adjustments due to unpredictable perturbations, leading to the dynamic transformation of predefined static schedules. In this paper, we introduce a new framework named a two-level evolutionary algorithm (2LEA) as a comprehensive approach for addressing the dynamic flexible job shop scheduling problem. The 2LEA is based on a bi-level optimization design, where the upper level is dedicated to solving the general flexible job shop scheduling problem, and the lower level is used as a new evolutionary operator guided by a probability rate in the upper level, focusing on the optimization of operation sequences. This framework is capable of handling four dynamic events job insertion, job cancellation, machine breakdown, and job replacement using a predictive-reactive rescheduling strategy. By addressing the previously unexplored dynamic event of job replacement, this paper fills a significant gap in the literature and opens avenues for further research. Extensive computational experiments conducted on well-known benchmark instances from the Brandimarte and Hurink datasets demonstrate the effectiveness and efficiency of our proposed scheduling algorithm. Our results showcase the superior performance of 2LEA over state-of-the-art approaches in terms of solution quality, affirming its potential as a leading solution for both static and dynamic scheduling challenges. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The pursuit of studying the quadratic minimum spanning tree (QMST) problem has captivated numerous academics because of its distinctive characteristic of taking into account the cost of interaction between pairs of edges. A QMST refers to the minimum spanning tree, which is a graph that is both acyclic and minimally connected. It also includes the interaction cost between a pair of edges in the minimum spanning tree. These interaction costs can occur between any pair of edges, whether they are adjacent or non-adjacent. In the QMST problem, our objective is to minimize both the cost of the edges and the cost of interactions. This eventually classifies the task as NP-hard. The interaction costs, sometimes referred to as quadratic costs, inherently exhibit a contradictory relationship with linear edge costs when solving a multi-objective problem that aims to minimize both linear and quadratic costs simultaneously. This study addresses the bi-objective adjacent only quadratic minimum spanning tree problem (AQMSTP) by incorporating the uncertain nature of the linear and quadratic costs associated with the problem. The focus is on the interaction costs between adjacent edges. Consequently, we have introduced a multi-objective problem called the uncertain adjacent only quadratic minimum spanning tree problem (mUAQMSTP) and formulated it using the uncertain chance-constrained programming technique. Afterwards, two MOEAs—non-dominated sorting genetic algorithm II (NSGAII) and duplicate elimination non-dominated sorting evolutionary algorithm (DENSEA)—and the traditional multi-objective solution approach, the global criterion method, are employed to solve the deterministic transformation of the model. Finally, we provide a suitable numerical illustration to substantiate our suggested framework. [ABSTRACT FROM AUTHOR]

Featured Application: This work contributes to different industrial sectors through a computer tool that optimizes the layout of a robotic cell, which allows reducing both production times and energy consumption, mainly. The design of the work area of a robotic cell is currently an iterative process of trial and improvement, where, in the best cases, the user places the workstations and robotic manipulators in a 3D virtual environment to then semi-automatically verify variables such as the robot's reach, cycle time, geometric interferences, and collisions. This article suggests using an evolutionary computation algorithm (genetic algorithm) as a tool to solve this optimization problem. Using information about the work areas and the robot's reach, the algorithm generates an equipment configuration that minimizes the cell area without interference between the stations and, therefore, reduces the distances the robotic manipulator must travel. The objective is to obtain an optimized layout of the workstations and to validate this optimization by comparing the transfer times between stations with the actual times of an existing screwdriving cell. As a result, the transfer time was reduced by 9%. It is concluded that the algorithm can optimize the layout of a robotic cell, which can lead to significant improvements in efficiency, quality, and flexibility. [ABSTRACT FROM AUTHOR]

With the continuous increase in the number of in-orbit satellites and the explosive growth in the demand for observation targets, satellite resource allocation and mission scheduling are faced with the problems of declining benefits and stagnant algorithm performance. This work proposes a progressive optimization mechanism and population size adaptive strategy for an improved differential evolution algorithm (POM-PSASIDEA) in large-scale multi-satellite imaging mission planning to address the above challenges. (1) MSIMPLTS based on Multi-layer Objective Optimization is constructed, and the MSIMPLTS is processed hierarchically by setting up three sub-models (superstructure, mesostructure, and understructure) to achieve a diversity of resource selection and step-by-step refinement of optimization objectives to improve the task benefits. (2) Construct the progressive optimization mechanism, which contains the allocation optimization, time window optimization, and global optimization phases, to reduce task conflicts through the progressive decision-making of the task planning scheme in stages. (3) A population size adaptive strategy for an improved differential evolution algorithm is proposed to dynamically adjust the population size according to the evolution of the population to avoid the algorithm falling into the local optimum. The experimental results show that POM-PSASIDEA has outstanding advantages over other algorithms, such as high task benefits and a high task allocation rate when solved in a shorter time. [ABSTRACT FROM AUTHOR]

This research paper presents a comprehensive investigation into the effectiveness of the DeepSurNet-NSGA II (Deep Surrogate Model-Assisted Non-dominated Sorting Genetic Algorithm II) for solving complex multiobjective optimization problems, with a particular focus on robotic leg-linkage design. The study introduces an innovative approach that integrates deep learning-based surrogate models with the robust Non-dominated Sorting Genetic Algorithm II, aiming to enhance the efficiency and precision of the optimization process. Through a series of empirical experiments and algorithmic analyses, the paper demonstrates a high degree of correlation between solutions generated by the DeepSurNet-NSGA II and those obtained from direct experimental methods, underscoring the algorithm’s capability to accurately approximate the Pareto-optimal frontier while significantly reducing computational demands. The methodology encompasses a detailed exploration of the algorithm’s configuration, the experimental setup, and the criteria for performance evaluation, ensuring the reproducibility of results and facilitating future advancements in the field. The findings of this study not only confirm the practical applicability and theoretical soundness of the DeepSurNet-NSGA II in navigating the intricacies of multi-objective optimization but also highlight its potential as a transformative tool in engineering and design optimization. By bridging the gap between complex optimization challenges and achievable solutions, this research contributes valuable insights into the optimization domain, offering a promising direction for future inquiries and technological innovations. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) path planning aims to find the optimal flight path from the start point to the destination point for each aerial vehicle. With the rapid development of UAV technology, UAVs are required to tackle missions in increasingly complex environments. Consequently, UAV path planning encounters more challenges, causing traditional deterministic algorithms to struggle to find the optimal path within a certain time. Evolutionary computation (EC) is a series of nature-inspired methodologies and algorithms, which have shown effectiveness and efficiency in solving many complex optimization problems in real-world applications. Recently, EC algorithms have been effectively applied in UAV path planning and have shown encouraging performance in obtaining high-quality solutions. Therefore, it is crucial to review the related research experience and literature in the field of using EC for UAV path planning. This paper presents a comprehensive survey to showcase the existing studies on EC in UAV path planning, especially in complex environments. The paper first proposes a novel taxonomy to categorize the relevant studies into three different categories according to the complex environmental properties of the application scenarios. These environmental properties include complex search space, complex time control, and complex optimization objectives. Then, the EC algorithms for UAV path planning in these complex environments are further systematically surveyed as constrained search space and large-scale search space in complex search space, dynamic UAV path planning and multi-UAV concurrent path planning in complex time control, and expensive objective and multiple objectives in complex optimization objectives. Finally, some potential future research directions for applying EC algorithms to UAV path planning are presented and discussed. [ABSTRACT FROM AUTHOR]

Sparse large-scale multiobjective problems (LSMOPs) are characterized as an NP-hard issue that undergoes a significant presence of zero-valued variables in Pareto optimal solutions. In solving sparse LSMOPs, recent studies typically employ a specialized two-layer encoding, where the low-level layer undertakes the optimization of zero variables and the high-level layer is in charge of non-zero variables. However, such an encoding usually puts the low-level layer in the first place and thus cannot achieve a balance between optimizing zero and non-zero variables. To this end, this paper proposes to build a two-way association between the two layers using a mutual preference calculation method and a two-way matching strategy. Essentially, the two-way association balances the influence of two layers on the encoded individual by relaxing the control of the low-level layer and enhancing the control of the high-level layer, thus reaching the balance between the optimizations of zero and non-zero variables. Moreover, we propose a new evolutionary algorithm equipped with the modules and compare it with several state-of-the-art algorithms on 32 benchmark problems. Extensive experiments verify its effectiveness, as the proposed modules can improve the two-layer encoding and help the algorithm achieve superior performance on sparse LSMOPs. [ABSTRACT FROM AUTHOR]

The primary objective of multi-objective evolutionary algorithms (MOEAs) is to find a set of evenly distributed nondominated solutions that approximate the Pareto front (PF) of a multi-objective optimization problem (MOP) or a many-objective optimization problem (MaOP). This implies that the approximated solution set obtained by MOEAs should be as close to PF as possible while remaining diverse, adhering to criteria of convergence and diversity. However, existing MOEAs exhibit an imbalance between achieving convergence and maintaining diversity in the objective space. As far as the diversity criterion is concerned, it is still a challenge to achieve an evenly distributed approximation set with different sizes for a problem with a complicated PF shape. Furthermore, Pareto dominance has its own weaknesses as the selection criterion in evolutionary multiobjective optimization. Algorithms based on Pareto criterion (PC) can suffer from problems such as slow convergence to the optimal front and inferior performance on problems with many objectives. To effectively address these challenges, we propose a multi-objective bean optimization algorithm (MOBOA). Given that the selection of parent species, representing global optimal solutions, directly influences the convergence and diversity of the algorithm, MOBOA incorporates a preference order equilibrium parent species selection strategy (POEPSS). By extending the Pareto criterion with the preference order optimization criterion, the algorithm effectively enhances parent species selection pressure across multiple objectives. To balance convergence and diversity, MOBOA proposes a multi-population global search strategy explicitly maintaining an external archive during the search process. Leveraging the inherent multi-population advantages of bean optimization algorithm (BOA), the algorithm facilitates information sharing among the main population, auxiliary populations, and historical archive solution sets. Additionally, a diversity enhancement strategy is employed in the environmental selection stage, introducing the environmental selection strategy of the SPEA2 algorithm to generate a set of evenly distributed nondominated solutions. Experimental results on a series of widely used MOPs and MaOPs demonstrate that the proposed algorithm exhibits higher effectiveness and competitiveness compared to state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Although the multiobjective evolutionary algorithms (MOEAs) have been proved to bring promising prospects for solving multiobjective optimization problems (MOPs), the performance of the algorithm deteriorates sharply in high-dimensional objective space due to the weak selection pressure and the unregulated balance, which is caused by the increase of objective space dimension. Some current MOEAs with two-stage strategy (TS) strive to address above issues by dividing the evolutionary process into two independent stages, in which convergence and diversity are handled separately within successive generations of different stages. However, TS-MOEAs have some weaknesses, such as sensitivity to stage division, and incomplete separation of convergence and diversity. In this paper, TS/KW-MaOEA is proposed for solving many-objective optimization problems (MaOPs), which keeps TS as the central and equips a perfect control mechanism for separated balance. More specifically, TS/KW-MaOEA can automatically adjust the balance trend and provide appropriate selection pressure for MaOPs according to the Kondratiev wave (KW) search model and the objective space dimension. To verify the effectiveness of the proposed algorithm, a series of experiments are carried out against seven state-of-the-art many-objective optimization algorithms on 15 benchmark problems with up to 30 objectives. Experimental results indicate that the proposed algorithm is highly competitive against peer competitors. [ABSTRACT FROM AUTHOR]

Many engineering problems are essentially expensive multi-/many-objective optimization problems, and surrogate-assisted evolutionary algorithms have gained widespread attention in dealing with them. As the objective dimension increases, the error of predicting solutions based on surrogate models accumulates. Existing algorithms do not have strong selection pressure in the candidate solution obtaining and adaptive sampling stages. These make the effectiveness and area of application of the algorithms unsatisfactory. Therefore, this paper proposes a two-risk archive algorithm, which contains a strategy for mining high-risk and low-risk archives and a four-state adaptive sampling criterion. In the candidate solution mining stage, two types of Kriging models are trained, then conservative optimization models and non-conservative optimization models are constructed for model searching, followed by archive selection to obtain more reliable two-risk archives. In the adaptive sampling stage, in order to improve the performance of the algorithms, the proposed criterion considers environmental assessment, demand assessment, and sampling, where the sampling approach involves the improvement of the comprehensive performance in reliable environments, convergence and diversity in controversial environments, and surrogate model uncertainty. Experimental results on numerous benchmark problems show that the proposed algorithm is far superior to seven state-of-the-art algorithms in terms of comprehensive performance. [ABSTRACT FROM AUTHOR]

Many surrogate-assisted evolutionary algorithms (SAEAs) have been shown excellent search performance in solving expensive constrained optimization problems (ECOPs) with continuous variables, but few of them focus on ECOPs with mixed-integer variables (ECOPs-MI). Hence, a population state-driven surrogate-assisted differential evolution algorithm (PSSADE) is proposed for solving ECOPs-MI, in which the adaptive population update mechanism (APUM) and the collaborative framework of global and local surrogate-assisted search (CFGLS) are combined effectively. In CFGLS, a probability-driven mixed-integer mutation (PMIU) is incorporated into the classical global DE/rand/2 and local DE/best/2 for improving the diversity and potentials of candidate solutions, respectively, and the collaborative framework further integrates both the superiority of global and local mutation for the purpose of achieving a good balance between exploration and exploitation. Moreover, the current population is adaptively reselected based on the efficient non-dominated sorting technique in APUM when the population distribution is too dense. Empirical studies on 10 benchmark problems and 2 numerical engineering cases demonstrate that the PSSADE shows a more competitive performance than the existing state-of-the-art algorithms. More importantly, PSSADE provides excellent performance in the design of infrared stealth material film. [ABSTRACT FROM AUTHOR]

Offering Product-Service Systems (PSS) becomes an established strategy for companies to increase the provided customer value and ensure their competitiveness. Designing PSS business models, however, remains a major challenge. One reason for this is the fact that PSS business models are characterized by a long-term nature. Decisions made in the development phase must take into account possible scenarios in the operational phase. Risks must already be anticipated in this phase and mitigated with appropriate measures. Another reason for the design phase being a major challenge is the size of the solution space for a possible business model. Developers are faced with a multitude of possible business models and have the challenge of selecting the best one. In this article, a simheuristic optimization approach is developed to test and evaluate PSS business models in the design phase in order to select the best business model configuration beforehand. For optimization, a proprietary evolutionary algorithm is developed and tested. The results validate the suitability of the approach for the design phase and the quality of the algorithm for achieving good results. This could even be transferred to already established PSS. [ABSTRACT FROM AUTHOR]

This study challenges a long-standing and often uncontested assertion in the forestry discourse that maximizing financial returns always requires ecologically simplified stands. We developed a high-resolution simulation tool for northern hardwood stands in eastern North America and integrated advanced numerical optimization methods to model the tree-level harvest decisions that maximize financial returns. We modeled each individual tree's growth and its probability of natural mortality, conditioned on the evolving neighborhood-scale competitive environment it resides in. We developed size-, species-, and grade-specific price functions to assign potential harvest revenue values to each discrete bole section of each standing tree, and we used an evolutionary search algorithm to specify the financially optimal timing of tree-by-tree removals. We modeled three different case studies, representing a broad range of northern hardwood stand conditions, including a hypothetical 50-year-old, even-aged stand and two inventoried stands in northern New York, USA, with contrasting management histories. We observed consistent results across all three cases: maximizing financial returns from northern hardwood forests requires silvicultural finesse and results in ecologically complicated stands. [ABSTRACT FROM AUTHOR]

With the development of the digital economy, the power demand for data centers (DCs) is rising rapidly, which presents a challenge to the economic and low‐carbon operation of the future distribution system. To this end, this paper fully considers the multiple flexibility of DC and its impact on the active distribution network, and establishes a collaborative planning model of DC and active distribution network. Differing from most existing studies that apply robust optimization or stochastic optimization for uncertainty characterization, this study employs a novel interval optimization approach to capture the inherent uncertainties within the system (including the renewable energy source (RES) generation, electricity price, electrical loads, emissions factor and workloads). Subsequently, the planning model is reformulated as the interval multi‐objective optimization problem (IMOP) to minimize economic cost and carbon emission. On this basis, instead of using a conventional deterministic‐conversion approach, an interval multi‐objective optimization evolutionary algorithm based on decomposition (IMOEA/D) is proposed to solve the proposed IMOP, which is able to fully preserve the uncertainty inherent in interval‐typed information and allow to obtain an interval‐formed Pareto front for risk‐averse decision‐making. Finally, an IEEE 33‐node active distribution network is utilized for simulation and analysis to confirm the efficacy of the proposed approach. [ABSTRACT FROM AUTHOR]

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

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

Well placement optimization is one of the most important means to control the decline of oilfields and improve the recovery rate in the development process of deep and heterogeneous reservoirs, such as deep buried carbonate oil reservoirs. However, the mapping relationship from deployed well positions to actual profits is non-linear and multi-modal. At the same time, the injection and production relationship of new wells also affects the contribution of well positions to final profits. Currently, common algorithms include gradient-based and heuristic non-gradient algorithms, which have advantages, but face problems of high computational complexity, slow optimization speed, and difficulty in convergence. We propose an evolutionary algorithm for well placement optimization in carbonate reservoirs. This algorithm improves well placement optimization and computational speed by constraining the sampling process to effective sampling spaces, integrating prior knowledge to enhance sampling efficiency, strengthening local optima exploration, and utilizing parallel computing. Additionally, it refines the optimized variable content based on actual control factors, enhancing the algorithm's robustness in practical applications. A case study from a carbonate reservoir in northwestern China demonstrated that this algorithm not only improved the performance by 50% compared to the classic DE algorithm but also achieved 15% higher optimization effectiveness than the current state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

The realization of a metasurface cloak for the simultaneous invisibility of multiple sources presents a long‐standing scientific challenge. Ideally, for the establishment of a simultaneous multisource invisibility cloak, the metasurface must provide a wide phase coverage and angular stability in a single architecture, especially for broadband, wide‐angle, and even omnidirectional scenarios. However, achieving this goal has proven to be elusive thus far. Current approaches for implementing metasurface‐based invisibility cloak involve both active and passive metasurface. These approaches often rely on phase‐compensation mechanisms, which inevitably encounter issues related to limited incidence angles or narrow working bands. Here, a novel paradigm of synchronization metasurface optimized through an evolution‐optimization strategy, enabling the realization of simultaneous multisource invisibility cloaking, is proposed. The underlying physics of the synchronization metasurface relies on an evolution‐optimization strategy (an evolutionary game algorithm), which is used to get rid of the entanglement between incident directions, frequencies, and metasurface phase gradients. Consequently, the synchronization metasurface is capable of manipulating simultaneous incoming waves at any angle over a wide range (cloak). In experimental validation, the synchronization metasurface demonstrates an impressive capability to cloak both single and simultaneous double sources in any direction, highly resembling background fields. [ABSTRACT FROM AUTHOR]

The research work on optimization has witnessed significant growth in the past few years, particularly within multi- and single-objective optimization algorithm areas. This study provides a comprehensive overview and critical evaluation of a wide range of optimization algorithms from conventional methods to innovative metaheuristic techniques. The methods used for analysis include bibliometric analysis, keyword analysis, and content analysis, focusing on studies from the period 2000–2023. Databases such as IEEE Xplore, SpringerLink, and ScienceDirect were extensively utilized. Our analysis reveals that while traditional algorithms like evolutionary optimization (EO) and particle swarm optimization (PSO) remain popular, newer methods like the fitness-dependent optimizer (FDO) and learner performance-based behavior (LPBB) are gaining attraction due to their adaptability and efficiency. The main conclusion emphasizes the importance of algorithmic diversity, benchmarking standards, and performance evaluation metrics, highlighting future research paths including the exploration of hybrid algorithms, use of domain-specific knowledge, and addressing scalability issues in multi-objective optimization. [ABSTRACT FROM AUTHOR]

Parallel optimization enables faster and more efficient problem-solving by reducing computational resource consumption and time. By simultaneously combining multiple methods, such as evolutionary algorithms and swarm-based optimization, effective exploration of the search space and achievement of optimal solutions in shorter time frames are realized. In this study, a combination of termination criteria is proposed, utilizing three different criteria to end the algorithmic process. These criteria include measuring the difference between optimal values in successive iterations, calculating the mean value of the cost function in each iteration, and the so-called "DoubleBox" criterion, which is based on the relative variance of the best value of the objective cost function over a specific number of iterations. The problem is addressed through the parallel execution of three different optimization methods (PSO, Differential Evolution, and Multistart). Each method operates independently on separate computational units with the goal of faster discovery of the optimal solution and more efficient use of computational resources. The optimal solution identified in each iteration is transferred to the other computational units. The proposed enhancements were tested on a series of well-known optimization problems from the relevant literature, demonstrating significant improvements in convergence speed and solution quality compared to traditional approaches. [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]

To address the symmetry-related resilience issues of stations and lines in urban rail transit networks, we propose a two-stage robust optimization-based approach for urban rail transit network planning. In this context, resilience is conceptualized as the ability of the network to maintain its operational symmetry under normal and disruptive conditions. Firstly, we used passenger flow distributions as decision variables to construct a two-stage symmetry-based urban rail transit network planning model, aiming to simultaneously minimize the total cost and total operating time of the network while preserving its functional symmetry. Secondly, we designed a hybrid evolutionary algorithm with chromosomes having a two-layer encoding structure, where the Niched Pareto Genetic Algorithm served as the main algorithmic framework, and a Large Neighborhood Search mechanism was designed to optimize the connectivity gene layer of individuals, ensuring the symmetry of network connectivity. Finally, we conducted computational verification on randomly generated instances to confirm the effectiveness of the model and algorithm. The experimental results demonstrated that our method could find two sets of Pareto optimal solutions for cost preference and time preference, thereby preserving the operational symmetry of the network under normal and damaged conditions, as well as reducing the total operating time. This effectively improved the overall efficiency and resilience of the network. Our designed hybrid evolutionary algorithm converged to satisfactory objective values in the early iterations, exhibiting strong search and optimization performance and effectively solving the two-stage symmetry-based urban rail transit network planning model. [ABSTRACT FROM AUTHOR]