Search

Recent research has revealed that subtle imperceptible perturbations can deceive well-trained neural network models, leading to inaccurate outcomes. These instances, known as adversarial examples, pose significant threats to the secure application of machine learning techniques in safety-critical systems. In this paper, we delve into the study of one-pixel attacks in deep neural networks, recently reported as a kind of adversarial examples. To identify such one-pixel attacks, most existing methodologies rely on the differential evolution method, which utilizes random selection from the current population to escape local optima. However, the differential evolution technique might waste search time and overlook good solutions if the number of iterations is insufficient. Hence, in this paper, we propose a gradient ascent with momentum approach to efficiently discover good solutions for the one-pixel attack problem. As our method takes a more direct route to the goal compared to existing methods relying on blind random walks, it can effectively identify one-pixel attacks. Our experiments conducted on popular CNNs demonstrate that, in comparison with existing methodologies, our technique can detect one-pixel attacks significantly faster. [ABSTRACT FROM AUTHOR]

In this work, we highlight three different techniques for automatically constructing the dataset for a time-series study: the direct multi-step, the recursive multi-step, and the direct–recursive hybrid scheme. The nonlinear autoregressive with exogenous variable support vector regression (NARX SVR) and the Gaussian process regression (GPR), combined with the differential evolution (DE) for parameter tuning, are the two novel hybrid methods used in this study. The hyper-parameter settings used in the GPR and SVR training processes as part of this optimization technique DE significantly affect how accurate the regression is. The accuracy in the prediction of DE/GPR and DE/SVR, with or without NARX, is examined in this article using data on spot gold prices from the New York Commodities Exchange (COMEX) that have been made publicly available. According to RMSE statistics, the numerical results obtained demonstrate that NARX DE/SVR achieved the best results. [ABSTRACT FROM AUTHOR]

The calibration of cameras plays a critical role in close-range photogrammetry because the precision of calibration has a direct effect on the quality of results. When handling image capture using a camera, traditional swarm intelligence algorithms such as genetic algorithms and particle swarm optimization, in conjunction with Zhang's calibration method, frequently face difficulties regarding local optima and sluggish convergence. This study presents an enhanced hybrid optimization approach utilizing both the principles of differential evolution and particle swarm optimization, which is then employed in the context of camera calibration. Initially, we establish a measurement model specific to the camera in close-range photogrammetry and determine its interior orientation parameters. Subsequently, employing these parameters as initial values, we perform global optimization and iteration using the improved hybrid optimization algorithm. The effectiveness of the proposed approach is subsequently validated through simulation and comparative experiments. Compared to alternative approaches, the proposed algorithm enhances both the accuracy of camera calibration and the convergence speed. It effectively addresses the issue of other algorithms getting trapped in local optima due to image distortion. These research findings provide theoretical support for practical engineering applications in the field of control theory and optimization to a certain extent. [ABSTRACT FROM AUTHOR]

Differential evolution is a popular heuristic black-box numerical optimization algorithm which is often used due to its simplicity and efficiency. Parameter adaptation is one of the main directions of study regarding the differential evolution algorithm. The main reason for this is that differential evolution is highly sensitive to the scaling factor and crossover rate parameters. In this study, a novel adaptation technique is proposed which uses the success rate to replace the popular success history-based adaptation for scaling factor tuning. In particular, the scaling factor is sampled with a Cauchy distribution, whose location parameter is set as an nth order root of the current success rate, i.e., the ratio of improved solutions to the current population size. The proposed technique is universal and can be applied to any differential evolution variant. Here it is tested with several state-of-the-art variants of differential evolution, and on two benchmark sets, CEC 2017 and CEC 2022. The performed experiments, which include modifications of algorithms developed by other authors, show that in many cases using the success rate to determine the scaling factor can be beneficial, especially with relatively small computational resource. [ABSTRACT FROM AUTHOR]

Distribution companies (DISCOs) aim to maximize their annual profits by performing the optimal planning of distributed generators (DGs) or energy storage systems (ESSs) in the deregulated electricity markets. Some previous studies have focused on the simultaneous planning of DGs and ESSs for DISCO profit maximization but have rarely considered the reactive powers of DGs and ESSs. In addition, the optimization methods used for solving this problem are either traditional or outdated, which may not yield superior results. To address these issues, this paper simultaneously performs the optimal planning of DGs and ESSs in distribution networks for DISCO profit maximization. The utilized model not only takes into account the revenues of trading active and reactive powers but also addresses the active and reactive powers of DGs and ESSs. To solve the optimization problem, a new hybrid evolutionary algorithm (EA) called the oppositional social engineering differential evolution with Lévy flights (OSEDE/LFs) is proposed. The OSEDE/LFs is applied to optimize the planning model using the 30-Bus and IEEE 69-Bus networks as test systems. The results of the two case studies are compared with several other EAs. The results confirm the significance of the planning model in achieving higher profits and demonstrate the effectiveness of the proposed approach when compared with other EAs. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) edge is an emerging technology of sensors and devices that communicate real-time data to a network. IoT edge computing was introduced to handle the latency concerns related to cloud computing data management, as the data are processed closer to their point of origin. Clustering and scheduling tasks on IoT edge computing are considered a challenging problem due to the diverse nature of task and resource characteristics. Metaheuristics and optimization methods are widely used in IoT edge task clustering and scheduling. This paper introduced a new task clustering and scheduling mechanism using differential evolution optimization on IoT edge computing. The proposed mechanism aims to optimize task clustering and scheduling to find optimal execution times for submitted tasks. The proposed mechanism for task clustering is based on the degree of similarity of task characteristics. The proposed mechanisms use an evolutionary mechanism to distribute system tasks across suitable IoT edge resources. The clustering tasks process categorizes tasks with similar requirements and then maps them to appropriate resources. To evaluate the proposed differential evolution mechanism for IoT edge task clustering and scheduling, this study conducted several simulation experiments against two established mechanisms: the Firefly Algorithm (FA) and Particle Swarm Optimization (PSO). The simulation configuration was carefully created to mimic real-world IoT edge computing settings to ensure the proposed mechanism's applicability and the simulation results' relevance. In the heavyweight workload scenario, the proposed DE mechanism started with an execution time of 916.61 milliseconds, compared to FA's 1092 milliseconds and PSO's 1026.09 milliseconds. By the 50th iteration, the proposed DE mechanism had reduced its execution time significantly to around 821.27 milliseconds, whereas FA and PSO showed lesser improvements, with FA at approximately 1053.06 milliseconds and PSO stabilizing at 956.12 milliseconds. The simulation results revealed that the proposed differential evolution mechanism for edge task clustering and scheduling outperforms FA and PSO regarding system efficiency and stability, significantly reducing execution time and having minimal variation across simulation iterations. [ABSTRACT FROM AUTHOR]

