Exploring Lin Kernighan neighborhoods for the indexing problem

Diptesh Ghosh ()

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

Abstract: The indexing problem in automated machining environments aims to arrange tools in tool slots of a tool magazine for faster processing of jobs. This problem is called the indexing problem and has been widely studied in the literature. We present heuristics using Lin Kernighan neighborhood structures to solve the indexing problem. Two of the heuristics are local search heuristics and one is a tabu search heuristic. To the best of our knowledge this is one of the first implementations of tabu search on a Lin Kernighan neighborhood structure.

Date: 2016-02-28
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/6591368082016-02-13.pdf English Version (application/pdf)

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:14428

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