Balakrishnan, J., & Cheng, C. H. (2000). Genetic search and the dynamic layout problem. Computers & Operations Research, 27(6), 587–593.
Balakrishnan, J., Cheng, C. H., & Conway, D. G. (2000). An improved pair-wise exchange heuristic for the dynamic plant layout problem. International Journal of Production Research, 38(13), 3067–3077.
Balakrishnan, J., Cheng, C. H., Conway, D. G., & Lau, C. M. (2003). A hybrid genetic algorithm for the dynamic plant layout problem. International Journal of Production Economics, 86(2), 107–120.
Balakrishnan, J., Robert Jacobs, F., &Venkataramanan, M. A. (1992). Solutions for the constrained dynamic facility layout problem. European Journal of Operational Research, 57(2), 280–286.
Baykasoglu, A., & Gindy, N. N. Z. (2001). A simulated annealing algorithm for dynamic layout problem. Computers & Operations Research, 28(14), 1403–1426.
Baykasoglu, A., Dereli, T., & Sabuncu, I. (2006). An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems. Omega, 34(4), 385–396.
Conway, D. G., & Venkataramanan, M. A. (1994). Genetic search and the dynamic facility layout problem. Computers and Operations Research, 21(8), 955–960.
Drira, A., Pierreval, H., & Hajri-Gabouj, S. (2007). Facility layout problems: A survey. Annual Reviews in Control, 31, 255–267.
Kaku, B.K. & Mazzola, J.B. (1997). A Tabu-search heuristic for the dynamic plant layout problem. INFORMS Journal on Computing, 9 (4), 374-384.
Kennedy, J. (1997). The particle swann: social adaptation of knowledge. International Conference on Evolutionary Computation (Indianapolis, Indiana), IEEE Service Center, Piscataw;ty, NJ, 303-308.
Kennedy, J., & Eberhart, R. (1995b). A new optimizer using particle swarm theory. In Sixth international symposium on micro machine and human science, IEEE, 39–43.
Kennedy, J., & Eberhart, R. C. (1995a). Particle swarm optimization. Proc. IEEE Intl. Conf. on Neural Networks (Perth, Australia), IEEE Service Center, Piscataway, NJ, IV, 1942-1948.
Kennedy, J., & Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm, systems, man, cybernetics, computational cybernetics and simulation. IEEE International Conference, 5(12–15), 4104–4108.
Lacksonen, T. A., & Enscore, E. E. (1993). Quadratic assignment algorithms for the dynamic layout problem. International Journal of Production Research, 31, 503–517.
Lazinica, A. (2009).Particle swarm optimization. Austria. In-Tech.
McKendall, A. R. & Hakobyan, A. (2010). Heuristics for the dynamic facility layout problem with unequal-area departments. European Journal of Operational Research, 201, 171–182.
McKendall, A. R. & Shang, J. (2006). Hybrid ant systems for the dynamic facility layout problem. Computers & Operations Research, 33,790–803.
McKendall, A. R., Shang, J., & Kuppusamy, S. (2006). Simulated annealing heuristics for the dynamic facility layout problem. Computers& Operations Research, 33(8), 2431–2444.
Ning, X. Lam, K.C. & Lam, M. C. K. (2010). Dynamic construction site layout planning using max-min ant system. Automation in Construction ,19, 55–65.
Olariu, S. & Zomaya, A. Y. (2006). Handbook of bio-inspired algorithms and applications. Chapman & Hall/CRC, Taylor & Francis Group.
Pillai, V. M., Hunagund, I. B., & Krishnan, K. K. (2011). Design of robust layout for dynamic plant layout problems. Computers & Industrial Engineering, (In press), doi:10.1016/j.cie.2011.05.014.
Reche-Lopez, P., Ruiz-Reyes, N., Galan, G. S. & Jurado, F. (2009). Comparison of metaheuristic techniques to determine optimal placement of biomass power plants. Energy Conversion and Management, 50, 2020–2028.
Rosenblatt, M. J. (1986). The dynamics of plant layout. Management Science, 32(1), 76–86.
Talbi. E.G. (2009). Metaheuristics, from design to implementation. John Wiley & Sons, Inc.
Tompkins, J. A., White, J. A., Bozer, Y. A., Frazelle, E. H., Tanchoco, J. M., & Trevino, J. (1996). Facilities planning. New York: Wiley.
problem. IIE Transactions, 25(4), 57-63.
Urban, T.L. (1993). A heuristic for the dynamic facility layout
)