Research on Applying Unidirectional Loop Layout to Optimize Facility Layout in Workshop Based on Improved Genetic Algorithm

2009 ◽  
Author(s):  
Yi Zhang ◽  
Hu Zhang ◽  
Min-min Xia ◽  
Tong-tong Lu ◽  
Li-ling Jiang
Keyword(s):  
Genetic Algorithm ◽  
Facility Layout ◽  
Improved Genetic Algorithm ◽  
Loop Layout

An Improved Genetic Algorithm for Digital Facility Layout Optimization Oriented Multi-Species and Variable-Batch Production Mode

2013 ◽  
Vol 694-697 ◽  
pp. 3632-3635
Author(s):  
Dao Guo Li ◽  
Zhao Xia Chen
Keyword(s):  
Genetic Algorithm ◽  
Facility Layout ◽  
Optimal Solution ◽  
Convergence Speed ◽  
Improved Genetic Algorithm ◽  
Layout Problem ◽  
Batch Production ◽  
Production Mode ◽  
Slow Convergence ◽  
Weak Points

When solving facility layout problem for the digital workshop to optimize the production, the traditional genetic algorithm has its flaws with slow convergence speed and that the accuracy of the optimal solution is not ideal. This paper analyzes those weak points and proposed an improved genetic algorithm according to the characteristics of multi-species and variable-batch production mode. The proposed approach improved the convergence speed and the accuracy of the optimal solution. The presented model of GA also has been tested and verified by simulation.

Multi-Objective Optimization of Manufacturing Workshop Layout Based on Improved Genetic Algorithm

2013 ◽  
Vol 860-863 ◽  
pp. 2664-2668
Author(s):  
Bi Hong Tang ◽  
Zhi Xia Zhang
Keyword(s):  
Genetic Algorithm ◽  
Mutation Rate ◽  
Facility Layout ◽  
Adaptive Genetic Algorithm ◽  
Multi Objective Optimization ◽  
Improved Genetic Algorithm ◽  
Multi Objective ◽  
Crossover Rate ◽  
Mutation Strategy ◽  
Adaptive Crossover

A good manufacturing workshop layout can influence the profit of the manufacturing enterprises after the product coming on stream. Facility layout of workshop is a combinational optimization problem. The multi-objective optimization model which integrates the available problem of facility layout of workshop is established. Adaptive Genetic Algorithm is presented because of the disadvantage of simple Genetic Algorithm in solving this model. This algorithm use the adaptive crossover and mutation strategy which is used to nonlinear processing for crossover rate and mutation rate, then crossover rate and mutation rate are changed with the colony adaptation degree of each generation. It has some advantage, such as higher search speed, higher convergence precision, and so on. Finally an example is used to show the effectiveness of the method.

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

Sign in / Sign up

Export Citation Format

Share Document