The determination is presented of seven parameters of a DC motor's drive. The determination was based on a comparison between the measured and simulated current and speed responses. For the parameters' determination, different evolutionary methods were used and compared to each other. The mathematical model presenting the DC drives model was written using two coupled differential equations, which were solved using the Runge–Kutta first-, second-, third- and fourth-order methods. The approach allows determining the parameters of controlled drives in such a way that the controller is taken into account with the measured voltage. Between the tested evolutionary methods, which were Differential Evolution with three strategies, Teaching-Learning Based Optimization and Artificial Bee Colony, the Differential Evolution (DE/rand/1/exp) can be suggested as the most appropriate for the presented problem. Measurements with different sampling times were used, and it was found out that at least some measuring points should be at the speed-up interval. Different lengths of the measured signal were tested, and it is sufficient to use a signal consisting of the drive's acceleration and a short part of the stationary operation. The analysis showed that the procedure has good repeatability. The biggest deviation of calculated parameters considering 10 repeated measurements was 6% in case of the La calculation. The deviations of all the other parameters' calculations were less than 2%. [ABSTRACT FROM AUTHOR]

Accurate load forecasting plays a crucial role in the effective energy management of smart cities. However, the smart cities' residents' load profile is nonlinear, having high volatility, uncertainty, and randomness. Forecasting such nonlinear profiles requires accurate and stable prediction models. On this note, a prediction model has been developed by combining feature preprocessing, a multilayer perceptron, and a genetic wind-driven optimization algorithm, namely FPP-MLP-GWDO. The developed hybrid model has three parts: (i) feature preprocessing (FPP), (ii) a multilayer perceptron (MLP), and (iii) a genetic wind-driven optimization (GWDO) algorithm. The MLP is the key part of the developed model, which uses a multivariate autoregressive algorithm and rectified linear unit (ReLU) for network training. The developed hybrid model known as FPP-MLP-GWDO is evaluated using Dayton Ohio grid load data regarding aspects of accuracy (the mean absolute percentage error (MAPE), Theil's inequality coefficient (TIC), and the correlation coefficient (CC)) and convergence speed (computational time (CT) and convergence rate (CR)). The findings endorsed the validity and applicability of the developed model compared to other literature models such as the feature selection–support vector machine–modified enhanced differential evolution (FS-SVM-mEDE) model, the feature selection–artificial neural network (FS-ANN) model, the support vector machine–differential evolution algorithm (SVM-DEA) model, and the autoregressive (AR) model regarding aspects of accuracy and convergence speed. The findings confirm that the developed FPP-MLP-GWDO model achieved an accuracy of 98.9%, thus surpassing benchmark models such as the FS-ANN (96.5%), FS-SVM-mEDE (97.9%), SVM-DEA (97.5%), and AR (95.7%). Furthermore, the FPP-MLP-GWDO significantly reduced the CT (299s) compared to the FS-SVM-mEDE (350s), SVM-DEA (240s), FS-ANN (159s), and AR (132s) models. [ABSTRACT FROM AUTHOR]

Recently, an increasing number of electromagnetic devices have been using smart fluids. These include ferrofluids, electrorheological fluids, and magnetorheological (MR) fluids. In the paper, magnetorheological fluids are considered for use in a spherical actuator for haptic applications. An approach is presented to the design and optimization of such a device, using finite element method modelling linked with differential evolution (DE). Much consideration was given to the construction of the objective function to be minimized. A novel approach to objective function assembly was used, using reference values based on the model design and created with parameters set to the midpoint values of the selected range. It was found to be a useful strategy when the reference values are unknown. There were four parameters to be optimized. Three of them gravitated towards the boundary value, and the fourth (actuator radius) was somewhere in between. The value of the objective function reached a minimum in the range of actuator radius between 42.9880 mm and 45.0831 mm, which is about a 5% difference in regard to the actuator radius. Three passes of optimization were performed with similar results, proving the robustness of the algorithm. [ABSTRACT FROM AUTHOR]

Aerodynamic shape optimization is frequently complicated and challenging due to the involvement of multiple objectives, large-scale decision variables, and expensive cost function evaluation. This paper presents a bilayer parallel hybrid algorithm framework coupling multi-objective local search and global evolution mechanism to improve the optimization efficiency and convergence accuracy in high-dimensional design space. Specifically, an efficient multi-objective hybrid algorithm (MOHA) and a gradient-based surrogate-assisted multi-objective hybrid algorithm (GS-MOHA) are developed under this framework. In MOHA, a novel multi-objective gradient operator is proposed to accelerate the exploration of the Pareto front, and it introduces new individuals to enhance the diversity of the population. Afterward, MOHA achieves a trade-off between exploitation and exploration by selecting elite individuals in the local search space during the evolutionary process. Furthermore, a surrogate-assisted hybrid algorithm based on the gradient-enhanced Kriging with the partial least squares(GEKPLS) approach is established to improve the engineering applicability of MOHA. The optimization results of benchmark functions demonstrate that MOHA is less constrained by dimensionality and can solve multi-objective optimization problems (MOPs) with up to 1000 decision variables. Compared to existing MOEAs, MOHA demonstrates notable enhancements in optimization efficiency and convergence accuracy, specifically achieving a remarkable 5–10 times increase in efficiency. In addition, the optimization efficiency of GS-MOHA is approximately five times that of MOEA/D-EGO and twice that of K-RVEA in the 30-dimensional test functions. Finally, the multi-objective optimization results of the airfoil shape design validate the effectiveness of the proposed algorithms and their potential for engineering applications. [ABSTRACT FROM AUTHOR]

The spherical evolution algorithm (SE) is a unique algorithm proposed in recent years and widely applied to new energy optimization problems with notable achievements. However, the existing improvements based on SE are deemed insufficient due to the challenges arising from the multiple choices of operators and the utilization of a spherical search method. In this paper, we introduce an enhancement method that incorporates weights in individuals' dimensions that are affected by individual fitness during the iteration process, aiming to improve SE by adaptively balancing the tradeoff between exploitation and exploration during convergence. This is achieved by reducing the randomness of dimension selection and enhancing the retention of historical information in the iterative process of the algorithm. This new SE improvement algorithm is named DWSE. To evaluate the effectiveness of DWSE, in this study, we apply it to the CEC2017 standard test set, the CEC2013 large-scale global optimization test set, and 22 real-world problems from CEC2011. The experimental results substantiate the effectiveness of DWSE in achieving improvement. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) has shown remarkable performance in solving continuous optimization problems. However, its optimization performance still encounters limitations when confronted with complex optimization problems with lots of local regions. To address this issue, this paper proposes a dual elite groups-guided mutation strategy called "DE/current-to-duelite/1" for DE. As a result, a novel DE variant called DEGGDE is developed. Instead of only using the elites in the current population to direct the evolution of all individuals, DEGGDE additionally maintains an archive to store the obsolete parent individuals and then assembles the elites in both the current population and the archive to guide the mutation of all individuals. In this way, the diversity of the guiding exemplars in the mutation is expectedly promoted. With the guidance of these diverse elites, a good balance between exploration of the complex search space and exploitation of the found promising regions is hopefully maintained in DEGGDE. As a result, DEGGDE expectedly achieves good optimization performance in solving complex optimization problems. A large number of experiments are conducted on the CEC'2017 benchmark set with three different dimension sizes to demonstrate the effectiveness of DEGGDE. Experimental results have confirmed that DEGGDE performs competitively with or even significantly better than eleven state-of-the-art and representative DE variants. [ABSTRACT FROM AUTHOR]

An edge-weighted consensus-based formation control strategy is presented for mobile robots. In the edge-weighted strategy, a desired formation pattern is achieved by adjusting gain weights related to the distance between robots. Moreover, the edge-weighted formation control exploits the properties of weighted graphs to allow the formation to rotate and adapt its shape to avoid collision among robots. However, formation patterns are commonly defined by biases with respect to the centroid of the consensus rather than gain weights. This work proposes to optimize the gain weights in edge-weighted graphs, given a formation pattern in terms of biases. A multi-strategy mutation differential evolution algorithm is introduced to solve the optimization problem. Simulation and real-world experiments are performed considering multi-robot systems composed of differential drive robots. Additionally, the experimental setup includes Turtlebot3® Waffle Pi robots and an OptiTrack® motion capture system for control purposes. The experimental results verify the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

This paper proposes an improved algorithm applied to path planning for the inspection of unmanned aerial vehicles (UAVs) in urban pipe corridors, which introduces a collaborative game between spherical vector particle swarm optimization (SPSO) and differential evolution (DE) algorithms. Firstly, a high-precision 3D grid map model of urban pipe corridors is constructed based on the actual urban situation. Secondly, the cost function is formulated, and the constraints for ensuring the safe and smooth inspection of UAVs are proposed to transform path planning into an optimization problem. Finally, a hybrid algorithm of SPSO and DE algorithms based on the Nash bargaining theory is proposed by introducing a cooperative game model for optimizing the cost function to plan the optimal path of UAV inspection in complex urban pipe corridors. To evaluate the performance of the proposed algorithm (GSPSODE), the SPSO, DE, genetic algorithm (GA), and ant colony optimization (ACO) are compared with GSPSODE, and the results show that GSPSODE is superior to other methods in UAV inspection path planning. However, the selection of algorithm parameters, the difference in the experimental environment, and the randomness of experimental results may affect the accuracy of experimental results. In addition, a high-precision urban pipe corridors scenario is constructed based on the RflySim platform to dynamically simulate the optimal path planning of UAV inspection in real urban pipe corridors. [ABSTRACT FROM AUTHOR]

Integrated process planning and scheduling (IPPS) is important for modern manufacturing companies to achieve manufacturing efficiency and improve resource utilization. Meanwhile, multiple objectives need to be considered in the realistic decision-making process for manufacturing systems. Based on the above realistic manufacturing system requirements, it becomes increasingly important to develop effective methods to deal with multi-objective IPPS problems. Therefore, an improved NSGA-II (INSGA-II) algorithm is proposed in this research, which uses the fast non-dominated ranking method for multiple optimization objectives as an assignment scheme for fitness. A multi-layer integrated coding method is adopted to address the characteristics of the integrated optimization model, which involves many optimization parameters and interactions. Elite and mutation strategies are employed during the evolutionary process to enhance population diversity and the quality of solutions. An external archive is also used to store and update the Pareto solution. The experimental results on the Kim test set demonstrate the effectiveness of the proposed INSGA-II algorithm. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) is one of the most popular and widely used optimizers among the community of evolutionary computation. Despite numerous works having been conducted on the improvement of DE performance, there are still some defects, such as premature convergence and stagnation. In order to alleviate them, this paper presents a novel DE variant by designing a new mutation operator (named "DE/current-to-pbest_id/1") and a new control parameter setting. In the new operator, the fitness value of the individual is adopted to determine the chosen scope of its guider among the population. Meanwhile, a group-based competitive control parameter setting is presented to ensure the various search potentials of the population and the adaptivity of the algorithm. In this setting, the whole population is randomly divided into multiple equivalent groups, the control parameters for each group are independently generated based on its location information, and the worst location information among all groups is competitively updated with the current successful parameters. Moreover, a piecewise population size reduction mechanism is further devised to enhance the exploration and exploitation of the algorithm at the early and later evolution stages, respectively. Differing from the previous DE versions, the proposed method adaptively adjusts the search capability of each individual, simultaneously utilizes multiple pieces of successful parameter information to generate the control parameters, and has different speeds to reduce the population size at different search stages. Then it could achieve the well trade-off of exploration and exploitation. Finally, the performance of the proposed algorithm is measured by comparing with five well-known DE variants and five typical non-DE algorithms on the IEEE CEC 2017 test suite. Numerical results show that the proposed method is a more promising optimizer. [ABSTRACT FROM AUTHOR]

