• 한국컴퓨터정보학회논문지
• /
• 제18권6호
• /
• pp.71-79
• /
• 2013

화합물의 상호 관계를 그래프를 통해 표현하는 대사 경로는 본질적인 복잡성 때문에 대사 경로 내의 흐름을 한눈에 알 수 있도록 가시화하여 보여 주는 도구가 반드시 필요하다. 또한 유전체 수준의 대사 경로를 연구하기 위해서는 대사 경로 그래프 레이아웃 상에 나타나는 에지 교차를 줄이는 것이 시각화의 매우 중요한 부분이다. 본 논문은 생물학에서의 대사 경로에 대한 시각화를 위한 3-계층을 이용한 대사 경로 레이아웃 알고리즘을 제안한다. 대사경로의 구조적 특징을 고려하여 노드수가 증가하여도 에지 교차가 기하급수적으로 증가하는 문제를 해결하기 위하여 연결성 높은 노드와 환형 컴포넌트를 중앙계층에 위치시키고 나머지 부분 그래프를 상위와 하위 계층에 레이아웃 하도록 한다. 실험을 통해 에지 교차수가 줄어듦을 확인할 수 있다.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.22-28
• /
• 2009

We consider facility layout problems, where mn facility units are assigned into mn cells. These cells are arranged into a rectangular pattern with m rows and n columns. In order to solve this cell type facility layout problem, many approximation algorithms with improved local search methods were studied because it was quite difficult to find exact optimum of such problem in case of large size problem. In this paper, new algorithms based on Simulated Annealing (SA) method with two neighborhood generation methods are proposed. The new neighborhood generation method adopts the exchanging operation of facility units in accordance with adjacent preference. For evaluating the performance of the neighborhood generation method, three algorithms, previous SA algorithm with random 2-opt neighborhood generation method, the SA-based algorithm with the new neighborhood generation method (SA1) and the SA-based algorithm with probabilistic selection of random 2-opt and the new neighborhood generation method (SA2), are developed and compared by experiment of solving same example problem. In case of numeric examples with problem type 1 (the optimum layout is given), SA1 algorithm could find excellent layout than other algorithms. However, in case of problem type 2 (random-prepared and optimum-unknown problem), SA2 was excellent more than other algorithms.

• 대한인간공학회:학술대회논문집
• /
• 대한인간공학회 1995년도 추계학술대회논문집
• /
• pp.172-181
• /
• 1995

A control panel layout system was developed to generate an ergrnomically sound panel design. A constraint satisfaction concept was introduced as a framework of incorporating diverse ergonomic design guidelines into the panel layout. An efficient search algorithm which can find a constraint satisfaction solution within a reasonable time was developed based on preprocess and look ahead procedures with the backjumping technique. The proto- type panel layaout system was developed on a SPARC workstation. The constraint satisfaction algorithm was programmed in C language with Motif as a GUI tool under the X-windows environment. The effectiveness of the prototype paned layout system was examined by a case study.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2010년도 춘계학술대회 논문집
• /
• pp.1574-1579
• /
• 2010

This paper deals with the development of warehouse layout design algorithm. In the developed model, receiving/outgoing areas, storage areas, picking/distribution areas, value-added operation areas and support areas are considered. For more efficient use of the warehouse floor space, a mezzanine floor is also considered. We develop heuristic algorithms of warehouse layout design for several cases: three types of warehouse and three types of flow. This study is expected to be used as a guideline in warehouse layout design phase.

• Ocean Systems Engineering
• /
• 제2권4호
• /
• pp.271-287
• /
• 2012

Due to its large size, a ship is first divided into scores of blocks and then each block is constructed through various shops, such as the assembly shop, the painting shop, and the outfitting shop. However, each block may not be directly moved to the next shop and may be temporarily laid at a block stockyard because the working time in each shop is different from each other. If blocks are laid at the block stockyard without any planning, the rearrangement of the blocks by a transporter is required because the blocks have the different in and out time. In this study, a block layout method based on the genetic algorithm was proposed in order to minimize the rearrangement of the blocks in the block stockyard. To evaluate the applicability of the proposed method, it was applied to simple layout problems of the block stockyard. The result shows that the proposed method can yield a block layout that minimizes the total relocation cost of moving obstacle blocks in the block stockyard.

• 한국건축시공학회지
• /
• 제12권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.

• 산업공학
• /
• 제14권1호
• /
• pp.20-29
• /
• 2001

This paper presents a concurrent design approach that deals with manufacturing cell formation and cellular layout in Cellular Manufacturing System. Manufacturing cell formation is to group machines into machine cells dedicated to manufacture of part families, and cellular layout problem determines layout of the manufacturing cells within shop and layout of the machines within a cell. In this paper, a concurrent approach for design of machine cell and cellular layout is developed considering manufacturing parameters such as alternative process plans, alternative machines, production volume and processing time of part, and cost per unit time of operation. A mathematical model which minimizes total cost consisting of machine installation cost, machine operating cost, and intercell and intracell movements cost of part is proposed. A hybrid method based on genetic algorithm is proposed to solve the manufacturing cell formation and cellular layout design problem concurrently. The performance of the hybrid method is examined on several problems.

• 품질경영학회지
• /
• 제21권2호
• /
• pp.232-241
• /
• 1993

The objective of this study is to develop an algorithm in the consideration of importance Weight and desirable shape of specific department in the computerized layout planning. Quantitative relationship chart between each department was used. It is decided that the priority among the department as to variable factors and the optimum quantitative relationship chart was obtained using by the Weighting method. The algorithm presented in this study could generate more practical layout for the actual design problem.

• 대한산업공학회지
• /
• 제20권2호
• /
• pp.65-76
• /
• 1994

The most effective computer algorithms for facility layout that have been found are mainly based on the improvement heuristic such as CRAFT. In this paper, we present a new algorithm which is based on the Kohonen neual network. The algorithm firstly forms a self-organizing feature map where the most important similarity relationships among the facilities are converted into their spatial relationships. A layout is then obtained by a minor adjustment to the map. Some simulation results are given to show the performance of the algorithm.

• 대한전자공학회논문지
• /
• 제21권4호
• /
• pp.72-77
• /
• 1984

본 논문에서는 LSI layout의 배치 프로그램을 개발하고 그 실험 결과에 관해 논하였다. 100% 결선율 달성을 위해 가상 기선 경로법으로는 실제의 배선에 가까운 알고리즘을 도입하여 채널 밀도 계산에 반영하였다. 목적함수로는 총배선장의 최소화, 통과선수의 최소화, 최대 채널 밀도의 최소화를 동시에 산출 가능한 함수를 도입하였다. 제안된 가상배선경로 계산 알고리즘은 O(n2)으로 계산시간이 매우 바르고 최소배선장에 근사한 배선상태를 나타내므로 배치 문제에 적용하기에 매우 적합하다. 이 알고리즘을 사용하여 자동 배치 프로그램을 개발하고 작성된 프로그램의 실험결과를 통하여 제안된 알고리즘의 유용성을 보였다.