• Korean Chemical Engineering Research
• /
• v.52 no.4
• /
• pp.475-480
• /
• 2014

In the fields of researches associated with plant layout optimization, the main goal is to minimize the costs of pipelines for connecting equipment. However, what is the lacking of considerations in previous researches is to handle the multi floor processes considering the safety distances for domino impacts on a complex plant. The mathematical programming formulation can be transformed into MILP (Mixed Integer Linear Programming) problems as considering safety distances, maintenance spaces, and economic benefits for solving the multi-floor plant layout problem. The objective function of this problem is to minimize piping costs connecting facilities in the process. However, it is really hard to solve this problem due to complex unequality or equality constraints such as sufficient spaces for the maintenance and passages, meaning that there are many conditional statements in the objective function. Thus, it is impossible to solve this problem with conventional optimization solvers using the derivatives of objective function. In this study, the PSO (Particle Swarm Optimization) technique, which is one of the representative sampling approaches, is employed to find the optimal solution considering various constraints. The EO (Ethylene Oxide) plant is illustrated to verify the efficacy of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.3
• /
• pp.1-8
• /
• 2016

The printed circuit board (PCB) can be used only 2 layers of front and back. Therefore, the wiring line segments are located in 2 layers without crossing each other. In this case, the line segment can be appear in both layers and this line segment is to resolve the crossing problem go through the via. The via minimization problem (VMP) has minimum number of via in layout design problem. The VMP is classified by NP-complete because of the polynomial time algorithm to solve the optimal solution has been unknown yet. This paper suggests polynomial time algorithm that can be solve the optimal solution of VMP. This algorithm transforms n-line segments into vertices, and p-crossing into edges of a graph. Then this graph is partitioned into 3-coloring sets of each vertex in each set independent each other. For 3-coloring sets $C_i$, (i=1,2,3), the $C_1$ is assigned to front F, $C_2$ is back B, and $C_3$ is B-F and connected with via. For the various experimental data, though this algorithm can be require O(np) polynomial time, we obtain the optimal solution for all of data.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.6
• /
• pp.62-66
• /
• 1982

A method finding out routability for unrouted signal lines and rerouting those which are turned out to be able to route in layout design of LSI is described. In this paper the problems of finding two-disjoint Paths represented by an undirected graph G=(V,E), where V,E are sets of vertices and edges respectively, are studied. The existence of two-disjoint paths from s1, to t1, (called P1) and from S2 to T2 (called P2) indicated by the four vertices on the graph s1, t1, s2, t2 $\in$ V means that two distinct signal lines exist in layout design. It turns out that the proposed time complexity in the algorithm is O (IVI x IEI).

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.748-753
• /
• 2005

Among processes to manufacture parts from footwear materials like upper leathers, one of the most essential processes is the cutting one optimally arranging lots of parts on raw footwear materials and cutting. A new nesting strategy was proposed for the 2-dimensional part layout by using a two-stage approach, where which can be effectively used for water jet cutting. In the initial layout stage, a SOAL(Self-Organization Assisted Layout) based on the combination of FCM(Fuzzy C-Means) and SOM was adopted. In the layout improvement stage, SA(Simulated Annealing) based approach was adopted for a finer layout. The proposed approach saves much CPU time through a two-stage approach scheme, while other annealing-based algorithm so far reported fur a nesting problem are computationally expensive. The proposed nesting approach uses the stochastic process, and has a much higher possibility to obtain a global solution than the deterministic searching technique. We developed the automatic nesting software of NST(ver.1.1) software for footwear industry by implementing of these proposed algorithms. The NST software was applied by the optimized automatic arrangement algorithm to cut without the loss of leathers. if possible, after detecting damage areas. Also, NST software can consider about several features in not only natural loathers but artificial ones. Lastly, the NST software can reduce a required time to implement generation of NC code. cutting time, and waste of raw materials because the NST software automatically performs parts arrangement, cutting paths generation and finally NC code generation, which are needed much effect and time to generate them manually.

