Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem
Flow Shop Scheduling Problem (FSSP) with the objective of minimizing total amount of tardiness is an NP-hard problem and many articles has been written about it. In this context, great attention has been paide to metahuristic techniques such as genetic algorithm. Additionally determination of the pa...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
University of Qom
2022-09-01
|
| Series: | مدیریت مهندسی و رایانش نرم |
| Subjects: | |
| Online Access: | https://jemsc.qom.ac.ir/article_877_9961e9deac10563c4489fe5164a76a09.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832577585962287104 |
|---|---|
| author | Morteza Rasti Barzoki Sajjad Raeisi |
| author_facet | Morteza Rasti Barzoki Sajjad Raeisi |
| author_sort | Morteza Rasti Barzoki |
| collection | DOAJ |
| description | Flow Shop Scheduling Problem (FSSP) with the objective of minimizing total amount of tardiness is an NP-hard problem and many articles has been written about it. In this context, great attention has been paide to metahuristic techniques such as genetic algorithm. Additionally determination of the paraemeters of the algorithms is an important subject in the research area that many researches have been allocated to it. The purpose of this paper is to investigate the effect of crossover and mutation operators of the genetic algorithm on the objective of minimizing total amount of tardiness in permutation FSSP in order to determine more suitable ones to be applied in the problem. The obtained numerical results indicate that in most cases among common crossover operators,using the one point and two point (first version) operators and among mutation operators,applying the adjacent exchange gives the best value for the mentioned problem. |
| format | Article |
| id | doaj-art-8a74cf6dc71a45d1876b005234a68e26 |
| institution | Kabale University |
| issn | 2538-6239 2538-2675 |
| language | fas |
| publishDate | 2022-09-01 |
| publisher | University of Qom |
| record_format | Article |
| series | مدیریت مهندسی و رایانش نرم |
| spelling | doaj-art-8a74cf6dc71a45d1876b005234a68e262025-01-30T20:18:08ZfasUniversity of Qomمدیریت مهندسی و رایانش نرم2538-62392538-26752022-09-0172496510.22091/jemsc.2017.877877Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop ProblemMorteza Rasti Barzoki0Sajjad Raeisi1Assistant Prof., Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran.Msc. in Applied Statistics, Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran.Flow Shop Scheduling Problem (FSSP) with the objective of minimizing total amount of tardiness is an NP-hard problem and many articles has been written about it. In this context, great attention has been paide to metahuristic techniques such as genetic algorithm. Additionally determination of the paraemeters of the algorithms is an important subject in the research area that many researches have been allocated to it. The purpose of this paper is to investigate the effect of crossover and mutation operators of the genetic algorithm on the objective of minimizing total amount of tardiness in permutation FSSP in order to determine more suitable ones to be applied in the problem. The obtained numerical results indicate that in most cases among common crossover operators,using the one point and two point (first version) operators and among mutation operators,applying the adjacent exchange gives the best value for the mentioned problem.https://jemsc.qom.ac.ir/article_877_9961e9deac10563c4489fe5164a76a09.pdfanalysis of variance (anova)design of experiments (doe)flow shop scheduling problem (fssp)genetic algorithmtotal amount of tardiness |
| spellingShingle | Morteza Rasti Barzoki Sajjad Raeisi Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem مدیریت مهندسی و رایانش نرم analysis of variance (anova) design of experiments (doe) flow shop scheduling problem (fssp) genetic algorithm total amount of tardiness |
| title | Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem |
| title_full | Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem |
| title_fullStr | Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem |
| title_full_unstemmed | Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem |
| title_short | Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem |
| title_sort | comparison of the effect of various types of genetic algorithm operators on the total amount of tardiness in flow shop problem |
| topic | analysis of variance (anova) design of experiments (doe) flow shop scheduling problem (fssp) genetic algorithm total amount of tardiness |
| url | https://jemsc.qom.ac.ir/article_877_9961e9deac10563c4489fe5164a76a09.pdf |
| work_keys_str_mv | AT mortezarastibarzoki comparisonoftheeffectofvarioustypesofgeneticalgorithmoperatorsonthetotalamountoftardinessinflowshopproblem AT sajjadraeisi comparisonoftheeffectofvarioustypesofgeneticalgorithmoperatorsonthetotalamountoftardinessinflowshopproblem |