Dynamic machine layout for press tool operations using real coded genetic algorithm Online publication date: Wed, 09-Nov-2016
by Kailas V. Chandratre; Padmakar J. Pawar; Keshav N. Nandurkar
International Journal of Metaheuristics (IJMHEUR), Vol. 5, No. 2, 2016
Abstract: In today's economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand. Layout design has a significant impact on manufacturing efficiency. A static plant layout if possible to be converted to dynamic layout may improve the efficiency of the plant significantly. Dynamic layout is a layout which can be rearranged with respect to time as per variation in product design, quantity and change in product mix. Dynamic layout problem is a quadratic assignment problem and is of non-deterministic polynomial-time hard problem. In this work, an attempt is made to solve this problem using real coded genetic algorithm (GA), which overcomes some of the limitations of traditional GA. This algorithm has been applied to the dynamic layout benchmark problems to prove its effectiveness. In addition, a real life example is considered to validate the presented approach.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Metaheuristics (IJMHEUR):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook