A new genetic algorithm for the tool indexing problem

IIMA Institutional Repository

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Ghosh, Diptesh
dc.date.accessioned	2018-02-07T05:43:38Z
dc.date.available	2018-02-07T05:43:38Z
dc.date.issued	2016-03-14
dc.identifier.uri	http://hdl.handle.net/11718/20272
dc.description.abstract	The tool indexing problem is one of allocating tools to slots in a tool magazine so as to minimize the tool change time in automated machining. This problem has been widely studied in the literature. A genetic algorithm has been suggested in the literature to solve this problem, but its implementation is non-standard. In this paper we describe a permutation based genetic algorithm for the tool indexing problem and compare its performance with an existing genetic algorithm.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Indian Institute of Management Ahmedabad	en_US
dc.relation.ispartofseries	W.P.;2016-03-17
dc.subject	CNC tool indexing	en_US
dc.subject	Genetic algorithm	en_US
dc.subject	Permutation problem	en_US
dc.title	A new genetic algorithm for the tool 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_03_17.pdf	WP_2016_3_17	310.35 kB	Adobe PDF	View/Open