An Improved Genetic Algorithm on Hybrid Information Scheduling

2019 ◽  
Vol 13 (4) ◽  
pp. 416-423 ◽  
Author(s):  
Jingmei Li ◽  
Qiao Tian ◽  
Fangyuan Zheng ◽  
Weifei Wu
Keyword(s):  
Genetic Algorithm ◽  
Convergence Rate ◽  
Scheduling Algorithm ◽  
Optimal Solution ◽  
Selection Strategy ◽  
Initial Population ◽  
List Scheduling ◽  
Solution Quality ◽  
Fitness Value ◽  
Information Scheduling

Background: Patents suggest that efficient hybrid information scheduling algorithm is critical to achieve high performance for heterogeneous multi-core processors. Because the commonly used list scheduling algorithm obtains the approximate optimal solution, and the genetic algorithm is easy to converge to the local optimal solution and the convergence rate is slow. Methods: To solve the above two problems, the thesis proposes a hybrid algorithm integrating list scheduling and genetic algorithm. Firstly, in the task priority calculation phase of the list scheduling algorithm, the total cost of the current task node to the exit node and the differences of its execution cost on different processor cores are taken into account when constructing the task scheduling list, then the task insertion method is used in the task allocation phase, thus obtaining a better scheduling sequence. Secondly, the pre-acquired scheduling sequence is added to the initial population of the genetic algorithm, and then a dynamic selection strategy based on fitness value is adopted in the phase of evolution. Finally, the cross and mutation probability in the genetic algorithm is improved to avoid premature phenomenon. Results: With a series of simulation experiments, the proposed algorithm is proved to have a faster convergence rate and a higher optimal solution quality. Conclusion: The experimental results show that the ICLGA has the highest quality of the optimal solution than CPOP and GA, and the convergence rate of ICLGA is faster than that of GA.

A Natural Evolution Based Numerical Optimisation Framework to Develop and Enhance Airfoil-Slat Arrangement

2019 ◽  
Author(s):  
Sushrut Kumar ◽  
Priyam Gupta ◽  
Raj Kumar Singh
Keyword(s):  
Genetic Algorithm ◽  
Fitness Function ◽  
Fuel Efficiency ◽  
Optimal Solution ◽  
Leading Edge ◽  
Initial Population ◽  
Invasive Weed ◽  
Fitness Value ◽  
Leading Edge Slats ◽  
Dynamics Simulations

Abstract Leading Edge Slats are popularly being put into practice due to their capability to provide a significant increase in the lift generated by the wing airfoil and decrease in the stall. Consequently, their optimum design is critical for increased fuel efficiency and minimized environmental impact. This paper attempts to develop and optimize the Leading-Edge Slat geometry and its orientation with respect to airfoil using Genetic Algorithm. The class of Genetic Algorithm implemented was Invasive Weed Optimization as it showed significant potential in converging design to an optimal solution. For the study, Clark Y was taken as test airfoil. Slats being aerodynamic devices require smooth contoured surfaces without any sharp deformities and accordingly Bézier airfoil parameterization method was used. The design process was initiated by producing an initial population of various profiles (chromosomes). These chromosomes are composed of genes which define and control the shape and orientation of the slat. Control points, Airfoil-Slat offset and relative chord angle were taken as genes for the framework and different profiles were acquired by randomly modifying the genes within a decided design space. To compare individual chromosomes and to evaluate their feasibility, the fitness function was determined using Computational Fluid Dynamics simulations conducted on OpenFOAM. The lift force at a constant angle of attack (AOA) was taken as fitness value. It was assigned to each chromosome and the process was then repeated in a loop for different profiles and the fittest wing slat arrangement was obtained which had an increase in CL by 78% and the stall angle improved to 22°. The framework was found capable of optimizing multi-element airfoil arrangements.

Distribution Network Reactive Power Planning Based on Improved Evolutionary Strategy Theory

2013 ◽  
Vol 732-733 ◽  
pp. 1023-1028
Author(s):  
Si Qing Sheng ◽  
Xing Li ◽  
Yang Lu
Keyword(s):  
Reactive Power ◽  
Distribution Network ◽  
Load Condition ◽  
Optimal Solution ◽  
Evolution Strategy ◽  
Evolutionary Strategy ◽  
Initial Population ◽  
Fitness Value ◽  
Cauchy Mutation ◽  
Reactive Power Planning

In this paper a distribution network reactive power planning mathematical model was established, taking the minimized sum of electrical energy loss at the different load operation modes and the investment for reactive power compensation equipments as objective function to solve the planning question respectively and taking the transformer tap as equality constraint. The evolution strategy is improved, The Euclidean distance is introduced into the formation of the initial population, and the initial population under the max load operation mode is based on the optimal solution of the min load condition. The Cauchy mutation and variation coefficient are introduced into the evolution strategy method. By means of improvement of fitness to ensure diversity of population in early and accuracy of the fitness value.

