scholarly journals Minimization of Keane's Bump Function by the Repulsive Particle Swarm and the Differential Evolution Methods

2007 ◽  
Author(s):  
S. K. Mishra
Keyword(s):  
Differential Evolution ◽  
Particle Swarm ◽  
Bump Function

scholarly journals Performance Comparison between Particle Swarm Optimization and Differential Evolution Algorithms for Postman Delivery Routing Problem

2021 ◽  
Vol 11 (6) ◽  
pp. 2703
Author(s):  
Warisa Wisittipanich ◽  
Khamphe Phoungthong ◽  
Chanin Srisuwannapa ◽  
Adirek Baisukhan ◽  
Nuttachat Wisittipanit
Keyword(s):  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Particle Swarm ◽  
Performance Comparison ◽  
Swarm Optimization ◽  
Routing Problem ◽  
Metaheuristic Methods ◽  
Evolution Algorithms ◽  
Differential Evolution Algorithms ◽  
Current Practices

Generally, transportation costs account for approximately half of the total operation expenses of a logistics firm. Therefore, any effort to optimize the planning of vehicle routing would be substantially beneficial to the company. This study focuses on a postman delivery routing problem of the Chiang Rai post office, located in the Chiang Rai province of Thailand. In this study, two metaheuristic methods—particle swarm optimization (PSO) and differential evolution (DE)—were applied with particular solution representation to find delivery routings with minimum travel distances. The performances of PSO and DE were compared along with those from current practices. The results showed that PSO and DE clearly outperformed the actual routing of the current practices in all the operational days examined. Moreover, DE performances were notably superior to those of PSO.

scholarly journals Convergence Analysis of Particle Swarm Optimizer and Its Improved Algorithm Based on Velocity Differential Evolution

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Hongtao Ye ◽  
Wenguang Luo ◽  
Zhenqiang Li
Keyword(s):  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Particle Velocity ◽  
Particle Swarm ◽  
Search Space ◽  
Particle Swarm Optimizer ◽  
Swarm Optimization ◽  
Relationship Of ◽  
The Relationship ◽  
Improved Algorithm

This paper presents an analysis of the relationship of particle velocity and convergence of the particle swarm optimization. Its premature convergence is due to the decrease of particle velocity in search space that leads to a total implosion and ultimately fitness stagnation of the swarm. An improved algorithm which introduces a velocity differential evolution (DE) strategy for the hierarchical particle swarm optimization (H-PSO) is proposed to improve its performance. The DE is employed to regulate the particle velocity rather than the traditional particle position in case that the optimal result has not improved after several iterations. The benchmark functions will be illustrated to demonstrate the effectiveness of the proposed method.

scholarly journals An Optimization Algorithms-based Approach to District Health System Population Areas in Iran

2020 ◽  
Author(s):  
Javad Tayyebi ◽  
Sobhan Mostafayi Darmian
Keyword(s):  
Differential Evolution ◽  
Health System ◽  
Healthcare System ◽  
Operations Management ◽  
Particle Swarm ◽  
Healthcare Management ◽  
System Structure ◽  
Particle Swarm Algorithm ◽  
District Health ◽  
Strategic Model

Background: One of important subject in the operations' management fields is partitioning matter that was investigated in the study. This topic has recently received more attention from researchers of the healthcare management systems' field. This subject is important because planning about improvement of the healthcare system structure is considered as one of the most important management problems in each society. The goal of solving this problem was to district a society into several areas, so that each area can cover its  health services completely. Methods: This fundamental-applied study was conducted based on the Genetic optimization algorithm, particle swarm, and differential evolution to improve the current structures with regard to the existing health structure in Iran. Moreover, the health system strategic model was applied to categorize the population regions into 10 partitions. According to nature of the investigated problem, the objective function is maximizing the equilibrium amount in each district. The constraints included exclusive assignment and not-existing unusual assignment. Unusual assignment is defined as existence of no contiguity and holes in partitions. Results: According to the obtained results, the particle swarm algorithm had the most efficiency, while differential evolution had the lowest efficiency. However, the stated constraints were satisfied completely in all algorithms, which represented appropriate efficiency of the modified algorithm in the generation solutions. Conclusion: The results obtained from solving this problem can be used as a useful tool in improving the existing healthcare system in Iran.

scholarly journals An Adaptive Genetic Algorithm-based Background Elimination Model for English Text

2021 ◽  
Author(s):  
Tang Xiaohui
Keyword(s):  
Genetic Algorithm ◽  
Feature Extraction ◽  
Differential Evolution ◽  
Recognition Accuracy ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
English Text ◽  
Adaptive Genetic Algorithm ◽  
Feature Sets ◽  
Background Elimination

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