Hybrid method with CS and BRKGA applied to the minimization of tool switches problem

Página do item simplificado
dc.citation.volume67
dc.contributor.authorChaves, A. A. [UNIFESP]
dc.contributor.authorLorena, L. A. N.
dc.contributor.authorSenne, E. L. F.
dc.contributor.authorResende, M. G. C.
dc.coverageOxford
dc.date.accessioned2020-08-21T17:00:21Z
dc.date.available2020-08-21T17:00:21Z
dc.date.issued2016
dc.description.abstractThe minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. The MTSP is well known to be NP-hard. This paper presents a new hybrid heuristic based on the Biased Random Key Genetic Algorithm (BRKGA) and the Clustering Search (CS). The main idea of CS is to identify promising regions of the search space by generating solutions with a metaheuristic, such as BRKGA, and clustering them to be further explored with local search heuristics. The distinctive feature of the proposed method is to simplify this clustering process. Computational results for the MTSP considering instances available in the literature are presented to demonstrate the efficacy of the CS with BRKGA. (C) 2015 Elsevier Ltd. All rights reserved.en
dc.description.affiliationUniv Fed Sao Paulo, BR-12231280 Sao Jose Dos Campos, Brazil
dc.description.affiliationNatl Inst Space Res, BR-12201970 Sao Jose Dos Campos, Brazil
dc.description.affiliationSao Paulo State Univ, BR-12516410 Guaratingueta, Brazil
dc.description.affiliationAmazon Com, MOP, Seattle, WA 98109 USA
dc.description.affiliationUnifespUniv Fed Sao Paulo, BR-12231280 Sao Jose Dos Campos, Brazil
dc.description.sourceWeb of Science
dc.description.sponsorshipFAPESP
dc.description.sponsorshipCNPq
dc.description.sponsorshipIDFAPESP: 2012/17523-3
dc.description.sponsorshipIDCNPq: 482170/2013-1
dc.description.sponsorshipIDCNPq: 304979/2012-0
dc.description.sponsorshipIDCNPq: 476862/2012-4
dc.description.sponsorshipIDCNPq: 300692-2009-9
dc.description.sponsorshipIDCNPq: 300692/2009-9
dc.format.extent174-183
dc.identifierhttp://dx.doi.org/10.1016/j.cor.2015.10.009
dc.identifier.citationComputers & Operations Research. Oxford, v. 67, p. 174-183, 2016.
dc.identifier.doi10.1016/j.cor.2015.10.009
dc.identifier.issn0305-0548
dc.identifier.urihttps://repositorio.unifesp.br/handle/11600/57950
dc.identifier.wosWOS:000367483900015
dc.language.isoeng
dc.publisherPergamon-Elsevier Science Ltd
dc.relation.ispartofComputers & Operations Research
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectHybrid heuristicsen
dc.subjectClustering searchen
dc.subjectGenetic algorithmen
dc.subjectSchedulingen
dc.subjectTool switchesen
dc.titleHybrid method with CS and BRKGA applied to the minimization of tool switches problemen
dc.typeinfo:eu-repo/semantics/article
Arquivos
Coleções
ICT - Artigos