View in EDS HTML Full Text PDF Full Text

SITS: an efficient tabu search algorithm for the tool indexing problem without tool duplication.

Saved in:
Bibliographic Details
Title: SITS: an efficient tabu search algorithm for the tool indexing problem without tool duplication.
Authors: Mohan, Deepti1 (AUTHOR) phd17deeptim@iima.ac.in, Ghosh, Diptesh2 (AUTHOR)
Source: International Journal of Production Research. Dec2025, Vol. 63 Issue 24, p10586-10607. 22p.
Subjects: NP-complete problems, Metaheuristic algorithms, Numerical control of machine tools, Algorithms, Computer simulation, Rapid tooling
Abstract: CNC machining centers store multiple tools required for completing operations on jobs in a tool changer. The tool indexing problem is one of assigning tools to slots in the tool changer so that tool changeover time is minimised, thus making the overall processing of jobs efficient. We present a characterisation of optimal tool assignments to slots in practical situations when the number of tools to be assigned is smaller than the number of available slots. We use this characterisation to prove that the tool indexing problem is $ \mathcal {NP} $ NP -complete. We then present a tabu search algorithm called SITS to solve the tool indexing problem. This algorithm is efficient, as it uses a larger neighbourhood than common tabu search algorithms and makes use of techniques that significantly speed up neighbourhood search for this problem. Statistical analysis of results from our computational experiments show that SITS is better than the present state of the art in terms of solution costs, especially for large instances. It is thus a serious contender for solving practical tool indexing problems. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 189933554
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: SITS: an efficient tabu search algorithm for the tool indexing problem without tool duplication.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Mohan%2C+Deepti%22">Mohan, Deepti</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> phd17deeptim@iima.ac.in</i><br /><searchLink fieldCode="AR" term="%22Ghosh%2C+Diptesh%22">Ghosh, Diptesh</searchLink><relatesTo>2</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. Dec2025, Vol. 63 Issue 24, p10586-10607. 22p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22NP-complete+problems%22">NP-complete problems</searchLink><br /><searchLink fieldCode="DE" term="%22Metaheuristic+algorithms%22">Metaheuristic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+control+of+machine+tools%22">Numerical control of machine tools</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+simulation%22">Computer simulation</searchLink><br /><searchLink fieldCode="DE" term="%22Rapid+tooling%22">Rapid tooling</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: CNC machining centers store multiple tools required for completing operations on jobs in a tool changer. The tool indexing problem is one of assigning tools to slots in the tool changer so that tool changeover time is minimised, thus making the overall processing of jobs efficient. We present a characterisation of optimal tool assignments to slots in practical situations when the number of tools to be assigned is smaller than the number of available slots. We use this characterisation to prove that the tool indexing problem is $ \mathcal {NP} $ NP -complete. We then present a tabu search algorithm called SITS to solve the tool indexing problem. This algorithm is efficient, as it uses a larger neighbourhood than common tabu search algorithms and makes use of techniques that significantly speed up neighbourhood search for this problem. Statistical analysis of results from our computational experiments show that SITS is better than the present state of the art in terms of solution costs, especially for large instances. It is thus a serious contender for solving practical tool indexing problems. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=189933554
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/00207543.2025.2553825
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 22
        StartPage: 10586
    Subjects:
      – SubjectFull: NP-complete problems
        Type: general
      – SubjectFull: Metaheuristic algorithms
        Type: general
      – SubjectFull: Numerical control of machine tools
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Computer simulation
        Type: general
      – SubjectFull: Rapid tooling
        Type: general
    Titles:
      – TitleFull: SITS: an efficient tabu search algorithm for the tool indexing problem without tool duplication.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Mohan, Deepti
      – PersonEntity:
          Name:
            NameFull: Ghosh, Diptesh
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 12
              Text: Dec2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 00207543
          Numbering:
            – Type: volume
              Value: 63
            – Type: issue
              Value: 24
          Titles:
            – TitleFull: International Journal of Production Research
              Type: main
ResultId 1