SIMULATED ANNEALING ALGORITHM FOR SOLVING FACILITY LAYOUT PROBLEM

Salih Eltahir Elmarioud Ali, Elamin Hussein

Abstract


Layout problems are found in several types of manufacturing systems. Typically, layout problems are related to the location of facilities (e.g., machines, departments) in a plant. They are known to greatly impact the system performance. In job shop primary interrelations between operations are identified as to whether or not they require closeness. The criterion employed is concerned with minimization of the cost of item movement, where this cost is expressed as a linear function of distance traveled. This paper studies the reasons for closeness or separation that needed with consideration of materials movement between operations. Due to large number of calculations and arrangements needed for solving facility layout problems, the computer is used as an aided tool for analyzing layout problems. Based on an initial layout the objective is to produce an optimal block layout showing the relative positioning of departments. Pair wise exchange procedure is used to generate alternative solutions via adopting simulated annealing heuristic. Simulated annealing based software system for solving equal area static facility layout problem is developed. The developed algorithm is tested by using some standard problems in the literature.

Keywords


Facility Layout; Block Layout; Quadratic Assignment Problem; Simulated Annealing;Optimization.

Full Text:

PDF

References


Heragu, S. “Facilities Design”, PWS Publishing Company, Boston, 1996. 2. Sheth, V. S. “Facilities Planning and Materials Handling: Methods and Requirements.” New York: Marcel Dekker, Inc., 1995, pp. 67-86. 3. Kusiak, A. and Heragu, S.S., 1987, “The facility layout problem,” European Journal of Operational Research, Vol. 29, pp. 229-251. 4. Meller, R. D. and K.-Y. Gau, "The Facility Layout Problem: Recent and Emerging Trends and Perspectives," Journal of Manufacturing Systems, vol. 15, no. 5, pp.351-366, 1996. 5. Rosenblatt, M.J., 1986, “The dynamics of Plant Layout,” Management Science, Vol. 32, No. 1, pp. 76-86. 6. Kouvelils, P., Kurawarwala, A.A., and Gutierrez, G.J., 1992, “Algorithms for Single and Multiple Period Layout Planning for Manufacturing Systems,” European Journal of Operational Research, Vol. 63, pp. 287-303. 7. Tompkins, J. A. White, Y. A. Boozer, E. H. Frazelle, J. M. Tanchoco, and J.Trevino, Facilities Planning, 2nd ed. New York: John Wiley and Sons, 1996 8. Lundy, M., and Mees, A., "Convergence of an annealing algorithm", mathematical Programming 34 (1986) 111-124. 9. Nugent, C.E., T.E. Vollmann and J. Rural, An experimental comparison of techniques for the assignment of facilities to locations, J. Operations Res. 16 (1968) 150-173 10. Burkard, R.E. and T. Brnniger, A heuristic for quadratic Boolean programs with applications to quadratic assignment problems, European J. Operational Res. 13(4) (1983) 374-386. 11. Burkard, R.E., and Rendl, F., "A thermodynamically motivated simulation procedure for combinatorial optimization problems", European Journal of Operational Research 17 (1984) 169-174. 12. Misevicius A (2003) A modified simulated annealing algorithm for quadratic assignment problem. Informatica 14(4):497–514.


Refbacks

  • There are currently no refbacks.


Sudan Eng. Society Journals