Journal of Industrial Mathematics
Volume 2013 (2013), Article ID 130251, 10 pages
Obtaining an Initial Solution for Facility Layout Problem
Department of Industrial Engineering, Sharif University of Technology, Tehran 1458875346, Iran
Received 13 April 2013; Accepted 29 August 2013
Academic Editor: Ting Chen
Copyright © 2013 Ali Shoja Sangchooli and Mohammad Reza Akbari Jokar. 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.
The facility layout approaches can generally be classified into two groups, constructive approaches and improvement approaches. All improvement procedures require an initial solution which has a significant impact on final solution. In this paper, we introduce a new technique for accruing an initial placement of facilities on extended plane. It is obtained by graph theoretic facility layout approaches and graph drawing algorithms. To evaluate the performance, this initial solution is applied to rectangular facility layout problem. The solution is improved using an analytical method. The approach is then tested on five instances from the literature. Test problems include three large size problems of 50, 100, and 125 facilities. The results demonstrate effectiveness of the technique especially for large size problems.
The facility layout problem seeks the best positions of facilities to optimize some objective. The common objective is to reduce material handling costs between the facilities. The problem has been modeled by a variety of approaches. A detailed review of the different problem formulations can be found in Singh and Sharma . The facility layout problem is an optimization problem which arises in a variety of problems such as placing machines on a factory floor, VLSI design, and layout design of hospitals, schools.
The facility layout approaches can generally be classified into two groups, constructive methods and improvement methods. In this paper, we consider the placement of facilities on an extended plane. Many improvement approaches have been proposed for this problem. All improvement procedures require an initial solution. Some approaches start from a good but infeasible solution [2–4]. These models contain a penalty component in their objective function. Hence, these approaches minimize objective function value for feasible solutions. But some approaches require a feasible initial solution. These approaches use a randomly generated initial solution [5, 6]. Mir and Imam  have proposed simulated annealing for a better initial solution. They have shown that a good initial solution has a significant impact on final solution.
In this paper, we introduce a new technique for accruing an initial placement of facilities on an extended plane. The technique consists of two stages. In the first stage, a maximal planar graph (MPG) is obtained. In the second stage, the vertices of MPG are drawn on the plane by graph drawing algorithms. Then, vertices are replaced by facilities. Hence, an initial solution is obtained.
In an MPG, the facilities with larger flows are adjacent together. Hence, drawing the MPG on the plane can be a good idea for obtaining an initial solution. To evaluate the performance of the idea, this initial solution is applied in rectangular facility layout problem. The solution is improved by an analytical method by Mir and Imam . The approach is then tested on five instances from the literature.
The remaining parts of the paper are organized as follows. The next section describes the formulation of the facility layout problem chosen for our work. Section 3 describes accruing an initial placement. In Section 4, the analytical method is described, and the approach is compared to other approaches in the literature. In Section 5, the proposed initial solution is compared with random initial solution. Finally, Section 6 provides a summary and conclusion.
2. Problem Formulation
In this paper, we label the facilities , where is the total number of facilities. Facilities are assumed to be rectangles with fixed shape. The notation is given as follows: () coordinates of the center of facility length of facility width of facility the total cost of flow per unit distance between two facilities and distance between the centers of the facilities and . could be one of the following three distance norms.(1)Euclidean distance: (2)Squared Euclidean distance: (3)Rectilinear distance: The requirement for problem is that the facilities must not overlap each other. The area of overlap is defined as follows: where The value of overlap area is a nonnegative number. will be zero only if there is no overlapping between facilities and . The objective is to minimize material handling costs. So, the problem can be stated as follows: The constraint ensures that facilities do not overlap. A similar formulation also can be found in .
3. Obtaining an Initial Solution
The initial solution is obtained by graph theoretic facility layout approaches (GTFLP) and graph drawing algorithms. The following subsection describes obtaining an MPG. Section 3.2 describes the drawing of the MPG on the plane.
3.1. Generating a Maximal Planar Graph
In GTFLP, facilities are represented by vertices, and flow (adjacency desirability) between them is represented by weighted edges. Created graph is called adjacency graph. Graph theory is particularly useful for the facility layout problems, because graphs easily enable us to capture the adjacency information and model the problem. A review of graph theory applications to the facility layout problem can be found in [9, 10]. GTFLP consists of two stages. At the first stage, the adjacency graph is converted to a maximal planar graph (MPG). In the second stage, a block layout is constructed from the MPG. The second stage is not our concern here. For more details, we refer to [11–15]. Figure 1 shows an MPG and its correspondent block layout.
Many heuristic and metaheuristic methods for obtaining an MPG have been suggested [16–21]. In this paper, we use from the greedy heuristic . It is conceptually simple and creates high weighted MPGs . This heuristic has a simple instruction: the edges are sorted in nonincreasing order of weight. Each edge is tested in turn and accepted as part of the MPG unless it makes the graph nonplanar. So, the heuristic needs planarity testing. Boyer and Myrvold  developed a simplified planarity testing algorithm. We use this algorithm for planarity testing. In the worst case, edges are considered, and for each edge, the Boyer and Myrvold test is called. Hence, the approach results in a complexity of .
3.2. Drawing Maximal Planar Graph on the Plane
Graph drawing, as a branch of graph theory, applies topology and geometry to derive two-dimensional representations of graphs. A graph drawing algorithm reads as input a combinatorial description of a graph G and produces as output a drawing of G. A graph has infinitely many different drawings. For a review of various graphs drawing algorithms, refer to . We use algorithm of Chrobak and Payne  to form a straight line drawing, of the MPG. In such a drawing, each edge is drawn using a straight line segment. The algorithm draws vertices in an MPG to integer coordinates in a grid. Figure 2 shows an example of straight line drawing.
For acquiring an initial solution, each vertex is replaced by its correspondent facility. In a feasible solution, facilities have no overlaps. For this reason, the coordinates of facilities can be multiplied by maximum dimensions of all facilities (width and length). This operation increases distance between facilities and makes the solution feasible. For the case of circular facilities, the diameter of circle can be considered as maximum dimensions.
4. Improving Initial Solution and Comparing
To evaluate the performance, the initial solution is improved by an analytical method by Mir and Imam . In this method, the convergence is controlled by carrying out the optimization using concept of “magnified envelop blocks.” The dimensions of the blocks are determined by multiplying the dimensions of the facilities with a “magnification factor.” The optimization is then carried out for these envelop blocks rather than the actual facilities. The analytical method searches the optimum placements of each envelop block in the direction of steepest descent which is opposite to the gradient direction. The sizes of the envelop blocks are then reduced, and the optimization process is repeated for the second phase. The number of optimization phases is equal to the magnification factor number for the envelop blocks. In the last optimization phase, the dimensions of the envelop blocks become equal to the actual facilities. For more detail, we refer to Mir and Imam .
So, the proposed approach for solving a facility layout problem can be summarized as follows. Step 1: encapsulating facilities in envelop blocks (multiplying the dimensions of facilities by a magnification factor). Step 2: obtaining an MPG. Step 3: drawing the MPG on the plane and obtaining an initial solution. Step 4: improving initial solution by analytical method.Figure 3 shows summary of these steps.
The proposed approach was coded using the VB.NET programming language in a program named GOT (Graph optimization technique). Five test problems were run. For all test problems, results were obtained on a PC with Intel T5470 processor. The results were compared with the previously published papers and commercial software VIP-PLANOPT 2006. VIP-PLANOPT is a useful layout software package that can generate near-optimal layout . For more details about VIP-PLANOPT, see Engineering Optimization Software . VIP-PLANOPT results were obtained from the software user’s manual. The results are presented in the following sections.
4.1. Test Problem #1
This problem of 8 facilities was introduced by Imam and Mir . Figure 4 shows the steps for accruing the initial solution. Figure 4(a) shows the flow matrix and dimension of facilities. All dimensions and cost matrix elements are integer-valued numbers ranging between 1 and 6. There are several pairs of facilities with no flow between them. Distance norm is squared Euclidean. The greedy heuristic generates the edges lists of MPG as shown in Figure 4(b).
The straight line drawing algorithm gives the coordinates of vertices. The drawing is shown in Figure 4(c). Then, each vertex is replaced by its correspondent facility. The coordinates are multiplied by maximum dimensions of facilities (width and length), and finally, the initial layout design is shown in Figure 4(d).
The solution is improved by the analytical technique. Figure 5 shows the final layout. The cost function value for this layout is 752.7, and the running time is 0.4 second. Table 1 shows the results obtained by the other approaches. The best solution for this problem is obtained by VIP-PLANOPT 2006.
4.2. Test Problem #2
This problem of 20 unequal area facilities was introduced by Imam and Mir . The data consist of only integer values. The dimensions of the facilities are between 1 and 3. The elements of the cost matrix are integers between 0 and 5. The distance norm is rectilinear. The final layout obtained by GOT is shown in Figure 6. The layout cost is 1302, and the running time is 0.6 second. Table 2 compares the results obtained by GOT with the results available in the literature. VIP-PLANOPT 2006 has the lowest value of the cost function.
4.3. Test Problem #3
This is a problem of 50 facilities randomly generated by VIP-PLANOPT 2006. The dimensions of the facilities are decimal numbers between 1 to 6. The elements of the cost matrix are all integers between 1 and 10. The distance norm is Euclidean. The results are shown in Table 3. The best published result has a cost of 78224.7, whereas GOT produces a final layout with a cost of 76882.3 only in 15.1 seconds. Figure 7 shows the final layout.
4.4. Test Problem #4
This is a randomly generated large size problem of 100 facilities. The dimensions of the facilities are decimal numbers between 1 and 6. The cost matrix elements are integers between 1 and 10. The distance norm is rectilinear. The results are shown in Table 4. GOT obtained the cost function value of 527094.1 in 74.3 seconds. This value is about 2% below the cost function value of VIP-PLANOPT 2006. The coordinates of the facilities for the layout obtained by GOT are given in Table 5.
4.5. Test Problem #5
This is a large size problem of 125 facilities randomly generated by VIP-PLANOPT 2006. The dimensions of facilities are real numbers between 1 and 6, and elements of the cost matrix are integers between 1 and 10. The distance norm is rectilinear. The results are shown in Table 6. GOT obtained the cost function value of 1062080 in 129.6 seconds. This value is about 2% below the cost function value of VIP-PLANOPT 2006. The coordinates of the facilities for the layout obtained by GOT are given in Table 7.
5. Comparing GOT Initial Solution with Random Initial Solution
To compare the proposed initial solution (GOT initial solution) with random initial solution, a set of test problems were generated. The facilities dimensions were , and flow matrices were randomly generated between 0 and 10. For acquiring a random initial solution, facilities were randomly placed in a ( − 4) × ( − 2) integer grid. For each test problem, 20 random placements were found. Table 8 shows the value of cost function in GOT initial solution and the best value found by random placements. Figures 8 and 9 shows these results graphically. The results demonstrated significant improvement in cost function.
6. Summary and Conclusion
An initial solution has been presented for the layout design of facilities on a continuous plane. The technique consists of two stages. In the first stage, a maximal planar graph (MPG) is obtained. In the second stage, the vertices of MPG are drawn on the plane by graph drawing algorithms. Then, vertices are replaced by facilities. Hence, an initial solution is obtained. To evaluate the performance, this initial solution has been applied in rectangular facility layout problem and improved by an analytical method by Mir and Imam .
The approach has been tested on five instances from the literature. Table 6 shows the Summary of the results, and Figure 8 shows the cost reduction by the technique. For the large size problems involving 50, 100, and 125 facilities, the layout costs values are better than those obtained by the previously published techniques. As shown in Table 9, the results demonstrate effectiveness of the technique, especially for large size problems.
This paper introduced a simple technique for obtaining a good initial solution. The technique, with some modification, can be applied in facility layout approaches that use a randomly generated initial solution. In future researches, it would be interesting to analyze the influence of MPG and graph drawing algorithm on the solution. The results can be further improved by using a metaheuristic such as GRASP  and Tabu search  for generating a high weighted MPG.
Conflict of Interests
The authors declare that they have no conflict of interests.
- S. P. Singh and R. R. K. Sharma, “A review of different approaches to the facility layout problems,” International Journal of Advanced Manufacturing Technology, vol. 30, no. 5-6, pp. 425–433, 2006.
- M. F. Anjos and A. Vannelli, “An attractor-repeller approach to floorplanning,” Mathematical Methods of Operations Research, vol. 56, no. 1, pp. 3–27, 2002.
- I. Castillo and T. Sim, “A spring-embedding approach for the facility layout problem,” Journal of the Operational Research Society, vol. 55, no. 1, pp. 73–81, 2004.
- Z. Drezner, “DISCON: a new method for the layout problem,” Operations Research, vol. 28, no. 6, pp. 1375–1384, 1980.
- M. H. Imam and M. Mir, “Nonlinear programming approach to automated topology optimization,” Computer-Aided Design, vol. 21, no. 2, pp. 107–115, 1989.
- M. H. Imam and M. Mir, “Automated layout of facilities of unequal areas,” Computers and Industrial Engineering, vol. 24, no. 3, pp. 355–366, 1993.
- M. Mir and M. H. Imam, “Hybrid optimization approach for layout design of unequal-area facilities,” Computers and Industrial Engineering, vol. 39, no. 1-2, pp. 49–63, 2001.
- Engineering Optimization Software, VIP-PLANOPT, 2006, 2010, http://www.planopt.com/.
- L. Foulds, Graph Theory Applications, Springer, New York, NY, USA, 1992.
- M. M. D. Hassan and G. L. Hogg, “A review of graph theory application to the facilities layout problem,” Omega, vol. 15, no. 4, pp. 291–300, 1987.
- M. M. D. Hassan and G. L. Hogg, “On converting a dual graph into a block layout,” International Journal of Production Research, vol. 27, no. 7, pp. 1149–1160, 1989.
- K. H. Watson and J. W. Giffin, “The vertex splitting algorithm for facilities layout,” International Journal of Production Research, vol. 35, no. 9, pp. 2477–2492, 1997.
- S. A. Irvine and I. Rinsma-Melchert, “A new approach to the block layout problem,” International Journal of Production Research, vol. 35, no. 8, pp. 2359–2376, 1997.
- P. S. Welgama, P. R. Gibson, and L. A. R. Al-Hakim, “Facilities layout: a knowledge-based approach for converting a dual graph into a block layout,” International Journal of Production Economics, vol. 33, no. 1–3, pp. 17–30, 1994.
- M. A. Jokar and A. S. Sangchooli, “Constructing a block layout by face area,” The International Journal of Advanced Manufacturing Technology, vol. 54, no. 5–8, pp. 801–809, 2011.
- L. R. Foulds, P. B. Gibbons, and J. W. Giffin, “Facilities layout adjacency determination: an experimental comparison of three graph theoretic heuristics,” Operations Research, vol. 33, no. 5, pp. 1091–1106, 1985.
- E. G. John and J. Hammond, “Maximally weighted graph theoretic facilities design planning,” International Journal of Production Research, vol. 38, no. 16, pp. 3845–3859, 2000.
- S. G. Boswell, “TESSA—a new greedy heuristic for facilities layout planning,” International Journal of Production Research, vol. 30, no. 8, pp. 1957–1968, 1992.
- L. R. Foulds and D. F. Robinson, “Graph theoretic heuristics for the plant layout problem,” International Journal of Production Research, vol. 16, no. 1, pp. 27–37, 1978.
- I. H. Osman, “A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem,” Computers and Operations Research, vol. 33, no. 9, pp. 2526–2546, 2006.
- I. H. Osman, B. Al-Ayoubi, and M. Barake, “A greedy random adaptive search procedure for the weighted maximal planar graph problem,” Computers and Industrial Engineering, vol. 45, no. 4, pp. 635–651, 2003.
- J. M. Boyer and W. J. Myrvold, “On the cutting edge: simplified O(n) planarity by edge addition,” Journal of Graph Algorithms and Applications, vol. 8, no. 3, pp. 241–273, 2004.
- G. Di Battista, P. Eades, R. Tamassia, and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall PTR, Upper Saddle River, NJ, USA, 1998.
- M. Chrobak and T. H. Payne, “A linear-time algorithm for drawing a planar graph on a grid,” Information Processing Letters, vol. 54, no. 4, pp. 241–246, 1995.
- S. Heragu, Facilities Design, Iuniverse Inc., 2006.