A new genetic algorithm for the tool indexing problem
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
- Ghosh, Diptesh, 2016. "Allocating tools to index positions in tool magazines using tabu search," IIMA Working Papers WP2016-02-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Gintaras Palubeckis, 2020. "An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem," Mathematics, MDPI, vol. 9(1), pages 1-30, December.
- Diptesh Ghosh, 2016.
"Incorporating gender and age in genetic algorithms to solve the indexing problem,"
Working Papers
id:11034, eSocialSciences.
- Ghosh, Diptesh, 2016. "Incorporating gender and age in genetic algorithms to solve the indexing problem," IIMA Working Papers WP2016-03-32, Indian Institute of Management Ahmedabad, Research and Publication Department.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
- Diptesh Ghosh, 2016.
"Incorporating gender and age in genetic algorithms to solve the indexing problem,"
Working Papers
id:11034, eSocialSciences.
- Ghosh, Diptesh, 2016. "Incorporating gender and age in genetic algorithms to solve the indexing problem," IIMA Working Papers WP2016-03-32, Indian Institute of Management Ahmedabad, Research and Publication Department.
- Gintaras Palubeckis, 2020. "An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem," Mathematics, MDPI, vol. 9(1), pages 1-30, December.
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-CMP-2016-04-09 (Computational Economics)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:iim:iimawp:14437. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.