Stock portfolio optimization is always an interesting and attractive research problem due to the variety of stock markets. To find a useful stock portfolio, metaheuristic-based approaches have been presented to obtain diverse group stock portfolios (DGSPs) by considering the diversity of stock portfolios in the past. However, in the existing DGSP algorithms, two problems remain to be solved. The first is how to set a suitable group size, and the second is that the evolution process is time-consuming. To solve these problems, in this paper, an approach using grouping genetic algorithms (GGAs) was proposed for optimizing a DGSP. For setting a suitable group size, the proposed approach utilized two attributes of group stocks, including the return on equity and the price/earnings ratio. Then, to derive better stock groups, a cluster validation factor was designed, which was used as part of a fitness function. To solve the time-consumption problem, using the designed temporary chromosome, the number of stock portfolios that need to be evaluated could be reduced in the proposed approach to speed up the evolution process. Finally, experiments on two real stock datasets containing 31 and 50 stocks were conducted to show that the proposed approach was effective and efficient. The results indicated that the proposed approach could not only achieve similar returns but also accelerate the evolution process when compared with the existing algorithms. [ABSTRACT FROM AUTHOR]

Complex systems provide an opportunity to analyze the essence of phenomena by studying their intricate connections. The networks formed by these connections, known as complex networks, embody the underlying principles governing the system's behavior. While complex networks have been previously applied in the field of evolutionary computation, prior studies have been limited in their ability to reach conclusive conclusions. Based on our investigations, we are against the notion that there is a direct link between the complex network structure of an algorithm and its performance, and we demonstrate this experimentally. In this paper, we address these limitations by analyzing the dynamic complex network structures of five algorithms across three different problems. By incorporating mathematical distributions utilized in prior research, we not only generate novel insights but also refine and challenge previous conclusions. Specifically, we introduce the biased Poisson distribution to describe the algorithm's exploration capability and the biased power-law distribution to represent its exploitation potential during the convergence process. Our aim is to redirect research on the interplay between complex networks and evolutionary computation towards dynamic network structures, elucidating the essence of exploitation and exploration in the black-box optimization process of evolutionary algorithms via dynamic complex networks. [ABSTRACT FROM AUTHOR]

In this study, parameter adaptation methods for differential evolution are automatically designed using a surrogate approach. In particular, Taylor series are applied to model the searched dependence between the algorithm's parameters and values, describing the current algorithm state. To find the best-performing adaptation technique, efficient global optimization, a surrogate-assisted optimization technique, is applied. Three parameters are considered: scaling factor, crossover rate and population decrease rate. The learning phase is performed on a set of benchmark problems from the CEC 2017 competition, and the resulting parameter adaptation heuristics are additionally tested on CEC 2022 and SOCO benchmark suites. The results show that the proposed approach is capable of finding efficient adaptation techniques given relatively small computational resources. [ABSTRACT FROM AUTHOR]

Recent advances in technology have led to a surge in interest in unmanned aerial vehicles (UAVs), which are remote-controlled aircraft that rely on cameras or sensors to gather information about their surroundings during flight. A UAV requires a path-planning technique that can swiftly recalculate a viable and quasi-optimal path in flight if a new obstacle or hazard is recognized or if the target is moved during the mission. In brief, the planning of UAV routes might optimize a specific problem determined by the application, such as the moving target problem (MTP), flight time and threats, or multiobjective navigation. The complexity of MTP ranges from NP-hard to NEXP-complete because there are so many probabilistic variables involved. Therefore, it is hard to detect a high-quality solution for this problem using traditional techniques such as differential calculus. Therefore, this paper hybridizes differential evolution (DE) with two newly proposed updating schemes to present a new evolution-based technique named hybrid differential evolution (HDE) for accurately tackling the MTP in a reasonable amount of time. Using Bayesian theory, the MTP can be transformed into an optimization problem by employing the target detection probability as the fitness function. The proposed HDE encodes the search trajectory as a sequence of UAV motion pathways that evolve with increasing the current iteration for finding the near-optimal solution, which could maximize this fitness function. The HDE is extensively compared to the classical DE and several rival optimizers in terms of several performance metrics across four different scenarios with varying degrees of difficulty. This comparison demonstrates the proposal's superiority in terms of the majority of used performance metrics. [ABSTRACT FROM AUTHOR]

Applied computing and artificial intelligence methods have been attracting growing interest in recent years due to their effectiveness in solving technical problems. Hao et al. [[14]] present an unsupervised fault diagnosis methodology to leverage the generated MPCs of different working conditions to diagnose the actual unlabeled MPCs. The paper by Ainapure et al. [[17]] proposes a new cross-domain fault diagnosis method with enhanced robustness. The paper by Saeed et al. [[1]] proposes an approach to building an AutoML data-dependent CNN model (DeepPCANet) customized for DR screening automatically. [Extracted from the article]

In recent times, numerous innovative and specialized algorithms have emerged to tackle two and three multi-objective types of problems. However, their effectiveness on many-objective challenges remains uncertain. This paper introduces a new Many-objective Sine–Cosine Algorithm (MaOSCA), which employs a reference point mechanism and information feedback principle to achieve efficient, effective, productive, and robust performance. The MaOSCA algorithm's capabilities are enhanced by incorporating multiple features that balance exploration and exploitation, direct the search towards promising areas, and prevent search stagnation. The MaOSCA's performance is evaluated against popular algorithms such as the Non-dominated sorting genetic algorithm-III (NSGA-III), the Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) integrated with Differential Evolution (MOEADDE), the Many-objective Particle Swarm Optimizer (MaOPSO), and the Many-objective JAYA Algorithm (MaOJAYA) across various test suites, including DTLZ1-DTLZ7 with 5, 9, and 15 objectives and car cab design, water resources management, car side impact, marine design, and 10-bar truss engineering design problems. The performance evaluation is carried out using various performance metrics. The MaOSCA demonstrates its ability to achieve well-converged and diversified solutions for most problems. The success of the MaOSCA can be attributed to the multiple features of the SCA optimizer integrated into the algorithm. [ABSTRACT FROM AUTHOR]

The deficiency number of one hand, i.e., the number of tiles needed to change in order to win, is an important factor in the game Mahjong, and plays a significant role in the development of artificial intelligence (AI) for Mahjong. However, it is often difficult to compute due to the large amount of possible combinations of tiles. In this paper, a novel discrete differential evolution (DE) algorithm is presented to calculate the deficiency number of the tiles. In detail, to decrease the difficulty of computing the deficiency number, some pretreatment mechanisms are first put forward to convert it into a simple combinatorial optimization problem with varying variables by changing its search space. Subsequently, by means of the superior framework of DE, a novel discrete DE algorithm is specially developed for the simplified problem through devising proper initialization, a mapping solution method, a repairing solution technique, a fitness evaluation approach, and mutation and crossover operations. Finally, several experiments are designed and conducted to evaluate the performance of the proposed algorithm by comparing it with the tree search algorithm and three other kinds of metaheuristic methods on a large number of various test cases. Experimental results indicate that the proposed algorithm is efficient and promising. [ABSTRACT FROM AUTHOR]

To reduce logistics scheduling costs and energy consumption, this paper studies the slab allocation and hot-rolling scheduling integrated optimization problem that arises in practical iron and steel enterprises. In this problem, slabs are first allocated to orders and then sent to heating furnaces for heating; then, they are sent to a hot-rolling mill for rolling. A 0–1 integer programming model is established to minimize the attribute difference in the allocation cost between slabs and orders, the switching cost of hot-rolling processing, and waiting times after slabs reach rolling mills. Given the problem's characteristics, an improved differential evolution algorithm using a real-number coding method is designed to solve it. Three different heuristic algorithms are proposed to improve the quality of solutions in the initial population. Multiple parent individuals participate in the mutation operation, which increases the population diversity and prevents the algorithm from falling into the local optimum prematurely. Experiments on 14 sets of real production data from a large domestic iron and steel plant show that our improved differential evolution algorithm generates significantly better solutions in a reasonable amount of time compared with CPLEX, the simulated artificial method, and the classical differential evolution algorithm, and it can be used by practitioners. [ABSTRACT FROM AUTHOR]

