• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.359-370
• /
• 1997

We consider a facility layout problem with the objective of minimizing total transportation distance, which is the sum of rectilinear distances between facilities weighted by the frequency of trips between the facilities. It is assumed that facilities are required to have rectangular shapes and there is no empty space between the facilities in the layout. In this study, a graph theoretic heuristic is developed for the problem. In the heuristic, planar graphs are constructed to represent adjacencies between the facilities and then the graphs are converted to block layouts on a continual plane using a layout construction module. (Therefore, each graph corresponds to a layout.) An initial layout is obtained by constructing a maximal weighted planar graph and then the layout is improved by changing the planar graph. A simulated annealing algorithm is used to find a planar graph which gives the best layout. To show the performance of the proposed heuristic, computational experiments are done on randomly generated test problems and results are reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.63-81
• /
• 1995

This paper presents a model and algorithm for solving the multi-factor plant layout problem. The model can incorporate more than two factors that may be either quantitative or qualitative. The algorithm is based on simulated annealing, which has been successfully applied for the solution of combinatorial problems. A set of problems previously used by various authors is solved to demonstrate the effectiveness of the proposed methods. The results indicate that the proposed methods can yield good quality for each of eleven test problems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.45-48
• /
• 1996

The most research on facility layout problems ignored the actual shape of building where the activities(departments) are to be arranged. They also ignored the aisles between departments inside the building. In this paper, we present a genetic algorithm that searches a very good facility layout with horizontal aisles for two different cases with respect to the department shape. From the extensive experiments, the proposed genetic algorithm generated better layouts than the ones obtained by applying Tam's algorithm. It showed about 10% improvement of performance. We found out the best combination of genetic operators through the experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.162-165
• /
• 1998

We consider a facility layout problem for optimized material flow system design in the automated production system design. Existing facility layout algorithm have a weak point that arranged facilities have irregular shape or don't preserve their own shape and size. The proposed algorithm give a layout which is minimize total material handling cost and maximize space utility under preserving each facilities' own shape and size.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.334-338
• /
• 2000

One of the major drawbacks of the existing facility layout methods is that most of them were developed based on pre-defined cost functions, and therefore fail to cope with the dynamic aspects of modern manufacturing systems. Another drawback is that due to the poor representation capability of the block diagrams, they are not able to convey the sufficient information needed by facility designers. In this paper, a system for solving facility layout problem considering these matters in cellular manufacturing environment is proposed and implemented using GA approach with embedded simulation module and virtual reality technologies.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2006.08a
• /
• pp.112-116
• /
• 2006

In this presentation we will describe two core elements, which combination gives a new approach to layout verification; they are a computational algorithm for modeling of photolithographical processes and a method for physical layout verification that uses output contours of that algorithm. Utilization of this approach allows to improve the quality of LCOS/AM OLED backplanes physical verification, because it considers discrepancies between mask features and printed contours on a wafer.

• Management Science and Financial Engineering
• /
• v.17 no.2
• /
• pp.23-37
• /
• 2011

In this paper, we address a layout design problem for determining an optimal 4-class-based dedicated linear storage layout in a class of unit load storage systems. Assuming that space requirement for a class is the sum of the maximum inventory levels of products assigned to the class, and that one-way travel time is a linear function of storage index, we formulate a 4-class-based dedicated linear storage problem PTL[4] and provide an exact splitting algorithm with $O(n{\lceil}logn{\rceil})$. Our algorithms could be applied to more than a 4-class-based dedicated storage layout problem with slight modification in order to reduce computational execution time.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2013.11a
• /
• pp.212-213
• /
• 2013

The constructability of Formwork has a importantly influence on the duration and cost in a construction project. However, the existing studies on the formwork are mainly focused on a method of construction. Although a layout planning of forms, especially, is an important factors affecting the constructability and cost, it is done by engineers empirically and intuitionally after completion of structure design. Therefore this study suggest a decision support model for optimal formwork layout model based on the rearrangement of structural members by using Genetic Algorithm to improve constructability of formwork.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.5
• /
• pp.376-382
• /
• 2000

A problem of relevant interest to some industries is that of the optimum two-dimensional layout. In this problem, one is given a number of rectangular sheets and an order for a specified number of each of certain types of two-dimensional regular and irregular shapes. The aim is to cut the shapes out of the sheets in such a way as to minimize the amount of waste produced. In this paper, we propose a genetic algorithms using rotation parameters by which the best pattern of layout is found.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.6 no.8
• /
• pp.1-11
• /
• 1983

This study is consists of two parts. First, we analyzed two construction algorithms; CORELAP( Computerized Relationship Layout Planning) and ALDEP (Automated Layout Design Program). And we made a New Relationship Layout Planning overcoming the defaults of CORELAP and ALDEP. Second, we described the only improvement algorithm CRAFT(Computerized Relative Allocation of Facilities Technique). And we modified the CRAFT, which is considering the economic evaluation.