Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm Online publication date: Tue, 01-May-2007
by Jose M. Rodriguez, F. Chris MacPhee, David J. Bonham, Virendrakumar C. Bhavsar
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 4, No. 5/6, 2006
Abstract: The Quadratic Assignment Problem (QAP) can be used to formulate the Facility Layout Problem (FLP). The Dynamic Plant Layout Problem (DPLP) extends the FLP. Of the attempted 48 DPLP instances, 29 now have new best-known solution. With respect to the six department instances that all have a known optimal solution, optimal solutions were obtained for two, for which no heuristic had been found before, and previously found optimal solutions were matched for the remainder. With respect to the 15 and 30 department instances, none of which has a known optimal solution, only three current best-known solutions could not be obtained.
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 High Performance Computing and Networking (IJHPCN):
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