A limited feasible region restricts individuals from evolving optionally and makes it more difficult to solve constrained optimization problems. In order to overcome difficulties such as introducing initial feasible solutions, a novel algorithm called the successive approximation genetic algorithm (SAGA) is proposed; (a) the simple genetic algorithm (SGA) is the main frame; (b) a self-adaptive penalty function is considered and the penalty factor is adjusted automatically by the proportion of feasible and infeasible solutions; (c) a generation-by-generation approach and a three-stages evolution are introduced; and (d) dynamically enlarging and reducing the tolerance error of the constraint violation makes it much easier to generate initial feasible solutions. Then, ten benchmarks and an engineering problem were adopted to evaluate the SAGA in detail. It was compared with the improved dual-population genetic algorithm (IDPGA) and eight other algorithms, and the results show that SAGA finds the optimum in 5 s for an equality constraint and 1 s for an inequality constraint. The largest constraint violation can be accurate to at least three decimal fractions for most problems. SAGA obtains a better value, of 1.3398, than the eight other algorithms for the engineering problem. In conclusion, SAGA is very suitable for solving nonlinear optimization problems with a single constraint, accompanied by more accurate solutions, but it takes a longer time. In reality, SAGA searched for a better solution along the bound after several iterations and converged to an acceptable solution in early evolution. It is critical to improve the running speed of SAGA in the future. [ABSTRACT FROM AUTHOR]

Currently, digitalization and digital transformation are actively expanding into various areas of human activity, and researchers are identifying urgent problems and offering new solutions regarding digital environments in industry [[1]], economics [[3]], medicine [[5]], ecology [[7]], education [[9]], etc. Conclusions The purpose of this Special Issue was to attract high-quality new papers in the field of applied and computational mathematics for digital environments, offering original solutions to various problems that are relevant and in demand in various fields of human activity. 10.3390/math10224297 21 Demidova L.A. A Novel Approach to Decision-Making on Diagnosing Oncological Diseases Using Machine Learning Classifiers Based on Datasets Combining Known and/or New Generated Features of a Different Nature. I hope that these selected research papers are recognized as important and meaningful by the international scientific community and can form the basis for further research in the field of applied and computational mathematics for digital environments, solving complex problems in various disciplines and application areas. [Extracted from the article]

In the prediction of a nonlinear time series based on a leaky integrator echo state network (leaky-ESN), building a reservoir related to the specific problem is a key step. For problems such as poor performance of randomly generated reservoirs, it is tough to determine the parameter values of the reservoirs. The work in this paper uses the gravitational search algorithm (GSA) to optimize the global parameters of a leaky-ESN, such as the leaking rate, the spectral radius, and the input scaling factor. The basic GSA has some problems, such as slow convergence and poor balance between exploration and exploitation, and it cannot solve some complex optimization problems well. To solve these problems, an improved gravitational search algorithm (IGSA) is proposed in this paper. First, the best agent and elite agents were archived and utilized to accelerate the exploration phase and improve the convergence rate in the exploitation phase. Second, to improve the effect of the poor fitness agents on the optimization result, a differential mutation strategy was proposed, which generated new individuals to replace original agents with worse fitness, increasing the diversity of the population and improving the global optimization ability of the algorithm. Finally, two simulation experiments showed that the leaky-ESN optimized by the IGSA had better prediction accuracy. [ABSTRACT FROM AUTHOR]

The optimal power flow problem is one of the most widely used problems in power system optimizations, which are multi-modal, non-linear, and constrained optimization problems. Effective constrained optimization methods can be considered in tackling the optimal power flow problems. In this paper, an ϵ -constrained method-based adaptive differential evolution is proposed to solve the optimal power flow problems. The ϵ -constrained method is improved to tackle the constraints, and a p-best selection method based on the constraint violation is implemented in the adaptive differential evolution. The single and multi-objective optimal power flow problems on the IEEE 30-bus test system are used to verify the effectiveness of the proposed and improved ε adaptive differential evolution algorithm. The comparison between state-of-the-art algorithms illustrate the effectiveness of the proposed and improved ε adaptive differential evolution algorithm. The proposed algorithm demonstrates improvements in nine out of ten cases. [ABSTRACT FROM AUTHOR]

A gradient-based optimizer (GBO) is a recently inspired meta-heuristic technique centered on Newton's gradient-based approach. In this paper, an advanced developed version of the GBO is merged with a crossover operator (GBOC) to enhance the diversity of the created solutions. The merged crossover operator causes the solutions in the next generation to be more random. The proposed GBOC maintains the original Gradient Search Rule (GSR) and Local Escaping Operator (LEO). The GSR directs the search to potential areas and aids in its convergence to the optimal answer, while the LEO aids the searching process in avoiding local optima. The proposed GBOC technique is employed to optimally place and size the distribution static VAR compensator (D-SVC), one of the distribution flexible AC transmission devices (D-FACTS). It is developed to maximize the yearly energy savings via power losses concerning simultaneously different levels of the peak, average, and light loadings. Its relevance is tested on three distribution systems of IEEE 33, 69, and 118 nodes. Based on the proposed GBOC, the outputs of the D-SVCs are optimally varying with the loading level. Furthermore, their installed ratings are handled as an additional constraint relating to two compensation levels of 50% and 75% of the total reactive power load to reflect a financial installation limit. The simulation applications of the proposed GBOC declare great economic savings in yearly energy losses for the three distribution systems with increasing compensation levels and iterations compared to the initial case. In addition, the effectiveness of the proposed GBOC is demonstrated compared to several techniques, such as the original GBO, the salp swarm algorithm, the dwarf mongoose algorithm, differential evolution, and honey badger optimization. [ABSTRACT FROM AUTHOR]

In this paper, we study swarm intelligence computation for constrained optimization problems and propose a new hybrid PSO-DE algorithm based on feasibility rules. Establishing individual feasibility rules as a way to determine whether the position of an individual satisfies the constraint or violates the degree of the constraint, which will determine the choice of the individual optimal position and the global optimal position in the particle population. First, particle swarm optimization (PSO) is used to act on the top 50% of individuals with higher degree of constraint violation to update their velocity and position. Second, Differential Evolution (DE) is applied to act on the individual optimal position of each individual to form a new population. The current individual optimal position and the global optimal position are updated using the feasibility rules, thus forming a hybrid PSO-DE intelligent algorithm. Analyzing the convergence and complexity of PSO-DE. Finally, the performance of the PSO-DE algorithm is tested with 12 benchmark functions of constrained optimization and 57 engineering optimization problems, the numerical results show that the proposed algorithm has good accuracy, effectiveness and robustness. [ABSTRACT FROM AUTHOR]

Attaining highly secure and safe operation of the grid with acceptable voltage levels has become a difficult issue for electricity companies that must adopt remedial actions. The usage of a PV solar farm inverter as a static synchronous compensator (or PVSTATCOM device) throughout the night has recently been proposed as a way to enhance the system performance. In this article, the novel artificial rabbits' optimization algorithm (AROA) is developed for minimizing both the daily energy losses and the daily voltage profile considering different 24 h loadings. The novel AROA is inspired from the natural surviving strategies of rabbits. The novel AROA is tested on a typical IEEE 33-node distribution network including three scenarios. Different scenarios are implemented considering PV/STATCOM allocations throughout the day. The effectiveness of the proposed AROA is demonstrated in comparison to differential evolution (DE) algorithm and golden search optimization (GSO). The PVSTATCOM is adequately allocated based on the proposed AROA, where the energy losses are greatly reduced with 54.36% and the voltage deviations are greatly improved with 43.29%. Moreover, the proposed AROA provides no violations in all constraints while DE fails to achieve these limits. Therefore, the proposed AROA shows greater dependability than DE and GSO. Moreover, the voltage profiles at all distribution nodes all over the daytime hours are more than the minimum limit of 95%. [ABSTRACT FROM AUTHOR]

