Exploring lin kernighan neighborhoods for the indexing problem

IIMA Institutional Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/20279

Full metadata record

DC Field	Value	Language
dc.contributor.author	Ghosh, Diptesh
dc.date.accessioned	2018-02-07T08:20:07Z
dc.date.available	2018-02-07T08:20:07Z
dc.date.issued	2016-02-29
dc.identifier.uri	http://hdl.handle.net/11718/20279
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Indian Institute of Management Ahmedabad	en_US
dc.relation.ispartofseries	W.P.;2016-02-13
dc.subject	NC tool magazine	en_US
dc.subject	Indexing	en_US
dc.subject	Lin Kernighan neighborhoods	en_US
dc.subject	Local search	en_US
dc.subject	Tabu search	en_US
dc.title	Exploring lin kernighan neighborhoods for the indexing problem	en_US
dc.type	Working Paper	en_US
Appears in Collections:	Working Papers

Files in This Item:

File	Description	Size	Format
WP_2016_02_13.pdf	WP_2016_2_13	358.28 kB	Adobe PDF	View/Open