SOLVED THE PROBLEM OF MINIMIZING TOOL CHANGES WITH A LOCAL 2 OPT SEARCH AND GRASP MULTI START

This work addresses the Tool Change Minimization Problem (MTSP), a combinatorial challenge in production systems with limited resources. To solve it, the GRASP metaheuristic with multiple starts was used, combined with the 2-opt local search. The proposal seeks to find task sequences that minimize the number of tool changes in machines with restricted capacity. Unlike approaches that use indirect representations, this study adopts a direct solution, based on viable permutations and simplified evaluation. The experiments demonstrated better quality of the solutions in several instances, although with an increase in computational time. The results show the effectiveness and robustness of GRASP Multi Start with local search as a practical alternative for sequencing problems in industrial environments.