546
Views
45
CrossRef citations to date
0
Altmetric
Original Articles

A large-scale hybrid simulated annealing algorithm for cyclic facility layout problems

&
Pages 963-978 | Received 02 Jan 2014, Accepted 19 May 2014, Published online: 15 Jul 2014

References

  • Ahuja, R. K., Ö. Ergun, J. B. Orlin, and A. P. Punnen. 2002. “A Survey of Very Large-Scale Neighborhood Search Techniques.” Discrete Applied Mathematics 123 (1): 75–102. doi: 10.1016/S0166-218X(01)00338-9
  • Armour, G. C., and E. S. Buffa. 1963. “A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities.” Management Science 9 (1): 294–309.
  • Balakrishnan, J., and C. H. Cheng. 1998. “Dynamic Layout Algorithms: A State of the Art Survey.” Omega 26 (4): 507–521. doi: 10.1016/S0305-0483(97)00078-9
  • Balakrishnan, J., and C. H. Cheng. 2009. “The Dynamic Plant Layout Problem: Incorporating Rolling Horizons and Forecast Uncertainty.” Omega 37 (1): 165–177. doi: 10.1016/j.omega.2006.11.005
  • Balakrishnan, J., C. H. Cheng, and D. G. Conway. 2000. “An Improved Pair-Wise Exchange Heuristic for the Dynamic Plant Layout Problem.” International Journal of Production Research 38 (13): 3067–3077. doi: 10.1080/00207540050117440
  • Baykasoğlu, A., and N. N. Gindy. 2001. “A Simulated Annealing Algorithm for Dynamic Layout Problem.” Computers & Operations Research 28 (14): 1403–1426. doi: 10.1016/S0305-0548(00)00049-6
  • Donaghey, C. E., and V. F. Pire. 1990. Solving the Facility Layout Problem with BLOCPLAN. Houston, TX: Industrial Engineering Department-University of Houston.
  • Dunker, T., G. Radons, and E. Westkamper. 2005. “Combining Evolutionary Computation and Dynamic Programming for Solving a Dynamic Facility Layout Problem.” European Journal of Operational Research 165 (1): 55–69. doi: 10.1016/j.ejor.2003.01.002
  • Jolai, F., R. Tavakkoli-Moghaddam, and M. Taghipour. 2012. “A Multi-Objective Particle Swarm Optimisation Algorithm for Unequal Sized Dynamic Facility Layout Problem with Pickup/Drop-Off Locations.” International Journal of Production Research 50 (15): 4279–4293. doi: 10.1080/00207543.2011.613863
  • Komarudin, and K. Y. Wong. 2010. “Applying Ant System for Solving Unequal Area Facility Layout Problems.” European Journal of Operational Research 202 (3): 730–746. doi: 10.1016/j.ejor.2009.06.016
  • Konak, A., S. Kulturel-Konak, B. A. Norman, and A. E. Smith. 2006. “A New Mixed Integer Programming Formulation for Facility Layout Design Using Flexible Bays.” Operations Research Letters 34 (6): 660–672. doi: 10.1016/j.orl.2005.09.009
  • Kulturel-Konak, S. 2007. “Approaches to Uncertainties in Facility Layout Problems: Perspectives at the Beginning of the 21st Century.” Journal of Intelligent Manufacturing 18: 273–284. doi: 10.1007/s10845-007-0020-1
  • Kulturel-Konak, S. 2012. “A Linear Programming Embedded Probabilistic Tabu Search for the Unequal-Area Facility Layout Problem with Flexible Bays.” European Journal of Operational Research 223: 614–625. doi: 10.1016/j.ejor.2012.07.019
  • Kulturel-Konak, S., and A. Konak. 2011a. “A New Relaxed Flexible Bay Structure Representation and Particle Swarm Optimization for the Unequal Area Facility Layout Problem.” Engineering Optimization 43 (12): 1263–1287. doi: 10.1080/0305215X.2010.548864
  • Kulturel-Konak, S., and A. Konak. 2011b. “Unequal Area Flexible Bay Facility Layout Using Ant Colony Optimisation.” International Journal of Production Research 49 (7): 1877–1902. doi: 10.1080/00207541003614371
  • Kulturel-Konak, S., B. A. Norman, D. W. Coit, and A. E. Smith. 2004. “Exploiting Tabu Search Memory in Constrained Problems.” INFORMS Journal on Computing 16 (3): 241–254. doi: 10.1287/ijoc.1030.0040
  • Lacksonen, T. A. 1994. “Static and Dynamic Layout Problems with Varying Areas.” Journal of the Operational Research Society 45 (1): 59–69. doi: 10.1057/jors.1994.7
  • Lacksonen, T. A. 1997. “Preprocessing for Static and Dynamic Facility Layout Problems.” International Journal of Production Research 35 (4): 1095–1106. doi: 10.1080/002075497195560
  • Lacksonen, T. A., and E. E. Enscore. 1993. “Quadratic Assignment Algorithms for the Dynamic Layout Problem.” International Journal of Production Research 31 (3): 503–517. doi: 10.1080/00207549308956741
  • Liu, Q., and R. D. Meller. 2007. “A Sequence-Pair Representation and MIP-Model-Based Heuristic for the Facility Layout Problem with Rectangular Departments.” IIE Transactions 39 (4): 377–394. doi: 10.1080/07408170600844108
  • Madhusudanan Pillai, V., I. B. Hunagund, and K. K. Krishnan. 2011. “Design of Robust Layout for Dynamic Plant Layout Problems.” Computers & Industrial Engineering 61 (3): 813–823. doi: 10.1016/j.cie.2011.05.014
  • McKendall, A. R., and A. Hakobyan. 2010. “Heuristics for the Dynamic Facility Layout Problem with Unequal-Area Departments.” European Journal of Operational Research 201 (1): 171–182. doi: 10.1016/j.ejor.2009.02.028
  • McKendall, A. R., and W.-H. Liu. 2012. “New Tabu Search Heuristics for the Dynamic Facility Layout Problem.” International Journal of Production Research 50 (3): 867–878. doi: 10.1080/00207543.2010.545446
  • Meller, R. D., W. Chen, and H. D. Sherali. 2007. “Applying the Sequence-Pair Representation to Optimal Facility Layout Designs.” Operations Research Letters 35 (5): 651–659. doi: 10.1016/j.orl.2006.10.007
  • Meller, R. D., and K. Y. Gau. 1996. “The Facility Layout Problem: Recent and Emerging Trends and Perspectives.” Journal of Manufacturing Systems 15 (5): 351–366. doi: 10.1016/0278-6125(96)84198-7
  • Montreuil, B., and A. Laforge. 1992. “Dynamic Layout Design Given a Scenario Tree of Probable Futures.” European Journal of Operational Research 63: 271–286. doi: 10.1016/0377-2217(92)90031-4
  • Montreuil, B., and U. Venkatadri. 1991. “Strategic Interpolative Design of Dynamic Manufacturing Systems Layouts.” Management Science 37 (6): 682–694. doi: 10.1287/mnsc.37.6.682
  • Rosenblatt, M. J. 1986. “The Dynamics of Plant Layout.” Management Science 32: 76–86. doi: 10.1287/mnsc.32.1.76
  • Scholz, D., A. Petrick, and W. Domschke. 2009. “STaTS: A Slicing Tree and Tabu Search Based Heuristic for the Unequal Area Facility Layout Problem.” European Journal of Operational Research 197 (1): 166–178. doi: 10.1016/j.ejor.2008.06.028
  • Sherali, H. D., B. M. P. Fraticelli, and R. D. Meller. 2003. “Enhanced Model Formulations for Optimal Facility Layout.” Operations Research 51 (4): 629–644. doi: 10.1287/opre.51.4.629.16096
  • Ulutas, B. H., and S. Kulturel-Konak. 2012. “An Artificial Immune System Based Algorithm to Solve Unequal Area Facility Layout Problem.” Expert Systems with Applications 39: 5384–5395. doi: 10.1016/j.eswa.2011.11.046
  • Urban, T. L. 1992. “Computational Performance and Efficiency of Lower-Bound Procedures for the Dynamic Facility Layout Problem.” European Journal of Operational Research 57: 271–279. doi: 10.1016/0377-2217(92)90048-E
  • Urban, T. L. 1993. “A Heuristic for the Dynamic Facility Layout Problem.” IIE Transactions 25 (4): 57–63. doi: 10.1080/07408179308964304
  • Urban, T. L., 1998. “Solution Procedures for the Dynamic Facility Layout Problem.” Annals of Operations Research 76: 323–342. doi: 10.1023/A:1018904806854
  • Wong, K. Y., and Komarudin. 2010. “Solving Facility Layout Problems using Flexible Bay Structure Representation and Ant System Algorithm.” Expert Systems with Applications 37 (7): 5523–5527. doi: 10.1016/j.eswa.2009.12.080
  • Yang, T., and B. A. Peters. 1998. “Flexible Machine Layout Design for Dynamic and Uncertain Production Environments.” European Journal of Operational Research 108 (1): 49–64. doi: 10.1016/S0377-2217(97)00220-8
  • Yapicioglu, H., and A. E. Smith. 2012. “A Bi-Objective Model for the Retail Spatial Design Problem.” Engineering Optimization 44 (3): 243–266. doi: 10.1080/0305215X.2011.647812

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.