• Journal of the Korea Institute of Building Construction
• /
• v.22 no.6
• /
• pp.689-700
• /
• 2022

Layout work for building structures requires high precision to construct structural elements in the correct location. However, the accuracy and precision of the layout position are affected by the worker's skill, and productivity can be reduced when there is information loss and error. To solve this problem, it is necessary to automate the overall layout operation and introduce information technology, and layout process automation using construction robots can be an effective means of doing this. This study develops a prototype of an automated layout robot for building structures and evaluates its basic performance. The developed robot is largely composed of driving, marking, sensing, and control units, and is designed to enable various driving methods, and movement and rotation of the marking unit in consideration of the environment on structural work. The driving and marking performance experiments showed satisfactory performance in terms of driving distance error and marking quality, while the need for improvement in terms of some driving methods and marking precision was confirmed. Based on the results of this study, we intend to continuously improve the robot's performance and establish an automation system for overall layout work process.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1021-1024
• /
• 1998

Computer-aided design of VLSI circuits is usually carried out in three synthesis steps; high-level synthesis, logic synthesis and layout synthesis. Each synthesis step is further kroken into a few optimization problems. In this paper we study the area minimization problem in floorplanning(also known as the floorplan sizing problem). We propose the area minimization algorithms for general floorplans.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.22
• /
• pp.121-127
• /
• 1990

작업능률향상을 위한 설비배치의 문제는 총자재 운반비용을 최소화하고 실비간의 자재흐름을 최소화하는 문제와 배치들간의 근접도를 최대화시키는 정적인 문제로 다루어져 왔다. 본 논문에서는 이 같은 문제가 계획기간을 확장하는 문제나, 그 이전에 빈번한 문제 (system nervousness)를 D.P.를 이용한 동적인 특성으로 해결하는 것을 제시하고자 한다.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

• Archives of design research
• /
• v.15 no.3
• /
• pp.241-248
• /
• 2002

Researches of Hangul automation have been focused mainly on the set of character system. But, practical problem of using the Korean standard keyboard system of two sets is increment of errors and fatigue due to frequent use of shift keys. The author formulate a hypothesis as follows to solve the problem. 'Changing location and design of shift keys can reduce errors in typing Korean by avoiding interferences with other keys when pressing shift keys.' This study verify the hypothesis by the analysis of experiments using improved keyboard prototypes which have changed layout and design of shift keys. On the result, change of shift key location causes confusion to experienced user. But, while keeping its location, removing other keys at the bottom row and magnifying size of shift keys decrease errors in typing by avoiding interferences. And, the efficiency of typing in Korean is increased, too, because there is not any influence on typing speed. This study focuses on layout and design of shift keys only, but further study for entire layout of keyboard including alternative location of other function keys is needed to improve general usability.

• Journal of Biosystems Engineering
• /
• v.36 no.6
• /
• pp.461-466
• /
• 2011

The purpose of this study is basically for the use of simulations to enhance productivity. In this paper, the optimal number of allocation in a small and medium industry which produces eleutherococcus senticosus sap, is performed using simulations. The simulation model was developed under considerations of production layout, process & operation, process time, total work time, work in process (WIP), utilization, failure rate, and operation efficient as inputs, and was validated with careful comparisons between real behaviors and outputs of the production line. Therefore, we can evaluate effects and changes in productivity when some strategies and/or crucial factors are changed. Although too many workers and machines could decrease productivity, the eleutherococcus senticosus sap production line in this paper has been maintained many machines. To solve this problem, we determined the optimal number of workers and machines that could not cause any interrupt in productions using simulations. This simulation model considers diverse input variables which could influence productivity, and it is very useful not only for the production line of Eleutherococcus Senticosus Sap, but also for other production lines with various purposes, especially, in the small and medium industries.