METODE KONSTRUKSI UNTUK MENYELESAIKAN MASALAH TATA LETAK FASILITAS
DOI:
https://doi.org/10.18269/jpmipa.v2i2.34911Keywords:
Heuristic, maximum planar graph, computer, facility layout designAbstract
The facility layout design problem is concerned with determining the location of a number of facilities which optimises a prescribed objective such as profit, cost, or distance. This problem arises in many applications; for example, in design of buildings and in plant layout design. Most approaches for solving this problem are heuristic in nature and based on graph theoretic concepts. Graph theoretically, when the objective is to maximize profit, the facility layout design problem is to determine, in a given edge weighted graph G, a maximum weight planar sub graph. In this paper, a new heuristic based on graph theoretic concepts is presented. A comparative analysis based on 3600 random test problems demonstrates the value of this algorithm.
Downloads
References
Al-Hakim, L.A., (1992). A modified procedure for converting a dual graph to a block layout, International Journal of Production Research, 30, 2467-2476.
Bazaraa, M. S., (1975). Computerized layout design: A branch and bound approach, AIIE Transactions 7(4), 432-437.
Bazaraa, M. S., and Sherali, M. D., (1982). On the use of exact and heuristic cutting plane methods for the quadratic assignment problem, Journal of Operations Research Society, 33(1), 991-1003.
Bondy, J. A., and Murty, U. S. R., (1977). Graph theory with applications, The Mac-Millan Press, London.
Boswell, S. G., (1992). Tessa-A new greedy heuristic for facilities layout planning, International Journal of Production Research, 30, 1957-1968.
Caccetta, L., and Kusumah, Y., (1998). A new heuristic algorithm for the facility layout design, in Optimization, Techniques and Applications, ICOTA ’98, Proceeding (L. Caccetta et al. Editors), Curtin University of Technology, 287-294.
Caccetta, L., and Kusumah, Y., (2001). Computational Aspects of the Facility Layout Design Problem, Nonlinear Analysis 47, 5599-5610.
Eades, P., Foulds, L. R., and Giffin, J. W., (1982). An efficient heuristic for identifying a maximum weight planar subgraph, in Lecture Notes in Mathematics No. 952 (Combinatorial Mathematics IX). Springer-Verlag, Berlin.
Foulds, L. R., and Robinson, D. F., (1976). A strategy for Solving the Plant Layout Problem, Operational Research Quarterly 27, 845-855.
Foulds, L. R., and Robinson, D. F., (1978). Graph theoretic heuristic for the plant layout problem, International Journal of Production Research, 16, 25-37.
Foulds, L. R., Gibbons, P. B., and Giffin, J. W., (1985). Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Heuristics, Operations Research 33, 1091-1106.
Giffin, J. W., Foulds, L. R., and Cameron, D. C., (1984). Drawing a Block Plan from a REL chart with graph theory and a microcomputer, Computer Industrial Engineering 10, 109-116.
Green, R. H., and Al-Hakim, L., (1985). A Heuristic for Facility Layout Planning, OMEGA, International Journal of Management Science 13(5), 469-474.
Hassan, M. M. D., and Hogg, G. L., (1989). On converting a dual graph into a block layout, International Journal of Production Research, 27(7), 11491160.
Hassan, M. M. D., and Hogg, G. L., (1991). On constructing a block layout by graph theory, International Journal of Production Research, 29, 1263-1278.
Irvine, S. A., and Rinsma-Melchert, I., (1997). A new approach to the block layout problem, International Journal of Production Research, 35(8), 2359-2376.
Kim, J-Y, and Kim, Y-D, (1995). Graph Theoretic Heuristic for Unequal-sized Facility Layout Problems, OMEGA, International Journal of Management Science, 23(4), 391-401.
Kusiak, A., and Heragu, S. S., (1987). Invited Review. The Facility Layout Problem, European Journal of Operational Research 29, 229-251.
Lawler, E. L., (1963). The quadratic assignment problem, Management Science 9(4), 586-599.
Leung, J., (1992). A new graph-theoretic heuristic for the facility layout, Management Science, 38(4), 594-605.
Rinsma, I., Giffin, J. W., and Robinson, D. F., (1990). Orthogonal floor plans from maximal planar graphs. Environment and Planning B: Planning and Design, 17, 57-71.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
