Research and Applications of Shop Scheduling Based on Genetic Algorithms
ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic algorithm has solved the limitations that existed in the genetic algorithm, the objective function is able to meet customers' needs for shop scheduling, and the future research should focus on the combination of genetic algorithm with other optimized algorithms. In this paper, in order to overcome the shortcomings of early convergence of genetic algorithm and resolve local minimization problem in search process,aiming at mixed flow shop scheduling problem, an improved cyclic search genetic algorithm is put forward, and chromosome coding method and corresponding operation are given.The operation has the nature of inheriting the optimal individual ofthe previous generation and is able to avoid the emergence of local minimum, and cyclic and crossover operation and mutation operation can enhance the diversity of the population and then quickly get the optimal individual, and the effectiveness of the algorithm is validated. Experimental results show that the improved algorithm can well avoid the emergency of local minimum and is rapid in convergence.
Main Authors: | , |
---|---|
Format: | Digital revista |
Language: | English |
Published: |
Instituto de Tecnologia do Paraná - Tecpar
2016
|
Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1516-89132016000200601 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
oai:scielo:S1516-89132016000200601 |
---|---|
record_format |
ojs |
spelling |
oai:scielo:S1516-891320160002006012016-10-18Research and Applications of Shop Scheduling Based on Genetic AlgorithmsZHAO,HangKONG,Fansen shop scheduling genetic algorithm local minimization cyclic search ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic algorithm has solved the limitations that existed in the genetic algorithm, the objective function is able to meet customers' needs for shop scheduling, and the future research should focus on the combination of genetic algorithm with other optimized algorithms. In this paper, in order to overcome the shortcomings of early convergence of genetic algorithm and resolve local minimization problem in search process,aiming at mixed flow shop scheduling problem, an improved cyclic search genetic algorithm is put forward, and chromosome coding method and corresponding operation are given.The operation has the nature of inheriting the optimal individual ofthe previous generation and is able to avoid the emergence of local minimum, and cyclic and crossover operation and mutation operation can enhance the diversity of the population and then quickly get the optimal individual, and the effectiveness of the algorithm is validated. Experimental results show that the improved algorithm can well avoid the emergency of local minimum and is rapid in convergence.info:eu-repo/semantics/openAccessInstituto de Tecnologia do Paraná - TecparBrazilian Archives of Biology and Technology v.59 n.spe 20162016-01-01info:eu-repo/semantics/articletext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S1516-89132016000200601en10.1590/1678-4324-2016160545 |
institution |
SCIELO |
collection |
OJS |
country |
Brasil |
countrycode |
BR |
component |
Revista |
access |
En linea |
databasecode |
rev-scielo-br |
tag |
revista |
region |
America del Sur |
libraryname |
SciELO |
language |
English |
format |
Digital |
author |
ZHAO,Hang KONG,Fansen |
spellingShingle |
ZHAO,Hang KONG,Fansen Research and Applications of Shop Scheduling Based on Genetic Algorithms |
author_facet |
ZHAO,Hang KONG,Fansen |
author_sort |
ZHAO,Hang |
title |
Research and Applications of Shop Scheduling Based on Genetic Algorithms |
title_short |
Research and Applications of Shop Scheduling Based on Genetic Algorithms |
title_full |
Research and Applications of Shop Scheduling Based on Genetic Algorithms |
title_fullStr |
Research and Applications of Shop Scheduling Based on Genetic Algorithms |
title_full_unstemmed |
Research and Applications of Shop Scheduling Based on Genetic Algorithms |
title_sort |
research and applications of shop scheduling based on genetic algorithms |
description |
ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic algorithm has solved the limitations that existed in the genetic algorithm, the objective function is able to meet customers' needs for shop scheduling, and the future research should focus on the combination of genetic algorithm with other optimized algorithms. In this paper, in order to overcome the shortcomings of early convergence of genetic algorithm and resolve local minimization problem in search process,aiming at mixed flow shop scheduling problem, an improved cyclic search genetic algorithm is put forward, and chromosome coding method and corresponding operation are given.The operation has the nature of inheriting the optimal individual ofthe previous generation and is able to avoid the emergence of local minimum, and cyclic and crossover operation and mutation operation can enhance the diversity of the population and then quickly get the optimal individual, and the effectiveness of the algorithm is validated. Experimental results show that the improved algorithm can well avoid the emergency of local minimum and is rapid in convergence. |
publisher |
Instituto de Tecnologia do Paraná - Tecpar |
publishDate |
2016 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1516-89132016000200601 |
work_keys_str_mv |
AT zhaohang researchandapplicationsofshopschedulingbasedongeneticalgorithms AT kongfansen researchandapplicationsofshopschedulingbasedongeneticalgorithms |
_version_ |
1756423963954642944 |