A genetic algorithm to solve process layout problem

Kaveh Khalili-Damghani, S.M. Ali Khatami-Firouzabadi and Mohammad Diba

International Journal of Management and Decision Making, 2014, vol. 13, issue 1, 42-61

Abstract: A model based on a quadratic assignment problem (QAP) is proposed to design a process layout. The objective function of proposed model has three main parts, as: a) maximising the profit of each product; b) minimising stored keeping materials; c) minimising total layout cost. The demand requirement and production capacity are also considered as set of constraints. Eventually, as the global optimum solution is hard to find for the proposed model, a genetic algorithm (GA) is proposed to solve the model. The performance of proposed GA was compared with other well-known algorithms, i.e., simulated annealing (SA) algorithm and tabu search (TS) on several benchmark instances of QAP as well as a series of simulated random large scale instances. The comparison reveals the promising results of GA over SA, and TS.

Keywords: process layout design; quadratic assignment problem; QAP; genetic algorithms; simulated annealing; tabu search. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=58472 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijmdma:v:13:y:2014:i:1:p:42-61

Access Statistics for this article

More articles in International Journal of Management and Decision Making from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().