• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 1997년도 추계학술대회 발표논문집:21세기를 향한 정보통신 기술의 전망
• /
• pp.535-552
• /
• 1997

The facility layout problem has the goal of locating the different facilities in a floor to achieve the greatest efficiency in producing a product or service. This problem is usually formulated as the quadratic assignment problem(QAP). However, the problem of finding optimal layout is hard and traditional approaches are not computationally feasible. In this paper, a genetic algorithm is presented for obtaining efficient layouts. To test the effectiveness of the algorithm, a set of examples is solved and the results are compared to those from other Known algorithms. The comparison indicates that the proposed method performs well for the classical test problems.

• 경영과학
• /
• 제11권3호
• /
• pp.55-65
• /
• 1994

Given the flow matrix, plant size and department sizes, the algorithms in this paper provide the layout with rectilinear distance. To construct automated facility design, cut tree approach is employed. A branch and bound computer code developed by Tillinghast is modifided to find the feasible fits of departments without shape distortion in the plant rectangle.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.1065-1070
• /
• 2003

Facility Layout Planning is concerned with how to arrange facilities necessary for production in a given space. Its objective is often to minimize the total sum of all material flows multiplied by the distance among facilities. FLP belongs to NP complete problem; i.e., the number of possible layout solutions increases with the increase of the number of facilities. Thus, meta heuristics such as Genetic Algorithm (GA) and Simulated Annealing have been investigated to solve the FLP problems. However, one of the biggest problems which lie in the existing meta heuristics including GA is hard to find an appropriate combinations of parameters which result in optimal solutions for the specific problem. The Ant System algorithm with elitist and ranking strategies is used to solve the FLP problem as an another good alternative. Experimental results show that the AS algorithm is able to produce the same level of solution quality with less sensitive parameters selection comparing to the ones obtained by applying other existing meta heuristic algorithms.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• 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.

• Industrial Engineering and Management Systems
• /
• 제12권3호
• /
• pp.181-189
• /
• 2013

This paper proposes a two-phase genetic algorithm (GA) to solve the problem of obtaining an optimum configuration of a paired single row assembly line. We pair two single-row assembly lines due to the shared usage of several workstations, thus obtaining an optimum configuration by considering the material flow of the two rows simultaneously. The problem deals with assigning workstations to a sequence and selecting the best arrangement by looking at the length and width for each workstation. This can be considered as an enhancement of the single row facility layout problem (SRFLP), or the so-called paired SRFLP (PSRFLP). The objective of this PSRFLP is to find an optimal configuration that seeks to minimize the distance traveled by the material handler and even the use of the material handler itself if this is possible. Real-world applications of such a problem can be found for apparel, shoe, and other manual assembly lines. This research produces the schematic representation solution using the heuristic approach. The crossover and mutation will be utilized using the schematic representation solution to obtain the neighborhood solutions. The first phase of the GA result is recorded to get the best pair. Based on these best matched pairs, the second-phase GA can commence.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2018년도 춘계 학술논문 발표대회
• /
• pp.39-40
• /
• 2018

The goal of site layout planning(SLP) is to maximize the productivity and efficiency of the construction by reducing travel distance and material handling cost and manpower. However, SLPs are static layout schemes, which cannot be reorganized during the construction process to correspond with errors, phase transition, changing working environments on the site. To solve this problem, researches on dynamic site layout planning(DSLP) are emerging. This preliminary study clarifies characteristics of temporary facility's variables to develop the vertical DSLP algorithm of high-rise building construction.

• 대한조선학회논문집
• /
• 제50권1호
• /
• pp.14-24
• /
• 2013

The marine leisure industry in Korea has been the focus of the power of economic growth and the creation of jobs in recent years. In this regard, many studies concerning marine leisure are on-going in various fields. In this paper, developed a layout system and algorithm can resolve the factory and facility layout problem. For a layout design of leisure-boat factories, the leisure-boat production process is analyzed in order to derive standard production space elements for the layout of the factory. Based on the results, a draft design of the factory layout is carried out based on the manpower planning data, as well as the characteristics and relationships of each process data. A layout design of this paper can be verified through a factory simulation solution and we suggest the verification method using a SBD(simulation based design) methodology. The layout system takes into account the user's accessibility and extendibility, so it is web-oriented and uses RIA (rich Internet Application) technology. Furthermore, the system and layout algorithm of this paper are verified with samples data that show the efficient factory arrangement and practical application method.

• 한국경영과학회지
• /
• 제21권2호
• /
• pp.59-70
• /
• 1996

Given the flow matrix, plant size (rectangle shape) and department sizes, the algorithm in this paper provides the plant layout with rectilinear distance measure. To construct automated facility design, eigenvector approach is employed. A branch and bound computer code developed by Tillinghast is modified to find the feasible fits of departments without shape distortion (see [1])in the plant rectangle. The computational results compared with CRAFT are shown.

• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2003년도 학술대회지
• /
• pp.99-103
• /
• 2003

건설공사 현장에서 공간활용을 위해 가장 보편적으로 쓰이는 방법이 site plans 이다. 이 방법은 건설 물자재를 적재하고 운반할시 공간이 부족한 도심지 부근에서 어떻게 건설 물자재를 옮기고 적재하는가? 크래인의 위치는 어디에 선정할것인가? 하는 문제를 해결하기 위한 것이다. 본고는 이러한 문제를 수평적으로 해결함과 동시에 수직적으로도 해결할 수 있는 방안을 도출했다. 이러한 해결 방안은 건설현장을 지도 또는 감독하는 메니져에게 가장 효과적으로 건설 물자재를 적재시켜 줄 수 입어 방법론을 제시함으로써 공기의 단축을 가져올 수 있는 효과를 누릴 수 있다. 방법론으로는 Genetic Algorithm을 이용하여 multiple-floor layout 문제점 해결하였다.

• 품질경영학회지
• /
• 제21권1호
• /
• pp.190-198
• /
• 1993

A multiple criteria model for the facility layout problem considers both of the quantitative, the cost of the work flow, and qualitative, the closeness rating score, aspect. Rosenblatt, Fortenberry & Cox and Urban have developed multiple criteria models that consider both of the quantitative and qualitative aspect. Fortenberry & Cox's multiplicity model penalizes facilities with undesirable closeness rating and high work flows more than those undesirable closeness rating and low work flow between them to contribute to the objective function regardless of the closeness rating between these facilities. In this paper, it is intended to develops a improved multiple-criteria facility layout model considering the function for maintaning the distance between facilities.