• 전자공학회논문지A
• /
• 제32A권1호
• /
• pp.206-221
• /
• 1995

Metal-Metal Matrix(M$^{3}$) layout is a recently proposed layout style which uses minimum amount of poly wires for high speed operation. In this paper we propose a method of generating functional modules in M$^{3}$ layout style. In the proposed method the transistors and the input/output lines of the given circuit are first placed in M$^{3}$ layout style and then they are interconnected using two metal layers. We develop a new placement method by simulated annealing, and we modify the well known channel routing method for the interconnections. When we applied our method to several logic circuits, the area of the generated layout is smaller than the ones by the previously known method. Our results also compares favorably to the other layout styles like gate matrix layout.

• 교육녹색환경연구
• /
• 제2권1호
• /
• pp.69-79
• /
• 2002

This paper investigates the methodology to develop a layout of the simulator for measuring and evaluating human sensibility. Since the simulator layout is different from general building layouts in that it is organized in order to communicate systematically between facilities, laboratories to evaluate human sensibility and equipments to support experiments in simulator, two approaches based on eigenvector and cut tree are support to develop a simulator layout. Qualitative input data (relationship chart, space requirements for each laboratory and equipment) are obtained and transformed into quantitative data. The information obtained by two approaches provides several meaningful clues to generate the simulator layout. The simulator layout is presented based on the obtained information by two approaches. Extracted quantitative data by using eigenvector and cut tree are meaningful of generating the simulator layout.

• 품질경영학회지
• /
• 제19권1호
• /
• pp.151-162
• /
• 1991

The purpose of this study is to propose a facility layout design algorithm based on artificial intelligence concept, and then to develop a computer program which is more practical than any other conventional facility layout design systems. The algorithm is composed of five step layout procedures; knowledge and data input, knowledge interpretation, priority determination, inference of layout design, and evaluation, In the step of priority determination, the algorithm is divided into single row and multi row layout problem. In the step of inference of layout design, alternatives are generated by constraints-directed reasoning and depth first search method based on artificial intelligence concept. Alternatives are evaluated by the moving cost and relationship value by interactive man-machine interface in the step of evaluation. As a case study, analytical considerations over conventional programs such as CRAFT and CORELAP was investigated and compared with algorithm propsed in this study. The proposed algorithm in this study will give useful practical tool for layout planner. The computer progran was written in C language for IBM PC-AT.

• 대한기계학회논문집
• /
• 제17권12호
• /
• pp.3063-3072
• /
• 1993

The layout is an important and difficult problem in industrial applications like sheet metal manufacturing, garment making, circuit layout, plant layout, and land development. The module layout problem is known to be non-deterministic polynomial time complete(NP-complete). To efficiently find an optimal layout from a large number of candidate layout configuration a heuristic algorithm could be used. In recent years, a number of researchers have investigated the combinatorial optimization problems by using neural network principles such as traveling salesman problem, placement and routing in circuit design. This paper describes the application of Self-organizing Feature Maps(SOM) of the Kohonen network and Simulated Annealing Algorithm(SAA) to the layout problem of the two-dimensional rectangular shapes.

• 한국시뮬레이션학회논문지
• /
• 제10권2호
• /
• pp.1-14
• /
• 2001

The layout design of component plays an important role in the design and usability of many engineering products. The Engineering artifacts of today are becoming increasingly complicated. The simulated annealing method has been applied effectively to the layout and packing problems of wafer. The main characteristics of simulated annealing method is that an optimum can be obtained from the many local optimums by controlling the temperature and introducing the statistic flickering. The objective of this study is to suggest a method to apply the simulated annealing method to the three dimensional layout design of submergible boat which has multiple constraint conditions and evaluation criteria. We describe an approach to define cost function, constraints and generate layouts using a computer. In this research three dimensional LAYout Design Optimization Program(LAYDOP ver.2) has been developed. The layout result(the total value of evaluation criteria) designed by a human layout expert has been improved by 31.0% using this program.

• 한국CDE학회논문집
• /
• 제6권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.

• 대한산업공학회지
• /
• 제23권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.

• 대한안전경영과학회지
• /
• 제12권3호
• /
• pp.215-221
• /
• 2010

Many researches and projects are actively implemented in the academic world and industrial world in order to increase the productivity through changing utility layout. Effective layout makes the flow of parts and products go on wheels and helps labor forces and utilities to be used efficiently. In this study, we looked at effect on utility layout change through a case of a company making a fuel tank of vehicle in Korea. Due to the layout improvement, this company could have flowshop system on welding line, so the stock in line was decreased, checking the number of stock became easier than before and it was possible to evaluate exact cycle time per unit. Through not only confirming qualitative effect, but also checking quantitative effect such as UPH(Unit per Hour), we obtained the conclusion that the layout improvement increased the productivity.

• 산업경영시스템학회지
• /
• 제22권49호
• /
• pp.89-98
• /
• 1999

The objective of this study is to develop an improved algorithm for layout problems. Computerized facility layout program was also applied to solve the layout problem in locomotive maintenance workshop. The current facility layout is structured in the large space without considerations of many variable factors. For this reason, effectiveness of layout results in loss on effective space utility. This study is to develop an algorithm in the consideration of importance weight and desirable shape of specific department in the computerized layout planning and quantitative relationship rating between each department was used. Standard process duration of locomotive maintenance workshop was used to select the main activities of locomotive maintenance work. This study could generate more efficient facility layout design to reduce the number of movement frequency and travel distance in maintenance workshop.

• 한국멀티미디어학회논문지
• /
• 제3권4호
• /
• pp.407-415
• /
• 2000

설비 집약적이며 복잡한 생산 시스템중의 하나인 반도체 FAB 공정은 제품의 흐름시간과 대기시간, 공정 중 재고를 줄이는 것이 흐름제어의 가장 중요한 목표이다. 이에 본 연구에서는 소품종 다랑 생산 시스템에서 발생하는 비경제성을 줄이고 생산성을 향상시키기 위하여 현재 반도체 양산 회사에서 주로 채택하고 있는 In-Line Layout을 분석하고 새로운 제안 방식인 그룹테크놀로지를 이용한 Job Shop 형태의 Stand Alone Layout과 함께 각각의 모델로 구축하고 시뮬레이션 함으로써 일별 생산 계획상의 회수 변화에 따른 각Layout의 특성을 비교, 분석하였다. 이 때 사용한 시뮬레이션 툴은 모델 구축 및 시뮬레이션이 용이하고 범용적인 (이산형 제조 시스템용) ProSys를 사용하였다. 연구 결과로는 일별 생산 계획상의 회수 초기에는 In-Line Layout이 Stand Alone Layout보다 대체로 생산량 측면에서 우세하지만 일별 생산계획상의 회수가 증가된 14회부터는 Stand Alone Layout이 더 우세한 것으로 나타났다