EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

2828. Characterization and NP-Completeness of ATC Tool Indexing Problem without Tool Duplication

Invited abstract in session WC-25: Topics in Combinatorial Optimization I (Contributed), stream Combinatorial Optimization.

Wednesday, 12:30-14:00
Room: 011 (building: 208)

Authors (first author is the speaker)

1. Deepti Mohan
IT & Operations Management, Goa Institute of Management
2. Diptesh Ghosh
Production and Quantitative Methods, Indian Institute of Management, Ahmedabad

Abstract

The evolution of automated machining centers, especially in sectors such as aerospace and automotive manufacturing, has been significantly driven by the adoption of Automatic Tool Changers (ATCs) in computerized numerical control (CNC) machines. These ATCs are pivotal for the efficient execution of diverse machining tasks, facilitating rapid tool changes without manual intervention. Central to enhancing the operational efficiency of these centers is the challenge of optimizing the ATC indexing process. This problem, known as the ATC Tool Indexing Problem, is a challenging combinatorial optimization problem. The ATC Tool Indexing Problem without Tool Duplication is a variant of this problem, which can be formulated as a specialized instance of the Quadratic Assignment Problem, with a distinctive structure in its distance matrix. We present a characterization of optimal solutions to the ATC Tool Indexing Problem without tool duplication. We also show that this problem is NP-Complete.

Keywords

Status: accepted

Back to the list of papers