A genetic algorithm to solve process layout problem
by Kaveh Khalili-Damghani; S.M. Ali Khatami-Firouzabadi; Mohammad Diba
International Journal of Management and Decision Making (IJMDM), Vol. 13, No. 1, 2014

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.

Online publication date: Fri, 30-May-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Management and Decision Making (IJMDM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com