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

Autor(es)

Chaves, A. A. ^[1] ; Lorena, L. A. N. ^[2] ; Senne, E. L. F. ^[3] ; Resende, M. G. C. ^[4]

Afiliação do(s) autor(es)

^[1] Univ Fed Sao Paulo, BR-12231280 Sao Jose Dos Campos - Brazil

^[2] Natl Inst Space Res, BR-12201970 Sao Jose Dos Campos - Brazil

^[3] Sao Paulo State Univ, BR-12516410 Guaratingueta - Brazil

^[4] Amazon Com, MOP, Seattle, WA 98109 - USA

• Tipo de documento: Artigo Científico
• Fonte: Computers & Operations Research; v. 67, p. 174-183, MAR 2016.
• Citações Web of Science: 11

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. (AU)

• Processo FAPESP: 12/17523-3 - Novos métodos híbridos para resolução de problemas de otimização combinatória
• Beneficiário: Antônio Augusto Chaves
• Modalidade de apoio: Auxílio à Pesquisa - Jovens Pesquisadores