scholarly journals Design of Gas Cyclone Using Hybrid Particle Swarm Optimization Algorithm

2021 ◽  
Vol 11 (20) ◽  
pp. 9772
Author(s):  
Xueli Shen ◽  
Daniel C. Ihenacho
Keyword(s):  
Particle Swarm Optimization ◽  
Research Effort ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Design Parameters ◽  
Initial Population ◽  
Swarm Optimization ◽  
Hybrid Particle Swarm Optimization ◽  
Fitness Value ◽  
Sensitivity Approach

The method of searching for an optimal solution inspired by nature is referred to as particle swarm optimization. Differential evolution is a simple but effective EA for global optimization since it has demonstrated strong convergence qualities and is relatively straightforward to comprehend. The primary concerns of design engineers are that the traditional technique used in the design process of a gas cyclone utilizes complex mathematical formulas and a sensitivity approach to obtain relevant optimal design parameters. The motivation of this research effort is based on the desire to simplify complex mathematical models and the sensitivity approach for gas cyclone design with the use of an objective function, which is of the minimization type. The process makes use of the initial population generated by the DE algorithm, and the stopping criterion of DE is set as the fitness value. When the fitness value is not less than the current global best, the DE population is taken over by PSO. For each iteration, the new velocity and position are updated in every generation until the optimal solution is achieved. When using PSO independently, the adoption of a hybridised particle swarm optimization method for the design of an optimum gas cyclone produced better results, with an overall efficiency of 0.70, and with a low cost at the rate of 230 cost/second.

Study on the Improvement of Genetic Algorithm by Using Vehicle Routing Problem

2013 ◽  
Vol 365-366 ◽  
pp. 194-198 ◽  
Author(s):  
Mei Ni Guo
Keyword(s):  
Genetic Algorithm ◽  
Optimal Solution ◽  
Mathematic Model ◽  
Simulation Software ◽  
Initial Population ◽  
Planning Problem ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Search Speed ◽  
Vehicle Path

mprove the existing genetic algorithm, make the vehicle path planning problem solving can be higher quality and faster solution. The mathematic model for study of VRP with genetic algorithms was established. An improved genetic algorithm was proposed, which consist of a new method of initial population and partheno genetic algorithm revolution operation.Exploited Computer Aided Platform and Validated VRP by simulation software. Compared this improved genetic algorithm with the existing genetic algorithm and approximation algorithms through an example, convergence rate Much faster and the Optimal results from 117.0km Reduced to 107.8km,proved that this article improved genetic algorithm can be faster to reach an optimal solution. The results showed that the improved GA can keep the variety of cross and accelerate the search speed.

Based on Improved Genetic Algorithm for Task Scheduling of Heterogeneous Multi-Core Processor

2014 ◽  
Vol 1030-1032 ◽  
pp. 1671-1675
Author(s):  
Yue Qiu ◽  
Jing Feng Zang
Keyword(s):  
Genetic Algorithm ◽  
Task Scheduling ◽  
Execution Time ◽  
Scheduling Algorithm ◽  
Experimental Results ◽  
Initial Population ◽  
Improved Genetic Algorithm ◽  
High Quality ◽  
Multi Core Processor ◽  
Better Than

This paper puts forward an improved genetic scheduling algorithm in order to improve the execution efficiency of task scheduling of the heterogeneous multi-core processor system and give full play to its performance. The attribute values and the high value of tasks were introduced to structure the initial population, randomly selected a method with the 50% probability to sort for task of individuals of the population, thus to get high quality initial population and ensured the diversity of the population. The experimental results have shown that the performance of the improved algorithm was better than that of the traditional genetic algorithm and the HEFT algorithm. The execution time of tasks was reduced.

Blower Resource Scheduling Based on Elite Genetic Algorithm

2011 ◽  
Vol 219-220 ◽  
pp. 591-595 ◽  
Author(s):  
Guang Nian Yang ◽  
Wei Qi ◽  
Jun Zhou
Keyword(s):  
Genetic Algorithm ◽  
High Efficiency ◽  
Scheduling Algorithm ◽  
Sewage Treatment ◽  
Resource Scheduling ◽  
Optimal Solution ◽  
Task Completion ◽  
Toxic Substances ◽  
Improved Genetic Algorithm ◽  
Grid Resource

Now, our sewage treatment industry mainly depends on the blower of aeration act as metabolic, absorbed in the toxic substances. Blower resources management is the key issue of sewage treatment. Traditional resource scheduling algorithm exist some defects, for example it can not well meet the quality requirements and can not get the optimal solution. This article gives a new resource scheduling method based on improved genetic algorithm. It achieves grid resource scheduling by using real number encoding and activities point crossover. Experiments show that genetic algorithm can reduce executing time and task completion time, and further improve the scalability of resource scheduling model. This algorithm has stability and high efficiency in grid environment.