This paper introduces a numerical variable speed limit (VSL) control method on a motorway, modeled by the system of partial differential equations (PDEs) of a non- equilibrium continuum traffic model. The method consists of a macroscopic simulation (i.e., numerical solution of the system of PDEs of the continuum model), introduction of the solution-based cost function and numerical optimization with a differential evolution algorithm (DE). Due to the numerical solution scheme, the method enables application of a wide range of continuum traffic models without prior discretization of PDEs. In this way, the method overcomes the limitations of the basic continuum models and represents a step towards more accurate traffic modelling in control strategies. In this paper, we determine optimal variable speed limits with the DE algorithm on a motorway section modeled by the modified switching curve model, which is a non-equilibrium continuum model consistent with the three-phase traffic flow theory. The effectiveness of the determined variable speed limits is validated using microsimulations of the test section, which show promising reductions of queue lengths and number of stops. [ABSTRACT FROM AUTHOR]

Due to the unexpected breakdowns that can happen in various components of a production system, failure to reach production targets and interruptions in the process of production are not surprising. Since this issue remains for manufactured products, this halting results in the loss of profitability or demand. In this study, to address a number of challenges associated with the management of crucial spare parts inventory, a mathematical model is suggested for the determination of the optimal quantity of orders, in the case of an unpredicted supplier failure. Hence, a production system that has various types of equipment with crucial components is assumed, in which the crucial components are substituted with spare parts in the event of a breakdown. This study's inventory model was developed for crucial spare parts based on the Markov chain process model for the case of supplier disruption. Moreover, for optimum ordering policies, re-ordering points, and cost values of the system, four metaheuristic algorithms were utilized that include Grey Wolf Optimizer (GWO), Genetic Algorithm (GA), Moth–Flame Optimization (MFO) Algorithm, and Differential Evolution (DE) Algorithm. Based on the results, reliable suppliers cannot meet all of the demands; therefore, we should sometimes count on unreliable suppliers to reduce unmet demand. [ABSTRACT FROM AUTHOR]

In this article, the design of a fuzzy logic control system (FLCS) in combination with multi-objective optimization for diver's buoyancy control device (BCD) is presented. To either change or maintain the depth, the diver manually controls two pneumatic valves that are mounted on the inflatable diving jacket. This task can be very difficult, especially in specific diving circumstances such as poor visibility, safety stop procedures or critical life functions of the diver. The implemented BCD hardware automatically controls the diver's depth by inflating or deflating the diver's jacket with two electro-pneumatic valves. The FLCS in combination with the multi-objective optimization was used to minimize control error and simultaneously ensure minimal air supply consumption of the BCD. The diver's vertical velocity is also critical, especially while the diver is ascending during the decompression procedure; therefore, a combination of depth and vertical velocity control was configured as a cascaded controller setup with outer proportional depth and inner FLCS vertical velocity control loops. The optimization of the FLCS parameters was achieved with differential evolution global optimum search algorithm. The results obtained were compared with the optimized cascaded position and velocity PID controller in simulations. [ABSTRACT FROM AUTHOR]

This study proposes a dual-population algorithmic scheme for differential evolution and specific mutation strategy. The first population contains the newest individuals, and is continuously updated, whereas the other keeps the top individuals throughout the whole search process. The proposed mutation strategy combines information from both populations. The proposed L-NTADE algorithm (Linear population size reduction Newest and Top Adaptive Differential Evolution) follows the L-SHADE approach by utilizing its parameter adaptation scheme and linear population size reduction. The L-NTADE is tested on two benchmark sets, namely CEC 2017 and CEC 2022, and demonstrates highly competitive results compared to the state-of-the-art methods. The deeper analysis of the results shows that it displays different properties compared to known DE schemes. The simplicity of L-NTADE coupled with its high efficiency make it a promising approach. [ABSTRACT FROM AUTHOR]

Identifying parameters in photovoltaic (PV) cell and module models is one of the primary challenges of the simulation and design of photovoltaic systems. Metaheuristic algorithms can find near-optimal solutions within a reasonable time for such challenging real-world optimization problems. Control parameters must be adjusted with many existing algorithms, making them difficult to use. In real-world problems, many of these algorithms must be combined or hybridized, which results in more complex and time-consuming algorithms. This paper presents a new artificial parameter-less optimization algorithm (APLO) for parameter estimation of PV models. New mutation operators are designed in the proposed algorithm. APLO's exploitation phase is enhanced by each individual searching for the best solution in this updating operator. Moreover, the current best, the old best, and the individual's current position are utilized in the differential term of the mutation operator to assist the exploration phase and control the convergence speed. The algorithm uses a random step length based on a normal distribution to ensure population diversity. We present the results of a comparative study using APLO and well-known existing parameter-less meta-heuristic algorithms such as grey wolf optimization, the salp swarm algorithm, JAYA, teaching-learning based optimization, colliding body optimization, as well as three major parameter-based algorithms such as differential evolution, genetic algorithm, and particle swarm optimization to estimate the parameters of PV the modules. The results revealed that the proposed algorithm could provide excellent exploration–exploitation balance and consistency during the iterations. Furthermore, the APLO algorithm shows high reliability and accuracy in identifying the parameters of PV cell models. [ABSTRACT FROM AUTHOR]

The spherical search algorithm is an effective optimizer to solve bound-constrained non-linear global optimization problems. Nevertheless, it may fall into the local optima when handling combination optimization problems. This paper proposes an enhanced self-adapting spherical search algorithm with differential evolution (SSDE), which is characterized by an opposition-based learning strategy, a staged search mechanism, a non-linear self-adapting parameter, and a mutation-crossover approach. To demonstrate the outstanding performance of the SSDE, eight optimizers on the CEC2017 benchmark problems are compared. In addition, two practical constrained engineering problems (the welded beam design problem and the pressure vessel design problem) are solved by the SSDE. Experimental results show that the proposed algorithm is highly competitive compared with state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

