Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem

Diptesh Ghosh ()

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

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. Genetic algorithms have been suggested in the literature to solve this problem, but the reasons behind the choice of operators for those algorithms are unclear. In this paper we compare the performances of four common crossover operators and four common mutation operators to find the one most suited for the problem. Our experiments show that the choice of operators for the genetic algorithms presented in the literature is suboptimal.

Date: 2016-03-18
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/4274470042016-03-29.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:14451

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