A HYBRID ALGORITHM FOR OPTIMISING FACILITY LAYOUT

Authors

  • Imran Tasadduq Umm Al-Qura University
  • M. H. Imam Umm Al-Qura University
  • Abdul-Rahim Ahmad Umm Al-Qura University

DOI:

https://doi.org/10.7166/26-1-1013

Keywords:

facilities layout, analytical optimization, heuristic optimization, hybrid algorithm

Abstract

Despite the reported effectiveness of analytical algorithms in facility layout planning, a detailed literature survey suggests a lack of new analytical methods in recent years. This paper focuses on open space facilities layout planning that involves modules with constant aspect ratios. We propose a construction-cum-improvement algorithm involving a novel combination of a boundary search-based heuristic placement and steepest descent-based analytical improvement. In the construction phase, the algorithm places a new module at the optimal location on the boundary of a previously constructed cluster of modules. In the improvement phase, the algorithm alternates between boundary search and steepest descent moves until it converges to a local optimum. Experiments with well-known test problems indicate that the proposed algorithm produced solutions superior both to published results and to those produced by VIP-PLANOPT, a popular, oft-cited and commercially available layout planning and optimisation software.

Downloads

Download data is not yet available.

Author Biographies

Imran Tasadduq, Umm Al-Qura University

Working as professor in the department of computer engineering, college of computer & information systems, Umm Al-Qura University.

M. H. Imam, Umm Al-Qura University

Working as professor in the department of civil engineering, college of engineering, Umm Al-Qura University.

Abdul-Rahim Ahmad, Umm Al-Qura University

Working as associate professor in college of business, Umm Al-Qura University.

Downloads

Published

2015-05-08

How to Cite

Tasadduq, I., Imam, M. H., & Ahmad, A.-R. (2015). A HYBRID ALGORITHM FOR OPTIMISING FACILITY LAYOUT. The South African Journal of Industrial Engineering, 26(1), 120–134. https://doi.org/10.7166/26-1-1013

Issue

Section

General Articles