• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.9
• /
• pp.46-58
• /
• 1993

Owing to the nature of locality in mask layouts, it appears that most mask layout problems can be solved by transforming a part of the given mask layout into a better layout segment continuously toward a global suboptimal solution. This notion of local transformation addresses major weak points of existing mask layout processing systems, which lack both extensibility and unifiability. This paper attempts to elaborate upon developing a new rule-based mask layout transformation system wherein most of the mask layout problems can be solved under the unified framework of local mask layout transformation. The rule-based mask layout transformation system is applicable to various mask layout problems such as net extraction, mask layout compaction, mask layout editing, and design rule checking. The experimental results show that the rule-based expert system approach is an efficient means of solving those mask layout problems, and thus confronting major drawbacks of existing layout processing systems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.539-550
• /
• 1998

A computerized layout system based on a constraint satisfaction problem (CSP) technique was developed to treat both facility layout and instrument panel layout problems. This layout system attempts to allocate various facilities under multiple layout criteria including qualitative design objectives. Since most of the design objectives can be understood as constraints which the layout solution must satisfy to improve the goodness of the solution, a CSP technique was employed to solve the multi-constraints layout problem. The effectiveness of the system was evaluated by the comparison with the well-known facility layout program, CORELAP. Furthermore, the proposed system can also be applied to the instrument panel layout problem successfully. Several user-centered guidelines were well reflected on the solution obtained. CONSLAY, the prototype layout system being developed in the research, greatly enhanced the interactions with the designer so as to deal with the problem-dependent nature of the layout problem and to properly reflect the domain-specific knowledge of the designer.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.82-93
• /
• 2005

Facility layout problems (FLP) are usually treated as design problems. Lack of systematic and objective tools to compare design alternatives results in decision-making to be dominated by the experiences or preferences of designers or managers. To increase objectivity and effectiveness of decision-making in facility layout selections, a decision support model is necessary. We proposed a decision model, which regards the FLP as a multi-attribute decision making (MADM) problem. We identify sets of attributes crucial to layout selections, quantitative indices for attributes, and methods of ranking alternatives. For a requested facility layout design, many alternatives could be developed. The enormous alternatives, various attributes, and comparison of assigned qualitative values to each attribute, form a complicated decision problem. To treat facility layout selection problems as a MADM problem, we used the linear assignment method to rank before selecting those high ranks as candidates. We modelled the application of the Nemawashi process to simulate the group decision-making procedure and help efficiently achieve agreement. The electronics manufacturing service (EMS) industry has frequent and costly facility layout modifications. Our models are helpful to them. We use an electronics manufacturing service company to illustrate the decision-making process of our models.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.3
• /
• pp.174-183
• /
• 2001

This study proposes an improved genetic algorithm (GA) to derive solutions for facility layout problems having inner walls and passages. The proposed algorithm models the layout of facilities on a flour-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities and passages are represented as an adjacency graph. The shortest path and distance between two facilities are calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithm for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared to an actual ship compartment layout.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.4
• /
• pp.129-137
• /
• 2011

To date, facility layout problems has been solved and applied for job shop situations. Since flow shop has more restrictions, the solution space is much smaller than job shop. An efficient heuristic algorithm for facility layout problems for flow shop layouts is needed to be developed. In this thesis, a heuristic algorithm for rectangular bay layouts in a flow shop situation is presented. The proposed algorithm is developed by using slicing tree representation and applied to various flow shop layout problems. The effectiveness of the proposed algorithm in terms of exploration rate and objective function value are shown by comparing our results to simulated annealing.

• Journal of the Korea Institute of Building Construction
• /
• v.12 no.6
• /
• pp.664-673
• /
• 2012

Determining the layout of temporary facilities that support construction activities at a site is an important planning activity, as layout can significantly affect cost, quality of work, safety, and other aspects of the project. The construction site layout problem involves difficult combinatorial optimization. Recently, various artificial intelligence(AI)-based algorithms have been applied to solving many complex optimization problems, including neural networks(NN), genetic algorithms(GA), and swarm intelligence(SI) which relates to the collective behavior of social systems such as honey bees and birds. This study proposes a site facility layout optimization algorithm based on self-organizing maps(SOM). Computational experiments are carried out to justify the efficiency of the proposed method and compare it with particle swarm optimization(PSO). The results show that the proposed algorithm can be efficiently employed to solve the problem of site layout.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.4
• /
• pp.469-478
• /
• 2012

This study aims to discover the optimal pipe layout for a ship, which generally needs a lot of time, efforts and experiences. Genetic algorithm was utilized to search for the optimum. Here the optimum stands for the minimum pipe length between two given points. Genetic algorithm is applied to planar pipe layout problems to confirm plausible and efficiency. Sub-programs are written to find optimal layout for the problems. Obstacles are laid in between the starting point and the terminal point. Pipe is supposed to bypass those obstacles. Optimal layout between the specified two points can be found using the genetic algorithm. Each route was searched for three case models in two-dimensional plane. In consequence of this, it discovered the optimum route with the minimized distance in three case models. Through this study, it is possible to apply optimization of ship pipe route to an actual ship using genetic algorithm.

• Journal of Korean Society for Quality Management
• /
• v.14 no.2
• /
• pp.61-68
• /
• 1986

In this modern environment, manufacturing companies must continually persevere in their efforts to solve the problems encountered in the effort to improve productivity and quality while simultaneously reducing production costs. In this paper, we have approached the problem of layout planning by using the Muther' Systematic Layout Planning model (1961). This model applied the "H" company layout problem. In conclusion the "H" company mislayout in plant. We have a compare this model to old method ("H" company present layout), we produced a good result in layout.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.215-215
• /
• 1988

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.215-232
• /
• 1996

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.