Table of Contents Author Guidelines Submit a Manuscript
Modelling and Simulation in Engineering
Volume 2012, Article ID 189742, 9 pages
http://dx.doi.org/10.1155/2012/189742
Research Article

A New Optimization via Simulation Approach for Dynamic Facility Layout Problem with Budget Constraints

1Faculty of Industrial and Mechanical Engineering, Islamic Azad University of Qazvin, Daneshgah St., Nokhbegan Blvd., P.O. Box 34185141, Qazvin, Iran
2Sales Department, Iran Khodro Industrial Group, Tehran, Iran

Received 29 November 2011; Accepted 5 January 2012

Academic Editor: Hing Kai Chan

Copyright © 2012 Parham Azimi and Hamid Reza Charmchi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Drira, H. Pierreval, and S. Hajri-Gabouj, “Facility layout problems: a survey,” Annual Reviews in Control, vol. 31, no. 2, pp. 255–267, 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Tompkins, J. White, Y. Bozer, and J. Tanchoco, Facilities Planning, John Wiley & Sons, Hoboken, NJ, USA, 3rd edition, 2003.
  3. M. Dong, C. Wu, and F. Hou, “Shortest path based simulated annealing algorithm for dynamic facility layout problem under dynamic business environment,” Expert Systems with Applications, vol. 36, no. 8, pp. 11221–11232, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. Y. Gary, K. J. Chen, and A. Rogers, “Multi-objective evaluation of dynamic facility layout using ant colony optimization,” in Proceedings of the Industrial Engineering Research Conference, 2009.
  5. A. L. Page, “New product development survey: performance and best practices,” in Proceedings of the Product Development & Management Association Conference, 1991.
  6. J. Balakrishnan and C. H. Cheng, “The dynamic plant layout problem: incorporating rolling horizons and forecast uncertainty,” Omega, vol. 37, no. 1, pp. 165–177, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. P. Kouvelis, A. A. Kurawarwala, and G. J. Gutiérrez, “Algorithms for robust single and multiple period layout planning for manufacturing systems,” European Journal of Operational Research, vol. 63, no. 2, pp. 287–303, 1992. View at Google Scholar · View at Scopus
  8. M. J. Rosenblatt, “The dynamics of plant layout,” Management Science, vol. 32, no. 1, pp. 76–86, 1986. View at Google Scholar · View at Scopus
  9. T. L. Urban, “Solution procedures for the dynamic facility layout problem,” Annals of Operations Research, vol. 76, pp. 323–342, 1998. View at Google Scholar · View at Scopus
  10. T. A. Lacksonen and E. E. Enscore, “Quadratic assignment algorithms for the dynamic layout problems,” International Journal of Production Research, vol. 31, no. 3, pp. 503–517, 1993. View at Google Scholar · View at Scopus
  11. J. Balakrishnan and C. H. Cheng, “Genetic search and the dynamic layout problem,” Computers and Operations Research, vol. 27, no. 6, pp. 587–593, 2000. View at Publisher · View at Google Scholar
  12. B. K. Kaku and J. B. Mazzola, “A tabu-search heuristic for the dynamic plant layout problem,” INFORMS Journal on Computing, vol. 9, no. 4, pp. 374–384, 1997. View at Google Scholar · View at Scopus
  13. A. Baykasoglu and N. N. Z. Gindy, “A simulated annealing algorithm for dynamic facility layout problem,” Computers and Operations Research, vol. 28, no. 14, pp. 1403–1426, 2001. View at Google Scholar
  14. J. Balakrishnan, C. H. Cheng, D. G. Conway, and C. M. Lau, “A hybrid genetic algorithm for the dynamic plant layout problem,” International Journal of Production Economics, vol. 86, no. 2, pp. 107–120, 2003. View at Publisher · View at Google Scholar · View at Scopus
  15. E. Erel, J. B. Ghosh, and J. T. Simon, “New heuristic for the dynamic layout problem,” Journal of the Operational Research Society, vol. 56, no. 8, p. 1001, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. A. R. McKendall and J. Shang, “Hybrid ant systemsfor the dynamic facility layout problem,” Computers & Operations Research, vol. 33, no. 3, pp. 790–803, 2006. View at Google Scholar
  17. A. R. McKendall, J. Shang, and S. Kuppusamy, “Simulated annealing heuristics for the dynamic facility layout problem,” Computers and Operations Research, vol. 33, no. 8, pp. 2431–2444, 2006. View at Publisher · View at Google Scholar · View at Scopus
  18. J. M. Rodriguez, F. C. MacPhee, D. J. Bonham, and V. C. Bhavsar, “Solving the dynamic plant layout problem using a new hybrid meta-heuristic algorithm,” International Journal of High Performance Computing and Networking, vol. 4, no. 5-6, pp. 286–294, 2006. View at Google Scholar
  19. K. K. Krishnan, S. H. Cheraghi, and C. N. Nayak, “Dynamic from-between charts: a new tool for solving dynamic facility layout problems,” International Journal of Industrial and Systems Engineering, vol. 11, no. 1-2, pp. 182–200, 2006. View at Google Scholar
  20. J. Balakrishnan and C. H. Cheng, “Dynamic layout algorithms: a state-of-the-art survey,” Omega, vol. 26, no. 4, pp. 507–521, 1998. View at Google Scholar · View at Scopus
  21. S. Kulturel-Konak, “Approaches to uncertainties in facility layout problems: perspectives at the beginning of the 21st Century,” Journal of Intelligent Manufacturing, vol. 18, no. 2, pp. 273–284, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. T. Dunker, G. Radons, and E. Westkämper, “Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem,” European Journal of Operational Research, vol. 165, no. 1, pp. 55–69, 2005. View at Publisher · View at Google Scholar · View at Scopus
  23. A. R. McKendall and A. Hakobyan, “Heuristics for the dynamic facility layout problem with unequal-area departments,” European Journal of Operational Research, vol. 201, no. 1, pp. 171–182, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. J. Balakrishnan, F. R. Jacobs, and M. A. Venkataramanan, “Solutions for the constrained dynamic facility layout problem,” European Journal of Operational Research, vol. 57, no. 2, pp. 280–286, 1992. View at Google Scholar · View at Scopus
  25. A. Baykasoglu, T. Dereli, and I. Sabuncu, “An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems,” Omega, vol. 34, no. 4, pp. 385–396, 2006. View at Publisher · View at Google Scholar · View at Scopus
  26. R. Sahin, K. Ertogral, and O. Turkbey, “A simulated annealing heuristic for the dynamic facility layout problem with budget constraint,” Computers & Industrial Engineering, vol. 59, no. 2, pp. 308–313, 2010. View at Google Scholar
  27. P. Azimi and P. Daneshvar, “An efficient heuristic algorithm for the traveling salesman problem,” in Proceedings of the 8th International Heinz Nixdorf Symposium on Changing Paradigms (IHNS '10), Advanced Manufacturing and Sustainable Logistics, pp. 384–395, Paderborn, Germany, 2010. View at Publisher · View at Google Scholar