Initial alignment for point cloud registration by improved differential evolution algorithm

Optik ◽  
2021 ◽  
pp. 166856
Author(s):  
Hai Liu ◽  
Shulin Wang ◽  
Donghong Zhao
Keyword(s):  
Differential Evolution ◽  
Point Cloud ◽  
Differential Evolution Algorithm ◽  
Initial Alignment ◽  
Point Cloud Registration ◽  
Evolution Algorithm ◽  
Improved Differential Evolution Algorithm

The Economic Dispatch of Wind Integrated Power System based on an Improved Differential Evolution Algorithm

2020 ◽  
Vol 13 (3) ◽  
pp. 384-395
Author(s):  
Haiqing Liu ◽  
Jinmeng Qu ◽  
Yuancheng Li
Keyword(s):  
Differential Evolution ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Economic Dispatch ◽  
Differential Evolution Algorithm ◽  
Bee Colony ◽  
Evolution Algorithm ◽  
Improved Differential Evolution Algorithm ◽  
Dynamic Economic Dispatch ◽  
Integrated Power System

Background: As more and more renewable energy such as wind energy is connected to the power grid, the static economic dispatch in the past cannot meet its needs, so the dynamic economic dispatch of the power grid is imperative. Methods: Hence, in this paper, we proposed an Improved Differential Evolution algorithm (IDE) based on Differential Evolution algorithm (DE) and Artificial Bee Colony algorithm (ABC). Firstly, establish the dynamic economic dispatch model of wind integrated power system, in which we consider the power balance constraints as well as the generation limits of thermal units and wind farm. The minimum power generation costs are taken as the objectives of the model and the wind speed is considered to obey the Weibull distribution. After sampling from the probability distribution, the wind speed sample is converted into wind power. Secondly, we proposed the IDE algorithm which adds the local search and global search thoughts of ABC algorithm. The algorithm provides more local search opportunities for individuals with better evolution performance according to the thought of artificial bee colony algorithm to reduce the population size and improve the search performance. Results: Finally, simulations are performed by the IEEE-30 bus example containing 6 generations. By comparing the IDE with the other optimization model like ABC, DE, Particle Swarm Optimization (PSO), the experimental results show that obtained optimal objective function value and power loss are smaller than the other algorithms while the time-consuming difference is minor. The validity of the proposed method and model is also demonstrated. Conclusion: The validity of the proposed method and the proposed dispatch model is also demonstrated. The paper also provides a reference for economic dispatch integrated with wind power at the same time.

scholarly journals An Extended Flexible Job Shop Scheduling Model for Flight Deck Scheduling with Priority, Parallel Operations, and Sequence Flexibility

2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Lianfei Yu ◽  
Cheng Zhu ◽  
Jianmai Shi ◽  
Weiming Zhang
Keyword(s):  
Differential Evolution ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Time Budget ◽  
Differential Evolution Algorithm ◽  
Mixed Integer ◽  
Aircraft Carrier ◽  
Evolution Algorithm ◽  
Improved Differential Evolution Algorithm ◽  
Flight Deck

Efficient scheduling for the supporting operations of aircrafts in flight deck is critical to the aircraft carrier, and even several seconds’ improvement may lead to totally converse outcome of a battle. In the paper, we ameliorate the supporting operations of carrier-based aircrafts and investigate three simultaneous operation relationships during the supporting process, including precedence constraints, parallel operations, and sequence flexibility. Furthermore, multifunctional aircrafts have to take off synergistically and participate in a combat cooperatively. However, their takeoff order must be restrictively prioritized during the scheduling period accorded by certain operational regulations. To efficiently prioritize the takeoff order while minimizing the total time budget on the whole takeoff duration, we propose a novel mixed integer liner programming formulation (MILP) for the flight deck scheduling problem. Motivated by the hardness of MILP, we design an improved differential evolution algorithm combined with typical local search strategies to improve computational efficiency. We numerically compare the performance of our algorithm with the classical genetic algorithm and normal differential evolution algorithm and the results show that our algorithm obtains better scheduling schemes that can meet both the operational relations and the takeoff priority requirements.

Research and Improvement on K-Means Clustering Algorithm

2013 ◽  
Vol 756-759 ◽  
pp. 3231-3235
Author(s):  
Xue Mei Wang ◽  
Jin Bo Wang
Keyword(s):  
Differential Evolution ◽  
Clustering Algorithm ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Clustering Quality ◽  
Local Optimal Solution ◽  
Evolution Algorithm ◽  
Clustering Center ◽  
Searching Ability ◽  
Improved Differential Evolution Algorithm

According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. A differential evolution algorithm which was a kind of a heuristic global optimization algorithm based on population was introduced in this article, then put forward an improved differential evolution algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved initial centers optimization problem of k-means clustering algorithm well, had a better searching ability,and more effectively improved clustering quality and convergence speed.

Sign in / Sign up

Export Citation Format

Share Document