Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
Carregando...
Fontes externas
Fontes externas
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Elsevier B.V.
Tipo
Artigo
Direito de acesso
Acesso aberto
Fontes externas
Fontes externas
Resumo
The 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.
Descrição
Palavras-chave
Hybrid heuristics, Clustering search, Genetic algorithm, Scheduling, Tool switches
Idioma
Inglês
Citação
Computers & Operations Research. Oxford: Pergamon-elsevier Science Ltd, v. 67, p. 174-183, 2016.
