Speeding up neighborhood search for the tool indexing problem

Diptesh Ghosh ()

No WP2016-09-02, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: The arrangement of tools in tool holding pockets of a tool magazine in a CNC machining center plays an important role in reducing processing times of complex job processes in automated machining environments. This problem is called the ATC indexing problem (ATCIP). Computing the cost of a solution for an ATCIP instance of size $n$ requires $\mathcal{O}(n^2)$ time, so that neighborhood search iteration for the ATCIP on an $\mathcal{O}(n^2)$ neighborhood requires $\mathcal{O}(n^4)$ time. We describe techniques to reduce this effort for two common neighborhood structures from $\mathcal{O}(n^4)$ time to $\mathcal{O}(n^2)$ time.

Date: 2016-09-22
References: View references in EconPapers View complete reference list from CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:14551

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().