A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem†
Main Author: | |
---|---|
Publication Date: | 2022 |
Other Authors: | , |
Format: | Article |
Language: | eng |
Source: | Repositório Institucional da UNESP |
Download full: | http://dx.doi.org/10.3390/s22124561 http://hdl.handle.net/11449/240354 |
Summary: | Job Shop Scheduling is currently one of the most addressed planning and scheduling optimization problems in the field. Due to its complexity, as it belongs to the NP-Hard class of problems, meta-heuristics are one of the most commonly used approaches in its resolution, with Genetic Algorithms being one of the most effective methods in this category. However, it is well known that this meta-heuristic is affected by phenomena that worsen the quality of its population, such as premature convergence and population concentration in regions of local optima. To circumvent these difficulties, we propose, in this work, the use of a guidance operator responsible for modifying ill-adapted individuals using genetic material from well-adapted individuals. We also propose, in this paper, a new method of determining the genetic quality of individuals using genetic frequency analysis. Our method is evaluated over a wide range of modern GAs and considers two case studies defined by well-established JSSP benchmarks in the literature. The results show that the use of the proposed operator assists in managing individuals with poor fitness values, which improves the population quality of the algorithms and, consequently, leads to obtaining better results in the solution of JSSP instances. Finally, the use of the proposed operator in the most elaborate GA-like method in the literature was able to reduce its mean relative error from 1.395% to 0.755%, representing an improvement of 45.88%. |
id |
UNSP_d25d2eff6723d51a42dfad61aef28d10 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/240354 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem†combinatorial optimizationevolutionary algorithmgenetic algorithmgenetic improvementjob shop scheduling problemJob Shop Scheduling is currently one of the most addressed planning and scheduling optimization problems in the field. Due to its complexity, as it belongs to the NP-Hard class of problems, meta-heuristics are one of the most commonly used approaches in its resolution, with Genetic Algorithms being one of the most effective methods in this category. However, it is well known that this meta-heuristic is affected by phenomena that worsen the quality of its population, such as premature convergence and population concentration in regions of local optima. To circumvent these difficulties, we propose, in this work, the use of a guidance operator responsible for modifying ill-adapted individuals using genetic material from well-adapted individuals. We also propose, in this paper, a new method of determining the genetic quality of individuals using genetic frequency analysis. Our method is evaluated over a wide range of modern GAs and considers two case studies defined by well-established JSSP benchmarks in the literature. The results show that the use of the proposed operator assists in managing individuals with poor fitness values, which improves the population quality of the algorithms and, consequently, leads to obtaining better results in the solution of JSSP instances. Finally, the use of the proposed operator in the most elaborate GA-like method in the literature was able to reduce its mean relative error from 1.395% to 0.755%, representing an improvement of 45.88%.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Department of Computing Federal University of Sao Carlos, SPDepartment of Computer Science and Statistics Institute of Biosciences Letters and Exact Sciences Sao Paulo State University, SPDepartment of Applied Mathematics and Statistics Institute of Mathematical and Computer Science University of Sao Paulo, SPDepartment of Computer Science and Statistics Institute of Biosciences Letters and Exact Sciences Sao Paulo State University, SPUniversidade Federal de São Carlos (UFSCar)Universidade Estadual Paulista (UNESP)Universidade de São Paulo (USP)Viana, Monique SimplicioContreras, Rodrigo Colnago [UNESP]Junior, Orides Morandin2023-03-01T20:13:25Z2023-03-01T20:13:25Z2022-06-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://dx.doi.org/10.3390/s22124561Sensors, v. 22, n. 12, 2022.1424-8220http://hdl.handle.net/11449/24035410.3390/s221245612-s2.0-85132880460Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengSensorsinfo:eu-repo/semantics/openAccess2025-04-14T14:27:50Zoai:repositorio.unesp.br:11449/240354Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestrepositoriounesp@unesp.bropendoar:29462025-04-14T14:27:50Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem† |
title |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem† |
spellingShingle |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem† Viana, Monique Simplicio combinatorial optimization evolutionary algorithm genetic algorithm genetic improvement job shop scheduling problem |
title_short |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem† |
title_full |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem† |
title_fullStr |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem† |
title_full_unstemmed |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem† |
title_sort |
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem† |
author |
Viana, Monique Simplicio |
author_facet |
Viana, Monique Simplicio Contreras, Rodrigo Colnago [UNESP] Junior, Orides Morandin |
author_role |
author |
author2 |
Contreras, Rodrigo Colnago [UNESP] Junior, Orides Morandin |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Federal de São Carlos (UFSCar) Universidade Estadual Paulista (UNESP) Universidade de São Paulo (USP) |
dc.contributor.author.fl_str_mv |
Viana, Monique Simplicio Contreras, Rodrigo Colnago [UNESP] Junior, Orides Morandin |
dc.subject.por.fl_str_mv |
combinatorial optimization evolutionary algorithm genetic algorithm genetic improvement job shop scheduling problem |
topic |
combinatorial optimization evolutionary algorithm genetic algorithm genetic improvement job shop scheduling problem |
description |
Job Shop Scheduling is currently one of the most addressed planning and scheduling optimization problems in the field. Due to its complexity, as it belongs to the NP-Hard class of problems, meta-heuristics are one of the most commonly used approaches in its resolution, with Genetic Algorithms being one of the most effective methods in this category. However, it is well known that this meta-heuristic is affected by phenomena that worsen the quality of its population, such as premature convergence and population concentration in regions of local optima. To circumvent these difficulties, we propose, in this work, the use of a guidance operator responsible for modifying ill-adapted individuals using genetic material from well-adapted individuals. We also propose, in this paper, a new method of determining the genetic quality of individuals using genetic frequency analysis. Our method is evaluated over a wide range of modern GAs and considers two case studies defined by well-established JSSP benchmarks in the literature. The results show that the use of the proposed operator assists in managing individuals with poor fitness values, which improves the population quality of the algorithms and, consequently, leads to obtaining better results in the solution of JSSP instances. Finally, the use of the proposed operator in the most elaborate GA-like method in the literature was able to reduce its mean relative error from 1.395% to 0.755%, representing an improvement of 45.88%. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-06-01 2023-03-01T20:13:25Z 2023-03-01T20:13:25Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.3390/s22124561 Sensors, v. 22, n. 12, 2022. 1424-8220 http://hdl.handle.net/11449/240354 10.3390/s22124561 2-s2.0-85132880460 |
url |
http://dx.doi.org/10.3390/s22124561 http://hdl.handle.net/11449/240354 |
identifier_str_mv |
Sensors, v. 22, n. 12, 2022. 1424-8220 10.3390/s22124561 2-s2.0-85132880460 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Sensors |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
repositoriounesp@unesp.br |
_version_ |
1834482602330816512 |