scholarly journals About the influence of features of fitness-functions on the convergence of the genetic algorithm

2020 ◽  
pp. 362-367
Author(s):  
I.O. Lukianov ◽  
◽  
F.A. Lytvynenko ◽  
Keyword(s):  
Genetic Algorithm ◽  
Convergence Rate ◽  
Random Effect ◽  
Optimal Solution ◽  
Computer Experiments ◽  
Effective Control ◽  
Fitness Functions ◽  
Parallel Version ◽  
Adaptive Capabilities ◽  
Significant Factors

The adaptive capabilities of a parallel version of a multipopulation genetic algorithm are considered depending on the characteristics of certain classes of fitness-functions. Ways are proposed to increase the rate of convergence to the optimal solution based on effective control of algorithm parameters and strategies for the exchange of chromosome-solutions between populations. The results of computer experiments with the optimization of fitness-functions with various ratios of insignificant and significant factors are presented. The dependence of the convergence rate of the algorithm in the presence of a random effect on the values of fitness-functions is studied.

scholarly journals A Hyper Heuristics Technique for Data Partitioning and Scheduling to Heterogeneous Systems using Genetic Algorithm and Improved Particle Swarm Optimization

2019 ◽  
Vol 8 (2S8) ◽  
pp. 1696-1701
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Scheduling Algorithm ◽  
Particle Swarm ◽  
Optimal Number ◽  
Data Partitioning ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Fitness Value ◽  
Real Coded Genetic Algorithm

Development of the load partitioning for multiple round load distribution and effective scheduling of partitioned load to heterogeneous processor is primary goal of distributed and parallel system. In this paper, we propose hyper heuristics scheduling algorithm for load partitioning using genetic and improved particle swarm optimization techniques.A communication model is used to predict the optimal activation order, optimal number of processor and optimal number of rounds of the load. Heuristics Based Scheduling Algorithm is proposed using Hyper Heuristic Scheduling which is used to find the candidate solution (low level heuristic) to form Scheduling Solutions (heuristics algorithms) for large scale system with diversity operator as sequence dependent and sequence independent scheduling. For this solution, processing time of the entire processing load will be reduced. Hybrid Real Code genetic algorithm(HRGA) computes optimal activation order with cross over and mutation operator without considering the processor latency and different types of variation in the perturbation parameters. In order to optimize this issue, we utilizeImproved Particle swarm optimization (IPSO) determine the load fraction for generating activation order in terms of dynamically predicting fitness value of the processor with certain number. The Simulation analysis demonstrates the proposed model performance in terms of mean, standard deviation, computational complexity and Average Execution Time comparing against hybrid real coded genetic algorithm

An Improved Genetic Algorithm of Web Services Composition with QOS

2012 ◽  
Vol 532-533 ◽  
pp. 1836-1840 ◽  
Author(s):  
Yan Yan Zhang ◽  
Hai Ling Xiong ◽  
Yong Chun Zhang
Keyword(s):  
Genetic Algorithm ◽  
Web Services ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Experimental Result ◽  
Web Services Composition ◽  
Improved Genetic Algorithm ◽  
Search Range ◽  
Services Composition ◽  
Fitness Value

A web service composition method based on the adaptive genetic operator was proposed to deal with the issues of the lack of adaptability and the easy-premature phenomena in web services composition genetic algorithm. Adaptive crossover and mutation operator were designed according to the individual adaptability and evolution stage for enlarging local search range and increasing convergent speed. Moreover, use for reference the idea of taboo table in taboo search algorithm, we can inhibit the algorithm from converging to false optimal solution untimely; meanwhile, an evolution strategy was adopted to prevent the loss of composite service with high fitness value. The experimental result shows that better composite services can be gotten through the improved algorithm; moreover the convergence speed has also been improved.

scholarly journals Compact Genetic Algorithm for Performance Improvement in Hierarchical Sensor Networks Management

2006 ◽  
Vol 07 (01) ◽  
pp. 101-115 ◽  
Author(s):  
Ming-Hui Jin ◽  
D. Frank Hsu ◽  
Cheng-Yan Kao
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Experimental Result ◽  
Scheduling Problem ◽  
Solution Quality ◽  
Compact Genetic Algorithm ◽  
Hierarchical Wireless Sensor Networks

This paper introduces a novel scheduling problem called the active interval scheduling problem in hierarchical wireless sensor networks for long-term periodical monitoring applications. To improve the report sensitivity of the hierarchical wireless sensor networks, an efficient scheduling algorithm is desired. Therefore, in this paper, we propose a compact genetic algorithm (CGA) to optimize the solution quality for sensor network maintenance. The experimental result shows that the proposed CGA brings better solutions in acceptable calculation time.

Sign in / Sign up

Export Citation Format

Share Document