Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/13618
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kothari, R. | |
dc.contributor.author | Ghosh, D. | |
dc.date.accessioned | 2015-05-20T13:12:02Z | |
dc.date.available | 2015-05-20T13:12:02Z | |
dc.date.issued | 2014 | |
dc.identifier.citation | Ozcelik, F. (2012). A hybrid genetic algorithm for the single row layout problem. International Journal Of Production Research, 50(20), 5872-5886. | en_US |
dc.identifier.issn | 00207543 | |
dc.identifier.uri | http://hdl.handle.net/11718/13618 | |
dc.description.abstract | The arrangement of machines or departments along a straight line is known as single row layout and it is a widely employed configuration in flexible manufacturing systems. In this paper, a hybrid genetic algorithm (HGA) is proposed to solve the single row layout design problem with unequal sized machines and unequal clearances. The algorithm is developed by hybridisation of a genetic algorithm with a local search operator. The proposed HGA is tested on 51 well known data sets from the literature with equal and unequal clearances, and the results are compared with the best known solutions. Finally, algorithm's effectiveness in reaching previously known best solutions is revealed and improvements up to 7% in problems with unequal clearance are obtained. | en_US |
dc.language.iso | en | en_US |
dc.publisher | International Journal of Production Research | en_US |
dc.subject | Machine layout problem | en_US |
dc.subject | Single row layout | en_US |
dc.subject | Genetic algorithm | en_US |
dc.title | An efficient genetic algorithm for single row facility layout | en_US |
dc.type | Article | en_US |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Anefficientgeneticalgorithm.pdf Restricted Access | 166.79 kB | Adobe PDF | View/Open Request a copy |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.