scholarly journals A discrete differential evolution for fuel loading optimization of the DNRR research reactor and comparison with genetic algorithm

2021 ◽  
Vol 1932 (1) ◽  
pp. 012001
Author(s):  
Giang T T Phan ◽  
Hoai-Nam Tran ◽  
Quang Binh Do ◽  
Quang Huy Ngo
2013 ◽  
Vol 303-306 ◽  
pp. 2227-2230 ◽  
Author(s):  
Ling Juan Hou ◽  
Zhi Jiang Hou

Aiming at the stochastic vehicle routing problems with simultaneous pickups and deliveries, a novel discrete differential evolution algorithm is proposed for routes optimization. The algorithm can directly be used for the discrete domain by special design. Computational simulations and comparisons based on a medium-sized problem of SVRPSPD is provided. Results demonstrate that the proposed algorithm obtains better results than the basic differential evolution algorithm and the existing genetic algorithm.


2019 ◽  
Vol 8 (5) ◽  
pp. 237 ◽  
Author(s):  
Fuyu Lu ◽  
Jiqiu Deng ◽  
Shiyu Li ◽  
Hao Deng

Label placement is a difficult problem in automated map production. Many methods have been proposed to automatically place labels for various types of maps. While the methods are designed to automatically and effectively generate labels for the point, line and area features, less attention has been paid to the problem of jointly labeling all the different types of geographical features. In this paper, we refer to the labeling of all the graphic features as the multiple geographical feature label placement (MGFLP) problem. In the MGFLP problem, the overlapping and occlusion among labels and corresponding features produces poorly arranged labels, and results in a low-quality map. To solve the problem, a hybrid algorithm combining discrete differential evolution and the genetic algorithm (DDEGA) is proposed to search for an optimized placement that resolves the MGFLP problem. The quality of the proposed solution was evaluated using a weighted metric regarding a number of cartographical rules. Experiments were carried out to validate the performance of the proposed method in a set of cartographic tasks. The resulting label placement demonstrates the feasibility and the effectiveness of our method.


2020 ◽  
Vol 362 ◽  
pp. 110582 ◽  
Author(s):  
Giang T.T. Phan ◽  
Quang Binh Do ◽  
Quang Huy Ngo ◽  
Tuan Anh Tran ◽  
Hoai-Nam Tran

Author(s):  
Ali Kaveh ◽  
S.R. Hoseini Vaez ◽  
Pedram Hosseini

In this study, the Modified Dolphin Monitoring (MDM) operator is used to enhance the performance of some metaheuristic algorithms. The MDM is a recently presented operator that controls the population dispersion in each iteration. Algorithms are selected from some well-established algorithms. Here, this operator is applied on Differential Evolution (DE), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Vibrating Particles System (VPS), Enhanced Vibrating Particles System (EVPS), Colliding Bodied Optimization (CBO) and Harmony Search (HS) and the performance of these algorithms are evaluated with and without this operator on three well-known structural optimization problems. The results show the performance of this operator on these algorithms for the best, the worst, average and average weight of the first quarter of answers.


2021 ◽  
Author(s):  
Tang Xiaohui

Abstract In this paper, an adaptive genetic algorithm is used to conduct an in-depth study and analysis of English text background elimination, and a corresponding model is designed. The curve results after the initial character editorialization are curved and transformed, and the adaptive genetic algorithm is used for the transformation to solve the influence of multiple inflection points of curve images on feature extraction. Then, using the minimum deviation method, the error values of the input characters and the sample set in the spatial coordinate system are calculated, and the deviation values of the angle and the straight line are used to match the characters with the smallest deviation value to match the highest degree. A genetic algorithm is introduced to iterate the feature sets of angles and line segments, and the optimal features are finally derived in the process of cross evolution of generations to improve the recognition accuracy. And the character library is used as input items for average grouping for experiments, and the obtained feature sets are put into the position matrix and compared with the samples in the database one by one. It is found that the improved stroke-structure feature extraction algorithm based on a genetic algorithm can improve the recognition accuracy and better accomplish the recognition task with better results compared to others. Finally, by analyzing the limitations and characteristics of traditional particle swarm optimization algorithm and differential evolution algorithm, and giving full play to the advantages and applicability of different algorithms, a new differential evolution particle swarm algorithm with better performance and more stable performance is proposed. The algorithm is based on the PSO algorithm, and when the population update of the PSO algorithm is stagnant and the search space is limited, the crossover and mutation operations of the DE algorithm are used to perturb the population, increase the diversity of the population, and improve the global optimization ability of the algorithm. The algorithm is tested on a common dataset for text mining to verify the effectiveness and feasibility of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document