The issue of how to improve the usability of data publishing under differential privacy has become one of the top questions in the field of machine learning privacy protection, and the key to solving this problem is to allocate a reasonable privacy protection budget. To solve this problem, we design a privacy budget allocation algorithm based on out-of-bag estimation in random forest. The algorithm firstly calculates the decision tree weights and feature weights by the out-of-bag data under differential privacy protection. Secondly, statistical methods are introduced to classify features into best feature set, pruned feature set, and removable feature set. Then, pruning is performed using the pruned feature set to avoid decision trees over-fitting when constructing an ϵ -differential privacy random forest. Finally, the privacy budget is allocated proportionally based on the decision tree weights and feature weights in the random forest. We conducted experimental comparisons with real data sets from Adult and Mushroom to demonstrate that this algorithm not only protects data security and privacy, but also improves model classification accuracy and data availability. [ABSTRACT FROM AUTHOR]

Modern computational mathematics and informatics for Digital Environments deal with the high dimensionality when designing and optimizing models for various real-world phenomena. Large-scale global black-box optimization (LSGO) is still a hard problem for search metaheuristics, including bio-inspired algorithms. Such optimization problems are usually extremely multi-modal, and require significant computing resources for discovering and converging to the global optimum. The majority of state-of-the-art LSGO algorithms are based on problem decomposition with the cooperative co-evolution (CC) approach, which divides the search space into a set of lower dimensional subspaces (or subcomponents), which are expected to be easier to explore independently by an optimization algorithm. The question of the choice of the decomposition method remains open, and an adaptive decomposition looks more promising. As we can see from the most recent LSGO competitions, winner-approaches are focused on modifying advanced DE algorithms through integrating them with local search techniques. In this study, an approach that combines multiple ideas from state-of-the-art algorithms and implements Coordination of Self-adaptive Cooperative Co-evolution algorithms with Local Search (COSACC-LS1) is proposed. The self-adaptation method tunes both the structure of the complete approach and the parameters of each algorithm in the cooperation. The performance of COSACC-LS1 has been investigated using the CEC LSGO 2013 benchmark and the experimental results has been compared with leading LSGO approaches. The main contribution of the study is a new self-adaptive approach that is preferable for solving hard real-world problems because it is not overfitted with the LSGO benchmark due to self-adaptation during the search process instead of a manual benchmark-specific fine-tuning. [ABSTRACT FROM AUTHOR]

Task scheduling is one of the most significant challenges in the cloud computing environment and has attracted the attention of various researchers over the last decades, in order to achieve cost-effective execution and improve resource utilization. The challenge of task scheduling is categorized as a nondeterministic polynomial time (NP)-hard problem, which cannot be tackled with the classical methods, due to their inability to find a near-optimal solution within a reasonable time. Therefore, metaheuristic algorithms have recently been employed to overcome this problem, but these algorithms still suffer from falling into a local minima and from a low convergence speed. Therefore, in this study, a new task scheduler, known as hybrid differential evolution (HDE), is presented as a solution to the challenge of task scheduling in the cloud computing environment. This scheduler is based on two proposed enhancements to the traditional differential evolution. The first improvement is based on improving the scaling factor, to include numerical values generated dynamically and based on the current iteration, in order to improve both the exploration and exploitation operators; the second improvement is intended to improve the exploitation operator of the classical DE, in order to achieve better results in fewer iterations. Multiple tests utilizing randomly generated datasets and the CloudSim simulator were conducted, to demonstrate the efficacy of HDE. In addition, HDE was compared to a variety of heuristic and metaheuristic algorithms, including the slime mold algorithm (SMA), equilibrium optimizer (EO), sine cosine algorithm (SCA), whale optimization algorithm (WOA), grey wolf optimizer (GWO), classical DE, first come first served (FCFS), round robin (RR) algorithm, and shortest job first (SJF) scheduler. During trials, makespan and total execution time values were acquired for various task sizes, ranging from 100 to 3000. Compared to the other metaheuristic and heuristic algorithms considered, the results of the studies indicated that HDE generated superior outcomes. Consequently, HDE was found to be the most efficient metaheuristic scheduling algorithm among the numerous methods researched. [ABSTRACT FROM AUTHOR]

Mobile robots are relevant dynamic systems in recent applications. Path planning is an essential task for these robots since it allows them to move from one location to another safely and at an affordable cost. Path planning has been studied extensively for static scenarios. However, when the scenarios are dynamic, research is limited due to the complexity and high cost of continuously re-planning the robot's movements to ensure its safety. This paper proposes a new, simple, reliable, and affordable method to plan safe and optimized paths for differential mobile robots in dynamic scenarios. The method is based on the online re-optimization of the static parameters in the state-of-the-art deterministic path planner Bug0. Due to the complexity of the dynamic path planning problem, a metaheuristic optimization approach is adopted. This approach utilizes metaheuristics from evolutionary computation and swarm intelligence to find the Bug0 parameters when the mobile robot is approaching an obstacle. The proposal is tested in simulation, and well-known metaheuristic methods are compared, including Differential Evolution (DE), the Genetic Algorithm (GA), and Particle Swarm Optimization (PSO). The dynamic planner based on PSO generates paths with the best performances. In addition, the results of the PSO-based planner are compared with different Bug0 configurations, and the former is shown to be significantly better. [ABSTRACT FROM AUTHOR]

In the context of the high dependency on fossil fuels, the strong efforts aiming to shift towards a more sustainable world are having significant economic and political impacts. The electricity market is now encouraging prosumers to consume their own production, and thus reduce grid exchanges. Self-consumption can be increased using storage systems or rescheduling the loads. This effort involves not only residential prosumers but also industrial ones. The rescheduling process is an optimisation problem that can be effectively solved with evolutionary algorithms (EAs). In this paper, a specific procedure for bridging demand-side management from the theoretical application to a practical industrial scenario was introduced. In particular, the toroidal correction was used in the differential evolution with the aim of preventing the local minima worsening the effectiveness of the proposed method. Moreover, to achieve reasonable solutions, two different cost contributions have been considered: the energy cost and the labour cost. The method was tested on real data from a historical textile factory, Ratti S.p.A. Due to the nature of the loads, the design variables were the starting time of the 30 shiftable loads. The application of this procedure achieves a reduction in the total cost of approximately 99,500 EUR/year. [ABSTRACT FROM AUTHOR]

Recently, interval-type 3 fuzzy systems have begun to appear in different research areas. This article outlines a methodology for the parameterization of interval type-3 membership functions using vertical cuts applied to the dynamic parameter adaptation of the differential evolution algorithm and implemented in an interval-type 3 Sugeno controller. This methodology was applied to the dynamic adaptation of the F (mutation) parameter in differential evolution to improve the performance of this method as the generations occur. To test the type-3 fuzzy differential evolution algorithm, the optimal design of a type-3 Sugeno controller was considered. In this case, the parameterization of the type-3 membership functions of this Sugeno fuzzy controller was performed. The experimentation is based on the application of three different noise levels for validation of the efficacy of the method and performing a comparison study with respect to other articles in the literature. The main idea is to implement the parameterization of interval type-3 membership functions to enhance the ability of differential evolution in designing an optimal interval type-3 system to control a unicycle mobile robot. [ABSTRACT FROM AUTHOR]

