Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm

International Journal of High Performance Computing and Networking

Volumn 4, Issue 5-6, 2006, Pages 286-294

  Rodriguez, Jose M ^a   MacPhee, F Chris ^a   Bonham, David J ^a   Bhavsar, Virendrakumar C ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

DPLP; dynamic plant layout problem; facility layout problem; FLP; GA; genetic algorithm; QAP; quadratic assignment problem; Tabu search; TS

Indexed keywords

EID: 58849136955     PISSN: 17400562     EISSN: 17400570     Source Type: Journal    
DOI: 10.1504/ijhpcn.2006.013483     Document Type: Article

References (27)

1. Balakrishnan, J. and Cheng, C.H. (2000) ‘Genetic search and the dynamic layout problem’, Computers and Operations Research, Vol. 27, pp.587–593.
2. Balakrishnan, J., Cheng, C.H., Conway, D.G. and Lau, C.M. (2003) ‘A hybrid genetic algorithm for the dynamic plant layout problem’, International Journal of Production Economics, Vol. 86, No. 2, pp.107–120.
3. Balakrishnan, J., Jacobs, F.R. and Venkataramanan, M.A. (1992) ‘Solutions for the constrained dynamic facility layout problem’, European Journal of Operational Research, Vol. 57, pp.280–286.
4. Baykasoglu, A. and Gindy, N.N.Z. (2001) ‘A simulated annealing algorithm for dynamic layout problem’, Computers and Operations Research, Vol. 28, pp.1403–1426.
5. Baykasoglu, A. and Gindy, N.N.Z. (2004) ‘Erratum to: a simulated annealing algorithm for dynamic layout problem [Computers and Operations Research 28 (2001) 1367-1460]’, Computers and Operations Research, Vol. 31, pp.313–315.
6. Çela, E. (1998) The Quadratic Assignment Problem: Theory and Algorithms, Kluwer Academic Publishers, Netherlands.
7. Chang, M., Sugiyama, M., Ohkura, K. and Ueda, K. (2002) ‘A revolutionary genetic algorithm approach to the dynamic facility layout problem’, Proceedings of 2002 Japan-USA Symposium on Flexible Automation (2002 JUSFA), Hiroshima, Japan, pp.93–96.
8. Conway, D.G. and Venkataramanan, M.A. (1994) ‘Genetic search and the dynamic facility layout problem’, Computers and Operations Research, Vol. 21, No. 8, pp.955–960.
9. Dimopoulos, C. and Zalzala, A.M.S. (2000) ‘Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons’, IEEE Transactions on Evolutionary Computation, Vol. 4, No. 2, pp.93–113.
10. Drezner, Z. (2003) ‘A new genetic algorithm for the quadratic assignment problem’, INFORMS Journal on Computing, Vol. 15, No. 3, pp.320–330.
11. Erel, E. (2004) ‘N = 15 cases’ and ‘N = 30 cases’ e-mails to the author.
12. Erel, E., Ghosh, J.B. and Simon, J.T. (2003) ‘New heuristic for the dynamic layout problem’, Journal of the Operational Research Society, Vol. 54, pp.1275–1282.
13. Francis, R.L. and White, J.A. (1974) Facility Layout and Location: An Analytical Approach, Prentice-Hall, New Jersey.
14. Francis, R.L., McGinnis Jr., L.F. and White, J.A. (1992) Facility Layout and Location: An Analytical Approach, 2nd ed., Prentice-Hall, New Jersey.
15. Gen, M. and Cheng, R. (2000) Genetic Algorithms and Engineering Optimization, John Wiley & Sons, USA.
16. Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Academic Publishers, Boston.
17. Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading.
18. Holland, J.H. (1975) Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor.
19. Koopmans, T.C. and Beckmann, M. (1957) ‘Assignment problems and the locations of economic activities’, Econometrica, Vol. 25, No. 1, pp.53–76.
20. Krasnogor, N. (2002) ‘Competent memetic algorithms: model, taxonomy and design issues’, Technical Report, Automated Scheduling, Optimisation and Planning Group, University of Nottingham, UK.
21. Michalewicz, Z. and Fogel, D.B. (2002) ‘How to solve it: modern heuristics’, Springer-Verlag (corrected third printing), Germany.
22. Pardalos, P.M., Rendl, F. and Wolkowicz, H. (1994) ‘The quadratic assignment problem:a survey and recent developments’, in Panos, P.M. and Wolkowicz, H. (Eds.): Quadratic Assignment and Related Problems: DIMACS Workshop, American Mathematical Society, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16, pp.1–42.
23. Rodriguez, J.M. (2004) GATS – An Algorithm for the Solution of the Dynamic Plant Layout Problem, Unpublished Doctoral Dissertation, Department of Mechanical Engineering, University of New Brunswick, Fredericton, NB, Canada.
24. Rodriguez, J.M., MacPhee, F.C., Bonham, D.J. and Bhavsar, V.C. (2004a) ‘Solving the quadratic assignment and dynamic plant layout problems using a new hybrid meta-heuristic approach’, in Eskicioglu, M.R. (Ed.): Proceedings of the 18th Annual International Symposium on High Performance Computing Systems and Applications (HPCS), Department of Computer Science, Winnipeg, Manitoba, Canada, pp.9–16, Available instances and results: http://acrl.cs.unb.ca/research/gats/.
25. Rodriguez, J.M., MacPhee, F.C., Bonham, D.J., Horton, J.D. and Bhavsar, V.C. (2004b) ‘Best permutations for the dynamic plant layout problem’, in Dasgupta, A.R., Iyengar, S.S., and Bhatt, H.S. (Eds.): Proceedings of the 12th International Conference on "Advances in Computing and Communications (ADCOM 2004)”, Allied Publishers Pvt. Ltd., New Delhi Ahmedabad, India, 15–18 Dec., ISBN 81-7764-717-2, pp.173–178.
26. Rosenblatt, M.J. (1986) ‘The dynamics of plant layout’, Management Science, Vol. 32, No. 1, pp.76–86.
27. Urban, T.L. (1993) ‘A heuristic for the dynamic facility layout problem’, IIE Transactions, Vol. 25, No. 4, pp.57–63.