71 results
Search Results
2. A novel differential evolution algorithm with multi-population and elites regeneration.
- Author
-
Cao, Yang and Luan, Jingzheng
- Subjects
DIFFERENTIAL evolution ,EVOLUTIONARY algorithms ,DISTRIBUTION (Probability theory) ,ALGORITHMS ,GLOBAL optimization - Abstract
Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. DE boasts several advantages, such as ease of implementation, reliability, speed, and adaptability. However, DE does have certain limitations, such as suboptimal solution exploitation and challenging parameter tuning. To address these challenges, this research paper introduces a novel algorithm called Enhanced Binary JADE (EBJADE), which combines differential evolution with multi-population and elites regeneration. The primary innovation of this paper lies in the introduction of strategy with enhanced exploitation capabilities. This strategy is based on utilizing the sorting of three vectors from the current generation to perturb the target vector. By introducing directional differences, guiding the search towards improved solutions. Additionally, this study adopts a multi-population method with a rewarding subpopulation to dynamically adjust the allocation of two different mutation strategies. Finally, the paper incorporates the sampling concept of elite individuals from the Estimation of Distribution Algorithm (EDA) to regenerate new solutions through the selection process in DE. Experimental results, using the CEC2014 benchmark tests, demonstrate the strong competitiveness and superior performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. Emulation-based adaptive differential evolution: fast and auto-tunable approach for moderately expensive optimization problems.
- Author
-
Nishihara, Kei and Nakata, Masaya
- Subjects
DIFFERENTIAL evolution ,BIOLOGICAL evolution ,EVOLUTIONARY algorithms ,ALGORITHMS - Abstract
In the field of expensive optimization, numerous papers have proposed surrogate-assisted evolutionary algorithms (SAEAs) for a few thousand or even hundreds of function evaluations. However, in reality, low-cost simulations suffice for a lot of real-world problems, in which the number of function evaluations is moderately restricted, e.g., to several thousands. In such moderately restricted scenario, SAEAs become unnecessarily time-consuming and tend to struggle with premature convergence. In addition, tuning the SAEA parameters becomes impractical under the restricted budgets of function evaluations—in some cases, inadequate configuration may degrade performance instead. In this context, this paper presents a fast and auto-tunable evolutionary algorithm for solving moderately restricted expensive optimization problems. The presented algorithm is a variant of adaptive differential evolution (DE) algorithms, and is called emulation-based adaptive DE or EBADE. The primary aim of EBADE is to emulate the principle of sample-efficient optimization, such as that in SAEAs, by adaptively tuning the DE parameter configurations. Specifically, similar to Expected Improvement-based sampling, EBADE identifies parameter configurations that may produce expected-to-improve solutions, without using function evaluations. Further, EBADE incepts a multi-population mechanism and assigns a parameter configuration to each subpopulation to estimate the effectiveness of parameter configurations with multiple samples carefully. This subpopulation-based adaptation can help improve the selection accuracy of promising parameter configurations, even when using an expected-to-improve indicator with high uncertainty, by validating with respect to multiple samples. The experimental results demonstrate that EBADE outperforms modern adaptive DEs and is highly competitive compared to SAEAs with a much shorter runtime. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. UNCREWED BOAT PATH PLANNING ALGORITHM BASED ON EVOLUTIONARY POTENTIAL FIELD MODEL IN DENSE OBSTACLE ENVIRONMENT.
- Author
-
WEI ZHENG and XIN HUANG
- Subjects
EVOLUTIONARY algorithms ,DIFFERENTIAL evolution ,ALGORITHMS - Abstract
In the trajectory planning of crewless ships, the artificial potential field method is commonly used. The results obtained using the classic potential field model for path design are not optimal and cannot fully meet the trajectory design requirements of uncrewed ships. This paper uses the evolutionary potential field model for trajectory planning. The evaluation formula of the potential path is combined with the differential evolution algorithm to evaluate and optimize the potential. A quadratic optimization smoothing algorithm is designed to limit the maximum turning angle of the uncrewed ship. Simulation experiments show that this method is effective and reliable. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. Dynamic multi-strategy integrated differential evolution algorithm based on reinforcement learning for optimization problems.
- Author
-
Yang, Qingyong, Chu, Shu-Chuan, Pan, Jeng-Shyang, Chou, Jyh-Horng, and Watada, Junzo
- Subjects
DIFFERENTIAL evolution ,REINFORCEMENT learning ,ALGORITHMS ,ENGINEERING design ,SET functions ,RANDOM sets - Abstract
The introduction of a multi-population structure in differential evolution (DE) algorithm has been proven to be an effective way to achieve algorithm adaptation and multi-strategy integration. However, in existing studies, the mutation strategy selection of each subpopulation during execution is fixed, resulting in poor self-adaptation of subpopulations. To solve this problem, a dynamic multi-strategy integrated differential evolution algorithm based on reinforcement learning (RLDMDE) is proposed in this paper. By employing reinforcement learning, each subpopulation can adaptively select the mutation strategy according to the current environmental state (population diversity). Based on the population state, this paper proposes an individual dynamic migration strategy to "reward" or "punish" the population to avoid wasting individual computing resources. Furthermore, this paper applies two methods of good point set and random opposition-based learning (ROBL) in the population initialization stage to improve the quality of the initial solutions. Finally, to evaluate the performance of the RLDMDE algorithm, this paper selects two benchmark function sets, CEC2013 and CEC2017, and six engineering design problems for testing. The results demonstrate that the RLDMDE algorithm has good performance and strong competitiveness in solving optimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. Comparison of a Hybrid Firefly–Particle Swarm Optimization Algorithm with Six Hybrid Firefly–Differential Evolution Algorithms and an Effective Cost-Saving Allocation Method for Ridesharing Recommendation Systems.
- Author
-
Hsieh, Fu-Shiung
- Subjects
METAHEURISTIC algorithms ,OPTIMIZATION algorithms ,RECOMMENDER systems ,RIDESHARING ,PARTICLE swarm optimization ,DIFFERENTIAL evolution ,ALGORITHMS - Abstract
The optimization and allocation of transport cost savings among stakeholders are two important issues that influence the satisfaction of information providers, drivers and passengers in ridesharing recommendation systems. For optimization issues, finding optimal solutions for nonconvex constrained discrete ridesharing optimization problems poses a challenge due to computational complexity. For the allocation of transport cost savings issues, the development of an effective method to allocate cost savings in ridesharing recommendation systems is an urgent need to improve the acceptability of ridesharing. The hybridization of different metaheuristic approaches has demonstrated its advantages in tackling the complexity of optimization problems. The principle of the hybridization of metaheuristic approaches is similar to a marriage of two people with the goal of having a happy ending. However, the effectiveness of hybrid metaheuristic algorithms is unknown a priori and depends on the problem to be solved. This is similar to a situation where no one knows whether a marriage will have a happy ending a priori. Whether the hybridization of the Firefly Algorithm (FA) with Particle Swarm Optimization (PSO) or Differential Evolution (DE) can work effectively in solving ridesharing optimization problems needs further study. Motivated by deficiencies in existing studies, this paper focuses on the effectiveness of hybrid metaheuristic algorithms for solving ridesharing problems based on the hybridization of FA with PSO or the hybridization of FA with DE. Another focus of this paper is to propose and study the effectiveness of a new method to allocate ridesharing cost savings to the stakeholders in ridesharing systems. The developed hybrid metaheuristic algorithms and the allocation method have been compared with examples of several application scenarios to illustrate their effectiveness. The results indicate that hybridizing FA with PSO creates a more efficient algorithm, whereas hybridizing FA with DE does not lead to a more efficient algorithm for the ridesharing recommendation problem. An interesting finding of this study is very similar to what happens in the real world: "Not all marriages have happy endings". [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
7. A Strengthened Dominance Relation NSGA-III Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem.
- Author
-
Liang Zeng, Junyang Shi, Yanyan Li, Shanshan Wang, and Weigang Li
- Subjects
PRODUCTION scheduling ,DIFFERENTIAL evolution ,OPTIMIZATION algorithms ,FLOW shops ,ALGORITHMS ,MANUFACTURING processes ,COMBINATORIAL optimization - Abstract
The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems. It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives. The Non-dominated Sorting Genetic Algorithm III (NSGA-III) is an effective approach for solving the multi-objective job shop scheduling problem. Nevertheless, it has some limitations in solving scheduling problems, including inadequate global search capability, susceptibility to premature convergence, and challenges in balancing convergence and diversity. To enhance its performance, this paper introduces a strengthened dominance relation NSGA-III algorithm based on differential evolution (NSGA-III-SD). By incorporating constrained differential evolution and simulated binary crossover genetic operators, this algorithm effectively improves NSGA-III's global search capability while mitigating premature convergence issues. Furthermore, it introduces a reinforced dominance relation to address the tradeoff between convergence and diversity in NSGA-III. Additionally, effective encoding and decoding methods for discrete job shop scheduling are proposed, which can improve the overall performance of the algorithm without complex computation. To validate the algorithm's effectiveness, NSGA-III-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances. The experimental results demonstrate that NSGA-III-SD achieves better solution quality and diversity, proving its effectiveness in solving the multi-objective job shop scheduling problem. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
8. A metaheuristic-based algorithm for optimizing node deployment in wireless sensor network.
- Author
-
Xie, Meng, Pi, Dechang, Dai, Chenglong, and Xu, Yue
- Subjects
- *
WIRELESS sensor networks , *WIRELESS sensor nodes , *METAHEURISTIC algorithms , *DIFFERENTIAL evolution , *TELECOMMUNICATION systems , *ALGORITHMS - Abstract
Communication quality is compromised when wireless sensor network (WSN) operate in harsh environments, which can be improved by supplementing the nodes. This paper proposes a deployment strategy to optimize the placement of new nodes in WSN, specifically in complex environments with limited communication. To achieve this, the paper introduces the concept of strong connectivity relationships and presents a novel metaheuristic algorithm, namely double-state differential evolution (DSDE), which divides the optimization process into two states and adopts different optimization strategies. The proposed DSDE can improve the overall network communication glowing at a lower computing cost. Extensive experiments show that the proposed DSDE has better performance than state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
9. PARAMETRIC DESIGN OF OFFICE FURNITURE PARTITION SPACE INTEGRATED WITH THE INTERACTIVE EVOLUTION ALGORITHM OF FNT AND TREE STRUCTURE.
- Author
-
SHIDONG CHEN and HUIYUAN GUAN
- Subjects
OFFICE furniture ,FURNITURE design ,WILCOXON signed-rank test ,DIFFERENTIAL evolution ,MULTICASTING (Computer networks) ,OFFICE environment ,SPACE ,ALGORITHMS - Abstract
Office furniture and its spatial layout design are playing an increasingly important role in improving work efficiency and employee comfort. However, the technology still faces some challenges. For instance, accurately simulating and evaluating the behavior and feelings of people in the office environment is difficult due to the high complexity of furniture spacing space design. It is important to address these issues. The study aims to explore the key technology and practical application of the parametric design of office furniture partition space based on the interactive evolution algorithm of tree structure. This paper proposes an improved version of the flexible neural tree model and corresponding algorithm. It also presents a design method based on the interactive differential evolution algorithm to optimize the automatic balance effect between global exploration and local development in the average shortening of the difference vector based on individual distribution. The results showed that all indexes were larger than or equal to other algorithms on 46 datasets. According to the Wilcoxon signed-rank test, the P-value was all less than 0.05, which is a significant advantage. Median, mean, and quartiles indicated that the overall performance of the algorithm was higher than the others. Furthermore, similarity evaluation-based Flexible Neural Tree algorithm had no outliers in the selected dataset, which also indicates the stability of the performance. The research results will support innovation and development in the field of office furniture design. This will promote intelligence, efficiency, and personalization in the design process, and meet the diverse needs of modern office environments. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
10. Acceleration for Efficient Automated Generation of Operational Amplifiers.
- Author
-
Zhao, Zhenxin, Liu, Jun, and Zhang, Lihong
- Subjects
OPTIMIZATION algorithms ,DETERMINISTIC algorithms ,DIFFERENTIAL evolution ,SIGNAL processing ,BOOSTING algorithms ,OPERATIONAL amplifiers ,ALGORITHMS - Abstract
Operational amplifiers (Op-Amps) are critical to sensor systems because they enable precise, reliable, and flexible signal processing. Current automated Op-Amp generation methods suffer from extremely low efficiency because the time-consuming SPICE-in-the-loop sizing is normally involved as its inner loop. In this paper, we propose an efficiently automated Op-Amp generation tool using a hybrid sizing method, which combines the merits together from a deterministic optimization algorithm and differential evolution algorithm. Thus, it can not only quickly find a decent local optimum, but also eventually converge to a global optimum. This feature is well fit to be serving as an acute filter in the circuit structure evaluation flow to efficiently eliminate any undesirable circuit structures in advance of detailed sizing. Our experimental results demonstrate its superiority over traditional sizing approaches and show its efficacy in highly boosting the efficiency of automated Op-Amp structure generation. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
11. A hybrid swarm intelligence algorithm for region-based image fusion.
- Author
-
Salgotra, Rohit, Lamba, Amanjot Kaur, Talwar, Dhruv, Gulati, Dhairya, and Gandomi, Amir H.
- Subjects
IMAGE fusion ,SWARM intelligence ,GREY Wolf Optimizer algorithm ,NAKED mole rat ,PARTICLE swarm optimization ,ALGORITHMS ,DIFFERENTIAL evolution - Abstract
This paper proposes a novel multi-hybrid algorithm named DHPN, using the best-known properties of dwarf mongoose algorithm (DMA), honey badger algorithm (HBA), prairie dog optimizer (PDO), cuckoo search (CS), grey wolf optimizer (GWO) and naked mole rat algorithm (NMRA). It follows an iterative division for extensive exploration and incorporates major parametric enhancements for improved exploitation operation. To counter the local optima problems, a stagnation phase using CS and GWO is added. Six new inertia weight operators have been analyzed to adapt algorithmic parameters, and the best combination of these parameters has been found. An analysis of the suitability of DHPN towards population variations and higher dimensions has been performed. For performance evaluation, the CEC 2005 and CEC 2019 benchmark data sets have been used. A comparison has been performed with differential evolution with active archive (JADE), self-adaptive DE (SaDE), success history based DE (SHADE), LSHADE-SPACMA, extended GWO (GWO-E), jDE100, and others. The DHPN algorithm is also used to solve the image fusion problem for four fusion quality metrics, namely, edge-based similarity index ( Q A B / F ), sum of correlation difference (SCD), structural similarity index measure (SSIM), and artifact measure ( N A B / F ). The average Q A B / F = 0.765508 , S C D = 1.63185 , S S I M = 0.726317 , and N A B / F = 0.006617 shows the best combination of results obtained by DHPN with respect to the existing algorithms such as DCH, CBF, GTF, JSR and others. Experimental and statistical Wilcoxon's and Friedman's tests show that the proposed DHPN algorithm performs significantly better in comparison to the other algorithms under test. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
12. A Collaborative Allocation Algorithm of Communicating, Caching and Computing Resources in Local Power Wireless Communication Network.
- Author
-
Tang, Jiajia, Shao, Sujie, Guo, Shaoyong, Wang, Ye, and Wu, Shuang
- Subjects
OPTIMIZATION algorithms ,POWER resources ,WIRELESS communications ,NETWORK performance ,ALGORITHMS ,RESOURCE allocation ,DATA transmission systems ,PARTICLE swarm optimization ,WIRELESS mesh networks - Abstract
With the rapid development of new power systems, diverse new power services have imposed stricter requirements on network resources and performance. However, the traditional method of transmitting request data to the IoT management platform for unified processing suffers from large delays due to long transmission distances, making it difficult to meet the delay requirements of new power services. Therefore, to reduce the transmission delay, data transmission, storage and computation need to be performed locally. However, due to the limited resources of individual nodes in the local power wireless communication network, issues such as tight coupling between devices and resources and a lack of flexible allocation need to be addressed. The collaborative allocation of resources among multiple nodes in the local network is necessary to satisfy the multi-dimensional resource requirements of new power services. In response to the problems of limited node resources, inflexible resource allocation, and the high complexity of multi-dimensional resource allocation in local power wireless communication networks, this paper proposes a multi-objective joint optimization model for the collaborative allocation of communication, storage, and computing resources. This model utilizes the computational characteristics of communication resources to reduce the dimensionality of the objective function. Furthermore, a mouse swarm optimization algorithm based on multi-strategy improvements is proposed. The simulation results demonstrate that this method can effectively reduce the total system delay and improve the utilization of network resources. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
13. A Multi-Objective Pigeon-Inspired Optimization Algorithm for Community Detection in Complex Networks.
- Author
-
Yu, Lin, Guo, Xiaodan, Zhou, Dongdong, and Zhang, Jie
- Subjects
OPTIMIZATION algorithms ,SOCIAL problems ,BIOLOGICALLY inspired computing ,HEURISTIC algorithms ,ALGORITHMS ,DIFFERENTIAL evolution - Abstract
Community structure is a very interesting attribute and feature in complex networks, which has attracted scholars' attention and research on community detection. Many single-objective optimization algorithms have been migrated and modified to serve community detection problems. Due to the limitation of resolution, the final algorithm implementation effect is not ideal. In this paper, a multi-objective community detection method based on a pigeon-inspired optimization algorithm, MOPIO-Net, is proposed. Firstly, the PIO algorithm is discretized in terms of the solution space representation, position, and velocity-updating strategies to adapt to discrete community detection scenarios. Secondly, by minimizing the two objective functions of community score and community fitness at the same time, the community structure with a tight interior and sparse exterior is obtained. Finally, for the misclassification caused by boundary nodes, a mutation strategy is added to improve the accuracy of the final community recognition. Experiments on synthetic and real networks verify that the proposed algorithm is more accurate in community recognition compared to 11 benchmark algorithms, confirming the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
14. DEMFFA: a multi-strategy modified Fennec Fox algorithm with mixed improved differential evolutionary variation strategies.
- Author
-
Hu, Gang, Song, Keke, Li, Xiuxiu, and Wang, Yi
- Subjects
DIFFERENTIAL evolution ,METAHEURISTIC algorithms ,ALGORITHMS ,ENGINEERING design ,PROBLEM solving - Abstract
The Fennec Fox algorithm (FFA) is a new meta-heuristic algorithm that is primarily inspired by the Fennec fox's ability to dig and escape from wild predators. Compared with other classical algorithms, FFA shows strong competitiveness. The "No free lunch" theorem shows that an algorithm has different effects in the face of different problems, such as: when solving high-dimensional or more complex applications, there are challenges such as easily falling into local optimal and slow convergence speed. To solve this problem with FFA, in this paper, an improved Fenna fox algorithm DEMFFA is proposed by adding sin chaotic mapping, formula factor adjustment, Cauchy operator mutation, and differential evolution mutation strategies. Firstly, a sin chaotic mapping strategy is added in the initialization stage to make the population distribution more uniform, thus speeding up the algorithm convergence speed. Secondly, in order to expedite the convergence speed of the algorithm, adjustments are made to the factors of the formula whose position is updated in the first stage, resulting in faster convergence. Finally, in order to prevent the algorithm from getting into the local optimal too early and expand the search space of the population, the Cauchy operator mutation strategy and differential evolution mutation strategy are added after the first and second stages of the original algorithm update. In order to verify the performance of the proposed DEMFFA, qualitative analysis is carried out on different test sets, and the proposed algorithm is tested with the original FFA, other classical algorithms, improved algorithms, and newly proposed algorithms on three different test sets. And we also carried out a qualitative analysis of the CEC2020. In addition, DEMFFA is applied to 10 practical engineering design problems and a complex 24-bar truss topology optimization problem, and the results show that the DEMFFA algorithm has the potential to solve complex problems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
15. A Fuzzy MARCOS-Based Analysis of Dragonfly Algorithm Variants in Industrial Optimization Problems.
- Author
-
Kalita, Kanak, Ganesh, Narayanan, Shankar, Rajendran, and Chakraborty, Shankar
- Subjects
BEES algorithm ,ANT algorithms ,FUZZY decision making ,POLLINATORS ,DIFFERENTIAL evolution ,ALGORITHMS ,METAHEURISTIC algorithms ,CHEMICAL processes - Abstract
Metaheuristics are commonly employed as a means of solving many distinct kinds of optimization problems. Several natural-process-inspired metaheuristic optimizers have been introduced in the recent years. The convergence, computational burden and statistical relevance of metaheuristics should be studied and compared for their potential use in future algorithm design and implementation. In this paper, eight different variants of dragonfly algorithm, i.e. classical dragonfly algorithm (DA), hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder-Mead algorithm and dragonfly algorithm (INMDA), and hybridization of dragonfly algorithm and artificial bee colony (HDA) are applied to solve four industrial chemical process optimization problems. A fuzzy multi-criteria decision making tool in the form of fuzzy-measurement alternatives and ranking according to compromise solution (MARCOS) is adopted to ascertain the relative rankings of the DA variants with respect to computational time, Friedman's rank based on optimal solutions and convergence rate. Based on the comprehensive testing of the algorithms, it is revealed that DADE, QGDA and classical DA are the top three DA variants in solving the industrial chemical process optimization problems under consideration. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
16. Performance of Differential Evolution Algorithms for Indoor Area Positioning in Wireless Sensor Networks.
- Author
-
Lee, Shu-Hung, Cheng, Chia-Hsin, Lu, Kuan-Hsien, Shiue, Yeong-Long, and Huang, Yung-Fa
- Subjects
INDOOR positioning systems ,WIRELESS sensor networks ,POSITION sensors ,DIFFERENTIAL evolution ,SENSOR placement ,K-nearest neighbor classification ,ALGORITHMS ,HUMAN fingerprints - Abstract
In positioning systems in wireless sensor networks, the accuracy of localization is often affected by signal distortion or attenuation caused by environmental factors, especially in indoor environments. Although using a combination of K-Nearest Neighbor (KNN) algorithm and fingerprinting matching can reduce positioning errors due to poor signal quality, the improvement in accuracy by increasing the number of reference points and K values is not significant. This paper proposes a Differential Evolution-based KNN (DE-KNN) method to overcome the performance limitations of the KNN algorithm and enhance indoor area positioning accuracy in WSNs. The DE-KNN method aims to improve the accuracy and stability of indoor positioning in wireless sensor networks. According to the simulation results, in a simple indoor environment with four reference points, when the sensors are deployed in both fixed and random arrangements, the positioning accuracy was improved by 29.09% and 30.20%, respectively, compared to using the KNN algorithm alone. In a complex indoor environment with four reference points, the positioning accuracy was increased by 32.24% and 33.72%, respectively. When the number of reference points increased to five, in a simple environment, the accuracy improvement for both fixed and random deployment was 20.70% and 26.01%, respectively. In a complex environment, the accuracy improvement was 23.88% and 27.99% for fixed and random deployment, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
17. 基于进化集成学习的用户购买意向预测.
- Author
-
张一凡, 于千城, and 张丽丝
- Subjects
- *
DIFFERENTIAL evolution , *FEATURE selection , *ALGORITHMS , *FORECASTING - Abstract
In the era of e-commerce, accurately predicting user purchase intentions has become a crucial factor for enhancing sales efficiency and optimizing the customer experience. Addressing the limitations of traditional ensemble strategies, which often suffer from subjective biases during the model design phase, this paper introduced an adaptive evolutionary ensemble learning model to predict user purchase intentions. This model adaptively selected the optimal base learners and meta-learners, incorporating both the predictive information from the base learners and the differential information between features to expand the feature dimensions, enhancing prediction accuracy. Moreover, to further refine the predictive capabilities of the model, this paper designed a binary adaptive differential evolution algorithm for feature selection, aiming to identify features that significantly influence the prediction outcome. Research results show that the binary adaptive differential evolution algorithm outperforms traditional optimization algorithms in global searches and feature selection. Compared to six common ensemble models and the DeepForest model, the proposed evolutionary ensemble model achieves a 2.76% and 2.72% increase in AUC value, respectively, and effectively mitigates the impacts of data imbalance [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
18. A Hybrid Feature-Selection Method Based on mRMR and Binary Differential Evolution for Gene Selection.
- Author
-
Yu, Kun, Li, Wei, Xie, Weidong, and Wang, Linjie
- Subjects
DIFFERENTIAL evolution ,FEATURE selection ,SPACE exploration ,DRUG development ,ELECTRONIC data processing ,ALGORITHMS ,GENES - Abstract
The selection of critical features from microarray data as biomarkers holds significant importance in disease diagnosis and drug development. It is essential to reduce the number of biomarkers while maintaining their performance to effectively minimize subsequent validation costs. However, the processing of microarray data often encounters the challenge of the "curse of dimensionality". Existing feature-selection methods face difficulties in effectively reducing feature dimensionality while ensuring classification accuracy, algorithm efficiency, and optimal search space exploration. This paper proposes a hybrid feature-selection algorithm based on an enhanced version of the Max Relevance and Min Redundancy (mRMR) method, coupled with differential evolution. The proposed method improves the quantization functions of mRMR to accommodate the continuous nature of microarray data attributes, utilizing them as the initial step in feature selection. Subsequently, an enhanced differential evolution algorithm is employed to further filter the features. Two adaptive mechanisms are introduced to enhance early search efficiency and late population diversity, thus reducing the number of features and balancing the algorithm's exploration and exploitation. The results highlight the improved performance and efficiency of the hybrid algorithm in feature selection for microarray data analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
19. A novel adaptive parameter strategy differential evolution algorithm and its application in midcourse guidance maneuver decision-making.
- Author
-
Xie, Lei, Wang, Yuan, Tang, Shangqin, Huang, Changqiang, Li, Yintong, Dong, Kangsheng, and Song, Ting
- Subjects
DIFFERENTIAL evolution ,ALGORITHMS ,DECISION making - Abstract
In this paper, a novel Adaptive Parameter Strategy Differential Evolution (APSDE) algorithm is proposed to overcome the parameters dependence and avoid local optima. The Parameter Update Mechanism (PUM), which has three different strategies, is used to reduce the dependence on parameters of DE. The Adaptive Proportion Adjustment Mechanism (APAM) is used to balance the proportion of PUM strategies in different development terms of exploitation and exploration, and the Random Restart Mechanism (RRM) is used to improve population diversity when exploitation is in stagnation. The proposed algorithm is verified in the CEC2018 test functions and the results show that APSDE has good abilities of exploitation, exploration, convergence, and stability. Secondly, Midcourse Guidance Maneuver Decision-making (MGMD) in Beyond Visual Range (BVR) air combat is studied and transformed into a single objective variational optimization problem, a MGMD system based on APSDE is established. Finally, the simulation of MGMD is carried out. The APSDE ranks first in the typical MGMD scenario experiment. In the adaptive Midcourse guidance confrontation, the winning rate of APSDE is 54%, and the statistical results show that the APSDE has an excellent MGMD ability. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
20. Adaptive differential evolution with fitness-based crossover rate for global numerical optimization.
- Author
-
Cheng, Lianzheng, Zhou, Jia-Xi, Hu, Xing, Mohamed, Ali Wagdy, and Liu, Yun
- Subjects
DIFFERENTIAL evolution ,BIOLOGICAL evolution ,GLOBAL optimization ,ALGORITHMS - Abstract
Differential evolution (DE) is one of the most efficient evolution algorithms (ES) for dealing with nonlinear, complicated and difficult global optimization problems. The main contribution of this paper can be summarized in three directions: Firstly, a novel crossover rate (CR) generation scheme based on the zscore value of fitness, named fcr, is introduced. For a minimization problem, the proposed CR generation strategy always assigns a smaller CR value to individual with smaller fitness value. Therefore, the parameters of individuals with better fitness are inherited by their offspring with high probability. In the second direction, the control parameters are adjusted by unused bimodal settings in which each parameter setting is selected according to the evolution status of individual. The third direction of our work is introducing the L1 norm distance as the weights for updating the mean value of crossover rate and scale factor. Theoretically, compared with L2 norm, L1-norm is more efficient to suppress outliers in the difference vector. These modifications are first integrated with the mutation strategy of JADE, then a modified version, named JADEfcr, is proposed. In addition, to improve the optimization ability further, another variant LJADEfcr by using a linear population reduction mechanism is considered. So as to confirm and examine the performance of JADEfcr and LJADEfcr, numerical experiments are conducted on 29 optimization problems defined by CEC2017 benchmark. For JADEfcr, its experimental results are made a comparison with twelve state-of-the-art algorithms. The comparative study demonstrates that in terms of robustness, stability and solution quality, JADEfcr are better and highly competitive with these well-known algorithms. For LJADEfcr, its results are compared with JADEfcr and other nine powerful algorithms including four recent algorithms and five top algorithms on CEC2017 competition. Experimental results indicate that LJADEfcr is superior and statistically competitive with these excellent algorithms in terms of robustness, stability and the quality of the obtained solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
21. Self-adaptive differential evolution algorithm with dynamic fitness-ranking mutation and pheromone strategy.
- Author
-
Singsathid, Pirapong, Wetweerapong, Jeerayut, and Puphasuk, Pikul
- Subjects
DIFFERENTIAL evolution ,OPTIMIZATION algorithms ,PHEROMONES ,ALGORITHMS - Abstract
Differential evolution (DE) is a population-based optimization algorithm widely used to solve a variety of continuous optimization problems. The self-adaptive DE algorithm improves the DE by encoding individual parameters to produce and propagate better solutions. This paper proposes a self-adaptive differential evolution algorithm with dynamic fitness-ranking mutation and pheromone strategy (SDE-FMP). The algorithm introduces the dynamical mutation operation using the fitness rank of the individuals to divide the population into three groups and then select groups and their vectors with adaptive probabilities to create a mutant vector. Mutation and crossover operations use the encoded scaling factor and the crossover rate values in a target vector to generate the corresponding trial vector. The values are changed according to the pheromone when the trial vector is inferior in the selection, whereas the pheromone is increased when the trial vector is superior. In addition, the algorithm also employs the resetting operation to unlearn and relearn the dominant pheromone values in the progressing search. The proposed SDE-FMP algorithm using the suitable resetting periods is compared with the well-known adaptive DE algorithms on several test problems. The results show that SDE-FMP can give high-precision solutions and outperforms the compared methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
22. Love Evolution Algorithm: a stimulus–value–role theory-inspired evolutionary algorithm for global optimization.
- Author
-
Gao, Yuansheng, Zhang, Jiahui, Wang, Yulin, Wang, Jinpeng, and Qin, Lang
- Subjects
- *
EVOLUTIONARY algorithms , *GLOBAL optimization , *ALGORITHMS , *WILCOXON signed-rank test , *METAHEURISTIC algorithms , *MATHEMATICAL models , *DIFFERENTIAL evolution , *BIOLOGICALLY inspired computing - Abstract
This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
23. A class of differential privacy stochastic gradient descent algorithm with adaptive gradient clipping.
- Author
-
ZHANG Jiaqi and LI Jueyou
- Subjects
ALGORITHMS ,PRIVACY ,DIFFERENTIAL evolution ,COMPUTER simulation - Abstract
Gradient clipping is an effective method to prevent gradient explosion, but the selection of the gradient clipping parameter usually has a great inuence on the performance of training models. To address this issue, this paper proposes an improved differentially private stochastic gradient descent algorithm by adaptively adjusting the gradient clipping parameter. First, an adaptive gradient clipping method is proposed by using the quantile and exponential averaging strategy to dynamically and adaptively adjust the gradient clipping parameter. Second, the convergence and privacy of the proposed algorithm for the case of non-convex objective function are analyzed. Finally, numerical simulations are performed on MNIST, Fasion-MNIST and IMDB datasets. The results show that the proposed algorithm can significantly improve the model accuracy compared to traditional stochastic gradient descent methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. The improved strategy of BOA algorithm and its application in multi-threshold image segmentation.
- Author
-
Wang, Lai-Wang and Hung, Chen-Chih
- Subjects
- *
IMAGE segmentation , *OPTIMIZATION algorithms , *ALGORITHMS , *DIFFERENTIAL evolution , *IMAGE processing , *GAUSSIAN distribution - Abstract
In response to the low efficiency and poor quality of current seed optimization algorithms for multi-threshold image segmentation, this paper proposes the utilization of the normal distribution in the cluster distribution mathematical model, the Levy flight mechanism, and the differential evolution algorithm to address the deficiencies of the seed optimization algorithm. The main innovation lies in applying the BBO algorithm to image multi threshold segmentation, providing a new perspective and method for image segmentation tasks. The second significant progress is the combination of Levy flight dynamics and differential evolution algorithm (DEA) to improve the BBO algorithm, thereby enhancing its performance and image segmentation quality. Therefore, a multi-threshold image segmentation model based on the optimized seed optimization algorithm is developed. The experimental results showed that on the function f1, the iteration of the improved seed optimization algorithm was 53, the Generational Distance value was 0.0020, the Inverted Generational Distance value was 0.098, and the Spacing value was 0.051. Compared with the other two algorithms, the improved seed optimization algorithm has better image segmentation performance and clearer image segmentation details. In summary, compared with existing multi-threshold image segmentation methods, the proposed multi-threshold image segmentation model based on the improved seed optimization algorithm has a better image segmentation effect and higher efficiency, can significantly improve the quality of image segmentation, has positive significance for the development of image processing technology, and also provides references for the improvement and application of optimization algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
25. Orthogonal opposition-based learning honey badger algorithm with differential evolution for global optimization and engineering design problems.
- Author
-
Huang, Peixin, Zhou, Yongquan, Deng, Wu, Zhao, Huimin, Luo, Qifang, and Wei, Yuanfei
- Subjects
DIFFERENTIAL evolution ,ENGINEERING design ,GLOBAL optimization ,METAHEURISTIC algorithms ,ALGORITHMS ,NASH equilibrium - Abstract
Honey badger algorithm (HBA) is a recent swarm-based metaheuristic algorithm that excels in simplicity and high exploitation capability. However, it suffers from some limitations including weak exploration capacity and an imbalance between exploration and exploitation. In this paper, an improved honey badger algorithm called ODEHBA is proposed to improve the performance of basic HBA. Firstly, an improved orthogonal opposition-based learning technique is employed to assist population in escaping local optimum. Secondly, differential evolution is utilized to ensure the enrichment of population diversity and to enhance convergence speed. Finally, the exploration capability of ODEHBA is boosted by an equilibrium pool strategy. To validate the efficacy of proposed ODEHBA, it is compared with 13 well-known metaheuristic algorithms on CEC2022 benchmark test sets. Friedman test and Wilcoxon rank-sum test are utilized to assess the performance of ODEHBA. Furthermore, three engineering design problems and Internet of Vehicles (IoV) routing problem are applied to validate the capability of ODEHBA. The simulation results demonstrate that ODEHBA excels in solving complex numerical problems, engineering design, and IoV routing problems. This holds significant practical implications for cost reduction and improved resource utilization. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
26. An Energy-Aware Cluster Head Selection and Optimal Route Selection Algorithm for Maximizing Network Lifetime in MANETs.
- Author
-
Devarayasamudram, Venkatesh, Chandrashekar, Rakesh, Chetla, Chandra Mohan, Ramachandraiah, Kumar Raja Depa, Nimmala, Purushotham, and Arumugam, Singaravelan
- Subjects
AD hoc computer networks ,DIFFERENTIAL evolution ,ALGORITHMS ,REACTIVE power ,COST functions ,QUALITY of service - Abstract
Quality of Service (QoS) is a crucial aspect of Mobile Ad Hoc Networks (MANET) that needs examination to demonstrate optimal performance. The scientific community is increasingly concerned with the challenge of developing an energy-aware clustering method for MANETs. This is owing to the fact that the battery-operated sensor devices that form the backbone of these wireless networks cannot be recharged. The selection of a cluster's leader is a difficult problem in MANET. Additionally, the research focuses on Optimal Route Selection (ORS) within the MANET context, acknowledging the significance of establishing efficient communication paths between cluster heads and member nodes. Through the integration of a reliability pair factor and node energy considerations, the proposed ORS algorithm generates optimal paths based on maximizing energy efficiency while minimizing the sum of hops between nodes. The study suggests a new algorithm based on the way waterwheel plants move and change their places as they explore and exploit new territory in the quest for food. The suggested method is named Binary Waterwheel Plant Algorithm (BWPA). In this method, a novel model is used to represent both the binary search space and the mapping from continuous to discrete spaces. Particularly, mathematical models of the fitness and cost functions used by the algorithm are constructed. Through the use of a reliability pair factor and node energy, the proposed research paper on Optimal Route Selection (ORS) generates the optimal path between the cluster head and member node and establishes the path based on the maximum energy and sum of hops among the nodes. By fusing the reactive power of differential evolution with the exhaustive search efficiency of the BWPA, the proposed method extends the life of networks. The recommended method increases node lifetime by compounding the dynamic capabilities of discrepancy evolution with the high effectiveness of search. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. An optimal frequency regulation in interconnected power system through differential evolution and firefly algorithm.
- Author
-
Mishra, Dillip K., Mohanty, Asit, and Ray, Prakash K.
- Subjects
- *
INTERCONNECTED power systems , *AUTOMATIC frequency control , *PID controllers , *AUTOMATIC control systems , *ALGORITHMS , *DIFFERENTIAL evolution - Abstract
Automatic generation control is extensively used to regulate power plants in a modern area of the power system network. In this paper, automatic generation and frequency control in interconnected power system is presented. A multisource such as thermal, hydro, and gas-based power plant is considered in this study, which is carried out by incorporating nonlinearity like generation rate constants, HVDC link, and the conventional PID controller design. Further, an optimal setting of the PID controller is performed by employing evolutionary, and metaheuristic algorithm-based approaches such as differential evolution and firefly algorithm, respectively. With these algorithms, the proposed model has been tested with their performance evaluation and comparison characteristics are discoursed. The robustness of the proposed controllers is assessed based on comparative analyses to regulate the interconnected power network's frequency profile under different loading conditions. The stability analysis is performed using the Eigen and Nyquist plots to assess the proposed controllers' efficacy. Besides, the frequency control study is summarized with comparative assessment through various performance indices such as settling time, peak overshoot and undershoots under different operating conditions. Finally, the proposed control scheme, in the interconnected power system, is validated through a real-time digital simulation platform, i.e., OPAL-RT 5142. The comparison of simulation and real-time results demonstrates the effectiveness of the FA-optimized PID controller in comparison with that of the DE-optimized PID controller. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. Multimodal multi-objective optimization based on local optimal neighborhood crowding distance differential evolution algorithm.
- Author
-
Gu, Qinghua, Peng, Yifan, Wang, Qian, and Jiang, Song
- Subjects
- *
DIFFERENTIAL evolution , *NEIGHBORHOODS , *ALGORITHMS , *EUCLIDEAN distance , *HEURISTIC , *COMPUTATIONAL complexity - Abstract
In practical applications, the optimal solutions of multi-objective optimization are not unique. Some problems exist different Pareto Sets (PSs) in the decision space mapped to the same Pareto Front (PF) in the objective space, which are called multimodal multi-objective problems (MMOPs). To tackle this issue, this paper proposes a multimodal multi-objective optimization based on a local optimal neighborhood crowding distance differential evolution algorithm. First, an adaptive partitioning strategy in the initialization phase is proposed by using the characteristics of the heuristic stochastic search. That ensures the local optimal solution is quickly found among multiple PSs. Second, opposition-based learning is combined with differential mutation to generate vectors, which accelerate the convergence of the population to the optimal solution. Finally, a method for neighborhood crowding distances on different Pareto ranks is designed. The distance is computed by a weighted sum of Euclidean distances for the nearest neighbors. While reducing computational complexity, this strategy reflects realistic crowding degree. With these methods, balances the diversity performance of the decision and the objective space, while improving the search capability. Multiple PSs reveal the problem's potential characteristics and meet the needs of the decision-maker. The practical significance is verified by the application of actual distance minimization problem. According to experimental results, the proposed method can achieve a high level of comprehensive performance. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
29. A Multi-level Surrogate-assisted Algorithm for Expensive Optimization Problems.
- Author
-
Liang Hu, Xianwei Wu, and Xilong Che
- Subjects
OPTIMIZATION algorithms ,SIMPLEX algorithm ,DIFFERENTIAL evolution ,RANDOM forest algorithms ,ALGORITHMS - Abstract
With the development of computer science, more and more complex problems rely on the help of computers for solving. When facing the parameter optimization problem of complex models, traditional intelligent optimization algorithms often require multiple iterations on the target problem. It can bring unacceptable costs and resource costs in dealing with these complex problems. In order to solve the parameter optimization of complex problems, in this paper we propose a multi-level surrogate-assisted optimization algorithm (MLSAO). By constructing surrogate models at different levels, the algorithm effectively explores the parameter space, avoiding local optima and enhancing optimization efficiency. The method combines two optimization algorithms, differential evolution (DE) and Downhill simplex method. DE is focused on global level surrogate model optimization. Downhill simplex is concentrated on local level surrogate model update. Random forest and inverse distance weighting (IDW) are constructed for global and local level surrogate model, respectively. These methods leverage their respective advantages at different stages of the algorithm. The MLSAO algorithm is evaluated against other state-of-the-art approaches using benchmark functions of varying dimensions. Comprehensive results from the comparisons showcase the superior performance of the MLSAO algorithm in addressing expensive optimization problems. Moreover, we implement the MLSAO algorithm for tuning precipitation parameters in the Community Earth System Model (CESM). The outcomes reveal its effective enhancement of CESM's simulation accuracy for precipitation in the North Indian Ocean and the North Pacific region. These experiments demonstrate that MLSAO can better address parameter optimization problems under complex conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. Advanced backtracking search for solving continuous optimization problems.
- Author
-
Tsai, Hsing-Chih, Chen, You-Ren, and Ko, Cheng-Chun
- Subjects
- *
SEARCH algorithms , *DIFFERENTIAL evolution , *ALGORITHMS - Abstract
This paper recommends developing advanced backtracking search (ABS) to use single- and multi-vector mutation strategies to effectively enhance the backtracking search algorithm in solving a variety of optimization problems. The ABS version proposed in this paper utilizes three primary strategies considering critical historical information and suitable crossover mechanisms. Two of these are single-vector strategies that conduct searches based on random individuals, respectively, heading toward historical positions and determining destinations with one perturbation vector. The remaining multi-vector strategy conducts searches around historical best positions using a relatively low crossover rate. The performance of the suggested six ABS versions was evaluated using the benchmark functions of IEEE CEC2005 and CEC2019. The experimental results demonstrate that the proposed ABS version significantly improves BSA and its improved version. Additionally, the proposed ABS version is the most competitive algorithm compared to the seven classical algorithms in terms of evaluations of obtained results and significant values. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. Reliable network-level pavement maintenance budget allocation: Algorithm selection and parameter tuning matter.
- Author
-
Mahpour, Amirreza and El-Diraby, Tamer
- Subjects
BUDGET ,PAVEMENTS ,DIFFERENTIAL evolution ,ALGORITHMS ,GENETIC algorithms ,SELF-tuning controllers ,PETRI nets ,MAINTENANCE ,EVOLUTIONARY algorithms - Abstract
• A model was created to examine the reliability of maintenance budget allocation. • The model was applied to network-level pavement maintenance in Canada. • The impacts of algorithm selection and parameter tuning were studied. • The significance of pavement clustering in increasing reliability was highlighted. • The importance of incorporating actual pavement improvement curves was clarified. The purpose of this paper is to increase the reliability of the network-level pavement maintenance budget allocation by reducing uncertainties of algorithm selection and parameter tuning. In this paper, reliability is defined as the ability of a network-level pavement maintenance plan to improve the condition of a pavement network within a certain budget. In order to quantify reliability, the reliability index is defined as the ratio between the post-maintenance network condition and the net maintenance cost. With this purpose in mind, a two-objective optimization model was developed. To test its applicability, the model was applied to a pavement network in Canada. The model was solved using the Non-Dominated Sorting Genetic Algorithm II and the differential evolution algorithms. Finally, the reliability indices of algorithms and termination criteria were computed. The results indicated that the differential evolution algorithm recommended less frequent but more intense interventions that made the solutions expensive and less reliable. This paper contributed to the network-level pavement maintenance body of knowledge by (1) developing a multi-objective optimization model to reduce uncertainties of parameter tuning and algorithm selection; (2) increasing the reliability of budget allocation; (3) showcasing the significance of pavement clustering in increasing reliability; and (4) developing and incorporating actual pavement improvement curves. [Display omitted] [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Economic dispatch using metaheuristics: Algorithms, problems, and solutions.
- Author
-
Visutarrom, Thammarsat and Chiang, Tsung-Che
- Subjects
DIFFERENTIAL evolution ,METAHEURISTIC algorithms ,ALGORITHMS ,INDUSTRIAL efficiency ,RESEARCH personnel ,ENERGY management - Abstract
Economic dispatch (ED) has received considerable interest in the field of energy management and optimization. The problem aims to determine the most cost-effective power allocation strategy that satisfies the power demand and all physical constraints of the power system. To solve this problem, we propose an algorithm based on differential evolution and adopt a hybrid mutation strategy, a linear population size reduction mechanism, and an improved single-unit repair mechanism. Experimental results confirmed that these mechanisms are useful for performance improvement. The proposed algorithm (L -HMDE) showed good performance when compared with more than 90 algorithms in solving 22 test cases. It could provide high-quality solutions stably and efficiently. In addition to designing a good algorithm, we present a review of over 100 papers and highlight their algorithm features. We also provide a comprehensive collection of test cases in the literature. Through careful examination and verification, data coefficients of these test cases and solutions to them are included in this paper as a useful reference for researchers who are interested in this problem. • A differential evolution-based algorithm (L-HMDE) is proposed to address the economic dispatch problem. • The L-HMDE integrates a hybrid mutation strategy, a population size reduction mechanism, and an improved repair procedure. • It shows good solution quality and high efficiency when compared with more than 90 existing algorithms on 22 test cases. • A comprehensive collection of test cases and solutions is also provided. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. Improved differential evolution algorithm based on cooperative multi-population.
- Author
-
Shen, Yangyang, Wu, Jing, Ma, Minfu, Du, Xiaofeng, Wu, Hao, Fei, Xianlong, and Niu, Datian
- Subjects
- *
DIFFERENTIAL evolution , *METAHEURISTIC algorithms , *OPTIMIZATION algorithms , *ALGORITHMS , *BOOSTING algorithms - Abstract
This paper introduces an improved differential evolution algorithm based on cooperative multi-population (CMp-DE for short), which combines diverse population collaboration mechanisms and catalytic factors into an improved differential evolution framework. By harnessing various population collaboration mechanisms, the algorithm enhances the diversity of individuals within populations during initial iterations and reduces it during later iterations, thereby harmonizing the algorithm's exploratory and exploitative capabilities. Furthermore, a novel mutation operator is proposed that divides the iterative process into exploration and exploitation phases, thereby augmenting the algorithm's global exploration prowess. Lastly, a catalytic operator is introduced to generate new individuals near post-crossover individuals based on a specified rule, which enhances the algorithm's ability to escape local optima and increasing stability. The proposed CMp-DE is benchmarked against the CEC2017 benchmark test functions and compared against 13 algorithms, including five differential evolution algorithms and their variants, as well as eight state-of-the-art metaheuristic optimization algorithms. This evaluation assesses the CMp-DE's solution accuracy, convergence, stability, and scalability. Finally, the applicability of CMp-DE is validated by addressing six practical optimization problems. The experimental results show that CMp-DE surpasses other algorithms in terms of both convergence accuracy and robustness. Moreover, integrating a catalytic operator with other optimization algorithms notably boosts performance in convergence accuracy and stability. The inclusion of the catalytic operator has significantly enhanced the performance of algorithms compared to their performance before its addition. This underscores the potential of the catalytic operator in improving the performance of various algorithms, particularly in terms of convergence accuracy and robustness. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
34. Enhancing 3D localization in wireless sensor network: a differential evolution method for the DV-Hop algorithm.
- Author
-
Liu, Zhihua, Zhang, Ran, Yang, Yuanyuan, Chen, Zhaoye, Hao, Mengnan, and Chen, Jiaxing
- Subjects
- *
WIRELESS sensor networks , *DIFFERENTIAL evolution , *WIRELESS localization , *SENSOR placement , *EVOLUTIONARY algorithms , *ALGORITHMS - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
35. Optimal power flow considering intermittent solar and wind generation using multi-operator differential evolution algorithm.
- Author
-
Sallam, Karam M., Hossain, Md Alamgir, Elsayed, Seham, Chakrabortty, Ripon K., Ryan, Michael J., and Abido, Mohammad A.
- Subjects
- *
ELECTRICAL load , *OPTIMIZATION algorithms , *RENEWABLE energy sources , *SOLAR energy , *WIND power , *DIFFERENTIAL evolution , *ALGORITHMS - Abstract
In this paper, a multi-operator differential evolution algorithm (MODE) is proposed to solve the Optimal Power Flow problem, called MODE-OPF. The MODE-OPF utilizes the strengths of more than one differential evolution operator in a single algorithmic framework. Additionally, an adaptive method is proposed to update the number of solutions evolved by each DE operator based on both the diversity of the population and the quality of solutions. This adaptive method has the ability to maintain diversity at the early stages of the optimization process and boost convergence at the later ones. The performance of the proposed MODE-OPF is tested by solving OPF problems for both small and large IEEE bus systems (i.e., IEEE-30 and IEEE-118) while considering intermittent solar and wind power generation. To prove the suitability of this proposed algorithm, its performance has been compared against several state-of-the-art optimization algorithms, where MODE-OPF outperforms other algorithms in all experimental results thereby improving a network's performance with lower cost. MODE-OPF decreases the total generation cost up to 24.08%, the real power loss up to 6.80% and the total generation cost with emission up to 8.56%. • Development of an adaptive method (AM) for optimizing diversity and solution quality. • Innovative constraint handling approach, progressively adding constraints for improved performance. • Incorporation of intermittent renewable energy models for realistic problem solving. • Extensive validation on IEEE 30-bus and IEEE 118-bus networks, outperforming state-of-the-art algorithms in cost, loss, and environmental impact reduction. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. DP-EPSO: Differential privacy protection algorithm based on differential evolution and particle swarm optimization.
- Author
-
Gao, Qiang, Sun, Han, and Wang, Zhifang
- Subjects
- *
DIFFERENTIAL evolution , *PARTICLE swarm optimization , *PRIVACY , *ALGORITHMS , *DEEP learning - Abstract
• Differential privacy and deep learning are combined to alleviate the problem of model privacy leakage. • Differential evolution is used to optimize the learning rate, accelerate the model convergence, and avoid the privacy loss. • The particle swarm optimization method is used to find the optimal weight that satisfies the privacy. • The algorithm in this paper is verified on three data sets, and the accuracy and efficiency are better. In deep learning differential privacy protection, adding noise based on gradient has become a mainstream algorithm, but excessive gradient perturbation noise causes accuracy degradation. To solve this problem, a differential privacy protection algorithm based on differential evolution and particle swarm optimization is proposed to realize hyperparameter optimization in differential privacy, reduce the impact of noise on the model, and effectively improve the accuracy. On the one hand, the differential evolution scheme performs selection, crossover and mutation on learning rate η , make it approach the global optimal solution, and improve the computational efficiency of the algorithm. On the other hand, the particle swarm optimization scheme is adopted. Without changing the parameters and gradient structure, the parameters are optimized by using the network propagation attributes, which reduces the influence of noise on the accuracy. Experiments are performed on three datasets: Cifar10, Mnist and FashionMnist. Compared with the existing differential privacy algorithms, under the same privacy budget, the proposed algorithm has better accuracy and higher efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
37. Underwater glider 3D path planning with adaptive segments and optimal motion parameters based on improved JADE algorithm.
- Author
-
Hu, Hao, Zhang, Zhao, Wang, Tonghao, and Peng, Xingguang
- Subjects
- *
UNDERWATER gliders , *ENERGY consumption , *CONSUMPTION (Economics) , *ALGORITHMS , *OCEAN bottom , *ECHO - Abstract
This paper presents a novel 3D path planning method for the underwater glider (UG) that incorporates adaptive segment strategy, motion parameters optimization, and an improved JADE algorithm. The method aims to generate an energy-efficient path by adapting to ocean currents and seabed topography and selecting favorable motion parameters. We establish an energy consumption model for a blended-wing-body UG, examining the influence of motion parameters and ocean currents on its performance. The proposed method encodes an energy-optimal gliding path through multiple path segments, each defined by a set of path points, pitch angles, and diving depths. The fitness function, based on energy consumption, guides the optimization process. To enhance the optimization, we present an improved JADE algorithm with multi-mutation strategies, which adaptively updates the mutation operation and mean crossover probability. Our method was assessed and compared with a classical UG path planning method on 6 test scenarios. Simulation results confirm that adaptive segments and motion parameter optimization contribute to better adaptation to ocean environments and reduced energy consumption. • A 3D path planning method for underwater gliders with adaptive segments and optimal motion parameters was proposed. • An energy consumption model for a blended wing body underwater glider was established. • An improved JADE algorithm with multi-mutation strategies was presented as an optimizer for UGAPP. • Significant improvements have been achieved in terms of energy savings for the underwater glider compared to a classical method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. A multitasking multi-objective differential evolution gene selection algorithm enhanced with new elite and guidance strategies for tumor identification.
- Author
-
Li, Min, Zhao, Yangfan, Lou, Mingzhu, Deng, Shaobo, and Wang, Lei
- Subjects
- *
DIFFERENTIAL evolution , *GENE expression , *FEATURE selection , *GENES , *TUMOR markers , *MACHINE learning , *ALGORITHMS , *KNOWLEDGE transfer - Abstract
• MMODE is developed as a new hybrid gene selection method for tumor identification. • MMODE combines multi-tasking and multi-objective frameworks. • MMODE uses a new elite strategy and a new guidance strategy. • MMODE selects a few genes and achieves high classification accuracy. A key preprocessing step in tumor recognition based on microarray expression profile data and machine learning is to identify tumor marker genes. Gene selection aims to select the most relevant gene subset from the original ultra-high dimensional microarray expression profile data to improve tumor identification performance. Inspired by evolutionary multitasking (EMT) and multi-objective optimization, this paper puts forward a novel multitasking multi-objective differential evolution gene selection algorithm (MMODE) which uses new elite and guidance strategies to select the best gene subsets. MMODE initializes two different populations according to different filtering criteria to increase the diversity of the search. These two populations guide their respective populations to search in the optimal direction through knowledge transfer in the evolutionary process. In addition, MMODE employs new elite and guidance strategies that enables individuals to narrow the search range and jump out of local optima. The proposed algorithm is validated on 13 publicly available microarray expression datasets in comparison with state-of-the-art gene selection algorithms. The experimental results show that MMODE can find smaller gene subsets and achieve higher classification accuracy compared with other algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. A self-learning differential evolution algorithm with population range indicator.
- Author
-
Zhao, Fuqing, Zhou, Hao, Xu, Tianpeng, and Jonrinaldi
- Subjects
- *
DIFFERENTIAL evolution , *DEEP reinforcement learning , *REINFORCEMENT learning , *AUTODIDACTICISM , *EVOLUTIONARY algorithms , *ALGORITHMS - Abstract
The differential evolution (DE) algorithm is widely regarded as one of the most influential evolutionary algorithms for addressing complex optimization problems. However, the fixed mutation strategy limits the adaptive ability of DE, and the lack of utilization of historical information limits the optimization ability of DE. In this paper, an indicator-based self-learning differential evolution algorithm (ISDE) is proposed. A jump out mechanism based on deep reinforcement learning is adopted to control the mutation intensity of the population. The neural network in the jump out mechanism is designed as a decision maker. The mutation intensity of the population is controlled by the neural network, and the neural network are trained by a double deep Q network algorithm based on the continuous data generated during the evolution process. A population range indicator (PRI) is utilized to describe individual differences in the population. A diversity maintenance mechanism is designed to maintain individual differences according to the value of PRI. The experimental results reveal that the comprehensive performance of ISDE is superior to comparison algorithms on CEC 2017 real-parameter numerical optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
40. A Novel Modified Discrete Differential Evolution Algorithm to Solve the Operations Sequencing Problem in CAPP Systems.
- Author
-
Alvarez-Flores, Oscar Alberto, Rivera-Blas, Raúl, Flores-Herrera, Luis Armando, Rivera-Blas, Emmanuel Zenén, Funes-Lora, Miguel Angel, and Niño-Suárez, Paola Andrea
- Subjects
DIFFERENTIAL evolution ,DIRECTED graphs ,ALGORITHMS ,MACHINE parts ,COMBINATORIAL optimization ,QUANTILES ,MACHINING - Abstract
Operation Sequencing (OS) is one of the most critical tasks in a CAPP system. This process could be modelled as a combinatorial problem where finding a suitable solution within a reasonable time interval is difficult. This work implements a novel Discrete Differential Evolution Algorithm (DDEA) to solve the OS problem, focusing on parts of up to 76 machining operations; the relationships among operations are represented as a directed graph; the contributions of the DDEA are as follows: (1) operates with a discrete representation in the space of feasible solutions; (2) employs mutation and crossover operators to update solutions and to reduce machining and setup costs, (3) possess a local search strategy to achieve better solutions, and (4) integrates a statistical method based on quantiles to measure the quality and likelihood for an achieving a solution. To demonstrate the efficiency and robustness of the DDEA, five prismatic parts with different numbers of machining operations as benchmarks to address the OS problem were selected. The results generated the same OS for parts with a few machining operations (up to 23 machining operations). Conversely, for parts with more machining operations, the DDEA needs more runs to achieve the best solution. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. An Enhanced Tree-Seed Algorithm for Function Optimization and Production Optimization.
- Author
-
Zhou, Qingan, Dai, Rong, Zhou, Guoxiao, Ma, Shenghui, and Luo, Shunshe
- Subjects
EVOLUTIONARY algorithms ,BIOLOGICAL evolution ,METAHEURISTIC algorithms ,DIFFERENTIAL evolution ,GLOBAL optimization ,ALGORITHMS - Abstract
As the fields of engineering, energy, and geology become increasingly complex, decision makers face escalating challenges that require skilled solutions to meet practical production needs. Evolutionary algorithms, inspired by biological evolution, have emerged as powerful methods for tackling intricate optimization problems without relying on gradient data. Among these, the tree-seed algorithm (TSA) distinguishes itself due to its unique mechanism and efficient searching capabilities. However, an imbalance between its exploitation and exploration phases can lead it to be stuck in local optima, impeding the discovery of globally optimal solutions. This study introduces an improved TSA that incorporates water-cycling and quantum rotation-gate mechanisms. These enhancements assist the algorithm in escaping local peaks and achieving a more harmonious balance between its exploitation and exploration phases. Comparative experimental evaluations, using the CEC 2017 benchmarks and a well-known metaheuristic algorithm, demonstrate the upgraded algorithm's faster convergence rate and enhanced ability to locate global optima. Additionally, its application in optimizing reservoir production models underscores its superior performance compared to competing methods, further validating its real-world optimization capabilities. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. A density clustering-based differential evolution algorithm for solving nonlinear equation systems.
- Author
-
Guo, Yan, Li, Mu, Jin, Jie, and He, Xianke
- Subjects
- *
DIFFERENTIAL evolution , *NONLINEAR systems , *MEMETICS , *ALGORITHMS , *PROBLEM solving , *DENSITY , *ARCHIVES , *WEB archives - Abstract
Solving nonlinear equation systems (NESs) is one of the most important tasks in numerical computing. The NESs usually have multiple roots, and quickly locating their roots in a single algorithm run with a limited number of iterations has always been the algorithm improvement direction. In order to further enhance the efficiency of the existing methods, a density clustering-based differential evolution algorithm (DCDE) for the NESs problem solving is proposed in this paper. Firstly, density-based spatial clustering of applications with noise (DBSCAN) is used to divide the population into clusters and noises, which provides a better direction for population evolution. Secondly, a cluster evaluation factor is proposed, which not only divides the clusters into excellent clusters and non-excellent clusters, but also prevents the migration of excellent clusters and maintain the diversity of populations. Then, a migration strategy and individual generation mechanism are proposed to guide non-excellent clusters to migrate to promising regions. Finally, combined with an archive technique, the individuals which satisfy the solution requirements are archived and randomly initialized to further improve population diversity. To verify the effectiveness of the proposed algorithm, comparative experimental results of the propsoed DCDE with other state-of-the-art algorithms for thirty NESs problems solving show that the proposed DCDE is the most effective algorithm to locate more roots in a single run. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. Accurate parameters extraction of photovoltaic models with multi-strategy gaining-sharing knowledge-based algorithm.
- Author
-
Xiong, Guojiang, Gu, Zaiyu, Mohamed, Ali Wagdy, Bouchekara, Houssem R.E.H., and Suganthan, Ponnuthurai Nagaratnam
- Subjects
- *
MEMETICS , *OPTIMIZATION algorithms , *DIFFERENTIAL evolution , *ALGORITHMS , *PHOTOVOLTAIC power systems , *SEARCH algorithms - Abstract
• An improved gaining-sharing knowledge-based algorithm named MSGSK is proposed. • A parameter adjustment strategy is developed to adjust relative parameters of MSGSK. • A backtracking differential mutation strategy is designed to enrich the population diversity. • A strategy selection mechanism is presented to integrate the former two strategies. • MSGSK extracts more accurate parameters for five PV models. The determination of photovoltaic (PV) model parameters has essential theoretical and practical significance for the performance evaluation, power monitoring, and power generation efficiency calculation of PV systems. In this paper, a multi-strategy gaining-sharing knowledge-based algorithm (MSGSK) is developed to determine these parameters. In our previous work, it has been demonstrated that gaining-sharing knowledge-based algorithm (GSK) is well suited for solving the concerned problem. To enhance its performance, a parameter adjustment strategy is developed to adjust the knowledge rate and knowledge ratio of GSK. Besides, a backtracking differential mutation strategy by combining the mutation scheme of differential evolution and the updating scheme of backtracking search optimization algorithm is developed to enrich the population diversity. Furthermore, a strategy selection mechanism is introduced to integrate the former two strategies to balance exploration and exploitation in different stages of the evolutionary process. The suggested MSGSK algorithm is applied to five PV cases (SDM, DDM, Photowatt-PW201, STM6-40/36, and STP6-120/36). From the experimental data, it can be observed that MSGSK extracts the PV model parameters more precisely than the basic GSK. Furthermore, it exhibits faster convergence speed and higher accuracy compared to other advanced algorithms found in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
44. Differential evolution algorithm with a complementary mutation strategy and data Fusion-Based parameter adaptation.
- Author
-
Chen, Bozhen, Ouyang, Haibin, Li, Steven, and Zou, Dexuan
- Subjects
- *
DIFFERENTIAL evolution , *OPTIMIZATION algorithms , *EVOLUTIONARY algorithms , *GAUSSIAN distribution , *ALGORITHMS , *PERFORMANCES , *HOTEL suites - Abstract
• Analyze DE algorithm two key issues: parameter sensitivity and search imbalance. • A complementary mutation strategy based on complementary symmetric selection and a Gaussian distribution mutation is proposed. • Data fusion-based parameter adaptation method proposed for parameter rationalization. • A novel variant of DE called DACDE is designed and results shown competitive edge. As an excellent optimization algorithm widely used to solve various practical problems, differential evolution (DE) algorithm has few parameters, yet its performance is significantly affected by these parameters. To address this issue, this paper presents a novel variant of DE called DACDE, which utilizes data fusion-based parameter adaptation and a complementary mutation strategy. Most parameter adaptation methods based on successful history only analyze the mean of parameters and ignore their degree of dispersion. In DACDE, the successful parameter distribution is recorded and described by both the mean and variance. Data fusion is then used to combine records and generate an estimated distribution, which is applied to a Gaussian distribution to generate new parameters. Inspired by opposition-based learning, we introduce a complementary mutation strategy. This strategy employs a symmetric selection mechanism to adapt to the varying search abilities required by the algorithm at different stages. The new variant is verified on 32 single-objective functions from CEC 2011 and 2014 benchmark suites, and the results show that DACDE is competitive compared to other 29 evolutionary algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
45. An enhanced adaptive differential evolution algorithm with dual performance evaluation metrics for numerical optimization.
- Author
-
Tian, Mengnan, Yan, Xueqing, and Gao, Xingbao
- Subjects
DIFFERENTIAL evolution ,BIOLOGICAL evolution ,WILCOXON signed-rank test ,SEARCH algorithms ,ALGORITHMS ,GLOBAL optimization - Abstract
In this paper, we present a novel adaptive differential evolution algorithm for global optimization problems by introducing an enhanced mutation operator and a new mixed control parameter setting based on dual performance evaluation metrics. To further strengthen the search efficiency of algorithm and availably balance its exploration and exploitation, a dual performance metrics-based mutation operator is first proposed to implement the search of population by organically integrating the fitness value and history update of individual to find the potential promising areas and allocate the suitable search resources for them. Meanwhile, a dual performance metrics-based mixed parameter setting is developed to yield appropriate associated parameters for each individual by comprehensively measuring its search characteristic and requirement based on both its fitness value and history update. In addition, a new restart strategy is further put forward to boost the search performance of algorithm by reasonably replacing the meaningless individuals measured by both their fitness values and history updates with the randomly generated individuals based on Gaussian walk. In contrast to the existing DE versions, the new algorithm organically takes advantage of the fitness value and history update of individual to assign the proper computational resources for each potential promising region, create the suitable parameters for different individuals, and eliminate the valueless individuals from population. Thereby, it is capable of heightening the search efficiency of algorithm and maintaining a good balance between exploration and exploitation effectively. At last, the performance of the proposed algorithm is evaluated by comparing with 19 typical or up-to-date algorithms on 42 benchmark functions from both IEEE CEC2017 and CEC2022 test suites. Compared to these opponents, the proposed algorithm achieves significantly better performance on 60 out of 77 cases based on the multiproblem Wilcoxon signed-rank test at a significant level of 0.05, and thus is a more promising optimizer. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
46. Distribution Network Reconfiguration Based on an Improved Arithmetic Optimization Algorithm.
- Author
-
Jia, Hui, Zhu, Xueling, and Cao, Wensi
- Subjects
OPTIMIZATION algorithms ,DIFFERENTIAL evolution ,ARITHMETIC ,MATHEMATICS ,ALGORITHMS - Abstract
Aiming to address the defects of the arithmetic optimization algorithm (AOA), such as easy fall into local optimums and slow convergence speed during the search process, an improved arithmetic optimization algorithm (IAOA) is proposed and applied to the study of distribution network reconfiguration. Firstly, a reconfiguration model is established to reduce network loss, and a cosine control factor is introduced to reconfigure the math optimization accelerated (MOA) function to coordinate the algorithm's global exploration and local exploitation capabilities. Subsequently, a reverse differential evolution strategy is introduced to improve the overall diversity of the population and Weibull mutation is performed on the better-adapted individuals generated in each iteration to ensure the quality of the optimal individuals generated in each iteration and strengthen the algorithm's ability to approach the optimal solution. The performance of the improved algorithm is also tested using eight basis functions. Finally, simulation analysis is carried out by taking the IEEE33 and IEEE69 node systems and a real power distribution system as examples; the results show that the proposed algorithm can help to reconfigure the system quickly, and the system node voltages and network losses were significantly improved after the reconfiguration. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. Multi-Objective Optimization Algorithm for Grouping Decision Variables Based on Extreme Point Pareto Frontier.
- Author
-
Jun Wang, Linxi Zhang, Hao Zhang, Funan Peng, El-Meligy, Mohammed A., Sharaf, Mohamed, and Qiang Fu
- Subjects
OPTIMIZATION algorithms ,DIFFERENTIAL evolution ,PARETO optimum ,EVOLUTIONARY algorithms ,PROBLEM solving ,ALGORITHMS - Abstract
The existing algorithms for solving multi-objective optimization problems fall into three main categories: Decomposition-based, dominance-based, and indicator-based. Traditional multi-objective optimization problems mainly focus on objectives, treating decision variables as a total variable to solve the problem without considering the critical role of decision variables in objective optimization. As seen, a variety of decision variable grouping algorithms have been proposed. However, these algorithms are relatively broad for the changes of most decision variables in the evolution process and are time-consuming in the process of finding the Pareto frontier. To solve these problems, a multi-objective optimization algorithm for grouping decision variables based on extreme point Pareto frontier (MOEA-DV/EPF) is proposed. This algorithm adopts a preprocessing rule to solve the Pareto optimal solution set of extreme points generated by simultaneous evolution in various target directions, obtains the basic Pareto front surface to determine the convergence effect, and analyzes the convergence and distribution effects of decision variables. In the later stages of algorithm optimization, different mutation strategies are adopted according to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals, thus enhancing the performance of the algorithm. Evaluation validation of the test functions shows that this algorithm can solve the multi-objective optimization problem more efficiently. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. Comparative Analysis of Time-Slotted Channel Hopping Schedule Optimization Using Priority-Based Customized Differential Evolution Algorithm in Heterogeneous IoT Networks †.
- Author
-
Vatankhah, Aida and Liscano, Ramiro
- Subjects
DIFFERENTIAL evolution ,TIME complexity ,WIRELESS sensor networks ,ALGORITHMS ,INTERNET of things ,COMPARATIVE studies - Abstract
The Time-Slotted Channel Hopping (TSCH) protocol is known for its suitability in highly reliable applications within industrial wireless sensor networks. One of the most significant challenges in TSCH is determining a schedule with a minimal slotframe size that can meet the required throughput for a heterogeneous network. We proposed a Priority-based Customized Differential Evolution (PCDE) algorithm based on the determination of a collision- and interference-free transmission graph. Our schedule can encompass sensors with different data rates in the given slotframe size. This study presents a comprehensive performance evaluation of our proposed algorithm and compares the results to the Traffic-Aware Scheduling Algorithm (TASA). Sufficient simulations were performed to evaluate different metrics such as the slotframe size, throughput, delay, time complexity, and Packet Delivery Ratio (PDR) to prove that our approach achieves a significant result compared with this method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
49. Mutation-driven and population grouping PRO algorithm for scheduling budget-constrained workflows in the cloud.
- Author
-
Li, Huifang, Chen, Bing, Huang, Jingwei, Cañizares Abreu, Julio Ruben, Chai, Senchun, and Xia, Yuanqing
- Subjects
OPTIMIZATION algorithms ,METAHEURISTIC algorithms ,WORKFLOW ,MIDDLE class ,CONSTRAINT algorithms ,CLOUD computing ,DIFFERENTIAL evolution ,ALGORITHMS ,PRODUCTION scheduling - Abstract
Benefiting from cloud computing's elasticity, scalability, and pay-per-use model, more and more scientific applications are deployed in or migrated to the cloud. Workflow scheduling still faces many challenges due to the growing scales of workflows and the diversified user QoS requirements. In this work, we propose a Mutation-driven and population Grouping Poor and Rich Optimization algorithm (MG-PRO) for scheduling workflows in the cloud to minimize makespan while satisfying the budget constraints. Specifically, we first adopt the middle-class sub-population into the original Poor and Rich Optimization algorithm (PRO), and develop the update strategies for rich and middle-class sub-populations to increase the randomness and search diversity. Secondly, the update mechanism for rich individuals is enriched, and the middle-class sub-population is guided by elite rich individuals, which enhances the information exchange and sharing among sub-populations. Finally, an evolution-aware mutation strategy is designed, where the mutation probability is adjusted adaptively as the dynamic monitoring of the population update process, and the two-point and triangular crossover-based mutations are used alternately to intervene the evolution trajectory according to the degree of objective optimization, resulting in a better balance between exploration and exploration. Extensive experiments are conducted on well-known scientific workflows with different types and scales through WorkflowSim. The experimental results show that, in most cases, MG-PRO outperforms existing algorithms in terms of constraint satisfiability, solution quality and stability. It can generate near-optimal solutions with the different budget constraints satisfied in a relatively short time, for example, the makespan resulting from MG-PRO is at most 59.95% shorter than other meta-heuristic algorithms, and at least 7.33% shorter than all its peers. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
50. Improved Differential Evolution Algorithm Guided by Best and Worst Positions Exploration Dynamics.
- Author
-
Kumar, Pravesh and Ali, Musrrat
- Subjects
DIFFERENTIAL evolution ,EVOLUTIONARY algorithms ,ALGORITHMS ,METAHEURISTIC algorithms - Abstract
The exploration of premium and new locations is regarded as a fundamental function of every evolutionary algorithm. This is achieved using the crossover and mutation stages of the differential evolution (DE) method. A best-and-worst position-guided novel exploration approach for the DE algorithm is provided in this study. The proposed version, known as "Improved DE with Best and Worst positions (IDEBW)", offers a more advantageous alternative for exploring new locations, either proceeding directly towards the best location or evacuating the worst location. The performance of the proposed IDEBW is investigated and compared with other DE variants and meta-heuristics algorithms based on 42 benchmark functions, including 13 classical and 29 non-traditional IEEE CEC-2017 test functions and 3 real-life applications of the IEEE CEC-2011 test suite. The results prove that the proposed approach successfully completes its task and makes the DE algorithm more efficient. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.