Studies have shown that illuminance and correlated colour temperature (CCT) are strongly correlated with body responses such as circadian rhythm, alertness, and mood. It is worth noting that these responses show a complex and variable coupling, which needs to be solved using accurate mathematical models for the regulation of indoor light parameters. Therefore, in this study, by weighing the evaluations of visual comfort, alertness, valence, and arousal of mood, a multi-objective optimisation mathematical model was developed with constraints conducive to the healthy rhythm. The problem was solved with the multi-objective evolutionary algorithm based on the decomposition differential evolution (MOEA/D-DE) algorithm. Taking educational space as the analysis goal, a dual-parameter setting strategy for illuminance and CCT covering four modes was proposed: focused learning, comfortable learning, soothing learning, and resting state, which could provide a scientific basis for the regulation of the lighting control system. The alertness during class time reached 3.01 compared to 2.34 during break time, showing a good light facilitation effect. The proposed mathematical model and analysis method also have the potential for application in the lighting design and control in other spaces to meet the era of intelligent, highly flexible, and sustainable buildings. [ABSTRACT FROM AUTHOR]

This paper introduces a novel physical-inspired metaheuristic algorithm called "Light Spectrum Optimizer (LSO)" for continuous optimization problems. The inspiration for the proposed algorithm is the light dispersions with different angles while passing through rain droplets, causing the meteorological phenomenon of the colorful rainbow spectrum. In order to validate the proposed algorithm, three different experiments are conducted. First, LSO is tested on solving CEC 2005, and the obtained results are compared with a wide range of well-regarded metaheuristics. In the second experiment, LSO is used for solving four CEC competitions in single objective optimization benchmarks (CEC2014, CEC2017, CEC2020, and CEC2022), and its results are compared with eleven well-established and recently-published optimizers, named grey wolf optimizer (GWO), whale optimization algorithm (WOA), and salp swarm algorithm (SSA), evolutionary algorithms like differential evolution (DE), and recently-published optimizers including gradient-based optimizer (GBO), artificial gorilla troops optimizer (GTO), Runge–Kutta method (RUN) beyond the metaphor, African vultures optimization algorithm (AVOA), equilibrium optimizer (EO), grey wolf optimizer (GWO), Reptile Search Algorithm (RSA), and slime mold algorithm (SMA). In addition, several engineering design problems are solved, and the results are compared with many algorithms from the literature. The experimental results with the statistical analysis demonstrate the merits and highly superior performance of the proposed LSO algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a new linear combination model to predict the closing prices on multivariate financial data sets. The new approach integrates two delays of deep learning methods called the two-delay combination model. The forecasts are derived from three different deep learning models: the multilayer perceptron (MLP), the convolutional neural network (CNN) and the long short-term memory (LSTM) network. Moreover, the weight combination of our proposed model is estimated using the differential evolution (DE) algorithm. The proposed model is built and tested for three high-frequency stock data in financial markets—Microsoft Corporation (MSFT), Johnson & Johnson (JNJ) and Pfizer Inc. (PFE). The individual and combination forecast methods are compared using the root mean square error (RMSE) and the mean absolute percentage error (MAPE). The state-of-the-art combination models used in this paper are the equal weight (EW), the inverse of RMSE (INV-RMSE) and the variance-no-covariance (VAR-NO-CORR) methods. These comparisons demonstrate that our proposed approach using DE weight's optimization has significantly lower forecast errors than the individual model and the state-of-the-art weight combination procedures for all experiments. Consequently, combining two delay deep learning models using differential evolution weights can effectively improve the stock price prediction. [ABSTRACT FROM AUTHOR]

In this article, an analytical technique based on unified method is applied to investigate the exact solutions of non-linear homogeneous evolution partial differential equations. These partial differential equations are reduced to ordinary differential equations using different traveling wave transformations, and exact solutions in rational and polynomial forms are obtained. The obtained solutions are presented in the form of 2D and 3D graphics to study the behavior of the analytical solution by setting out the values of suitable parameters. The acquired results reveal that the unified method is a suitable approach for handling non-linear homogeneous evolution equations. [ABSTRACT FROM AUTHOR]

Although differential evolution (DE) algorithms perform well on a large variety of complicated optimization problems, only a few theoretical studies are focused on the working principle of DE algorithms. To make the first attempt to reveal the function of binomial crossover, this paper aims to answer whether it can reduce the approximation error of evolutionary algorithms. By investigating the expected approximation error and the probability of not finding the optimum, we conduct a case study comparing two evolutionary algorithms with and without binomial crossover on two classical benchmark problems: OneMax and Deceptive. It is proven that using binomial crossover leads to the dominance of transition matrices. As a result, the algorithm with binomial crossover asymptotically outperforms that without crossover on both OneMax and Deceptive, and outperforms on OneMax, however, not on Deceptive. Furthermore, an adaptive parameter strategy is proposed which can strengthen the superiority of binomial crossover on Deceptive. [ABSTRACT FROM AUTHOR]

Nowadays, the sovereign credit rating is not only an index of a country's economic performance and political stability but also an overall indicator of development and growth, as well as the trust factor that is associated with the country. Due to its importance, the vast amount of available information, and the lack of a closed-form solution, prediction models based on machine learning (ML) and computation intelligence (CI) techniques are being increasingly used to complement traditional financial approaches. In this paper, we aim to introduce a novel ML-CI approach for sovereign credit rating prediction based on a differential evolution (DE) algorithm and interpolative Boolean algebra (IBA). In fact, the proposed approach is based on a pseudo-logical function in the IBA framework derived from the historical data of publicly available indicators using the DE algorithm. Such functions are easily interpreted and enable a subtle gradation among countries. It is shown that the IBA-DE approach outperforms back-propagation neural networks on the observed problem while also providing a deeper insight into each of the indicators used for prediction and its respective influence on the prediction rating on the other. [ABSTRACT FROM AUTHOR]

Social awareness of the environment has promoted the vigorous development of remanufacturing. Traditional product design does not consider the remanufacturability, which leads to improper disposal at the end of the product's life, resulting in environmental pollution and resource waste. In this paper, a method for the generation and optimization of product design schemes was established, in which remanufacturability was included at the early design stage of the product. Firstly, based on axiomatic design, the Z-shaped mapping was upgraded to the tree topology mapping, which was then incorporated into the scheme generation model, and seven remanufacturability design constraint criteria were used as constraints to obtain a product design set of scenarios. Secondly, the entropy weight method and analytic hierarchy process were combined to calculate the weights of the four evaluation indicators: functionality, economy, stability, and environment; and a differential evolution algorithm was used to optimize the scheme. Finally, a lathe was taken as a case to illustrate the applicability and effectiveness of the proposed methodology. The results showed that the method could successfully generate product design schemes that improved remanufacturability and met the needs of users. [ABSTRACT FROM AUTHOR]