• Title/Summary/Keyword: layout algorithm

Search Result 355, Processing Time 0.033 seconds

3-layer 2.5D Metabolic pathway layout algorithm (3 계층의 2.5차원 대사경로 레이아웃 알고리즘)

  • Song, Eun-Ha;Yong, Seunglim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.6
    • /
    • pp.71-79
    • /
    • 2013
  • Metabolic pathway, represented by well-displayed graph, have a complex binding structure, which makes the graphical representation hard to visualize. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 3-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in middle layer. Then the remaining subgraphs except meaningful components are drawn in upper and lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. Our algorithm solve the problem that edge crossings exponentially increase as the number of nodes grows.

Efficient Algorithms for Solving Facility Layout Problem Using a New Neighborhood Generation Method Focusing on Adjacent Preference

  • Fukushi, Tatsuya;Yamamoto, Hisashi;Suzuki, Atsushi;Tsujimura, Yasuhiro
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.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.

Development of an ergonomic control panel layout system and its application

  • 박성준;정의승;이상도;이동춘
    • Proceedings of the ESK Conference
    • /
    • 1995.10a
    • /
    • 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.

  • PDF

Development of Layout Design Algorithm for Warehouse (보관시설의 작업공간 배치 알고리즘 개발)

  • Lee, Suk;Kim, Young-Joo;Kwon, Yong-Jang
    • Proceedings of the KSR Conference
    • /
    • 2010.06a
    • /
    • 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.

  • PDF

Block layout method in the block stockyard based on the genetic algorithm

  • Roh, Myung-Il
    • Ocean Systems Engineering
    • /
    • v.2 no.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.

Optimization Algorithms for Site Facility Layout Problems Using Self-Organizing Maps

  • Park, U-Yeol;An, Sung-Hoon
    • 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.

Design of Manufacturing Cell and Cellular Layout based on Genetic Algorithm (유전 알고리듬에 기초한 제조셀과 셀 배치의 설계)

  • Cho, Kyu-Kab;Lee, Byung-Uk
    • IE interfaces
    • /
    • v.14 no.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.

  • PDF

A Layout Design Algorithm with the Importance Weight and Shape of Department (부서중요도(部署重要度)와 요구형태(要求形態)를 고려(考慮)한 배치(配置) 설계(設計) 알고리즘)

  • Lee, Sang-Seol;Gang, Hui-Jeong
    • Journal of Korean Society for Quality Management
    • /
    • v.21 no.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.

  • PDF

FLASOM - Facility Layout by a Self-Organizing Map (FLASOM - 자기조직화 지도를 이용한 시설배치)

  • Lee, Moon-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.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.

  • PDF

A Study on Layout CAD of LSI (LSI의 Layout CAD에 관한 연구 -자동 배치 프로그램 개발-)

  • Lee, Byeong-Ho;Jeong, Jeong-Hwa;Im, In-Chil
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.4
    • /
    • pp.72-77
    • /
    • 1984
  • A placement program in LSI layout is developed and the results of test are discussed in this paper. In order to achieve 100% wiring, this paper introduces, as a virtual routing method, an algorithm which is close to the real routing. This algorithm is reflected to calculate the channel density. An object function is introduced to achieve minimization of total wire length, number of cuts, and maximum channel density simultaneously. The time complexity for the proposed virtual routing algorithm is O(n2). The time required for the algorithm is very short. This algorithm represents the routing state which is close to minimum wire length. So this algorithm is very proper to the application of placement problem. An auto-placement program is developed by the use of this algorithm. The efficiency of the proposed algorithm is shown in the test of the developed program.

  • PDF