Publication:
A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem

dc.contributor.authorŞENVAR, ÖZLEM
dc.contributor.authorBULKAN, SEROL
dc.contributor.authorsTürkyılmaz A., Senvar O., Ünal İ., Bulkan S.
dc.date.accessioned2022-03-23T11:41:28Z
dc.date.accessioned2026-01-11T19:16:39Z
dc.date.available2022-03-23T11:41:28Z
dc.date.issued2022
dc.description.abstractThis study addresses the bi-objective flexible job shop problem (BOFJSP) with respect to minimization of the maximum completion time (makespan) and total tardiness. This study aims to propose an algorithm called Bi-objective Hybrid Genetic Algorithm – hypervolume contribution measure (BOHGA-HCM) that integrates GA with a multi-search algorithm and uses hypervolume contribution measure (Δs) in its two-level selection strategy. The initial population is created by randomly assigning operations to the available machines via dispatching rules to find better areas in the search space and enhance diversity to avoid premature convergence. The algorithm handles the objective functions simultaneously with the Pareto Optimality approach. The effectiveness and performance of the proposed algorithm are benchmarked and compared with other algorithms by using well-known data sets presented in the literature. © 2022 Elsevier Ltd
dc.identifier.doi10.1016/j.cor.2021.105694
dc.identifier.issn3050548
dc.identifier.urihttps://hdl.handle.net/11424/254652
dc.language.isoeng
dc.publisherElsevier Ltd
dc.relation.ispartofComputers and Operations Research
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectBi-objective
dc.subjectFlexible job shop
dc.subjectGenetic algorithm
dc.subjectHeuristics
dc.subjectHypervolume
dc.subjectLocal multi-search
dc.subjectPareto optimality
dc.subjectTardiness
dc.titleA hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem
dc.typearticle
dspace.entity.typePublication
oaire.citation.titleComputers and Operations Research
oaire.citation.volume141

Files