• 제목/요약/키워드: Solution Representation

검색결과 308건 처리시간 0.025초

Two-Phase Genetic Algorithm for Solving the Paired Single Row Facility Layout Problem

  • Parwananta, Hutama;Maghfiroh, Meilinda F.N.;Yu, Vincent F.
    • 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.

프랙탈과 셰이더 인스턴싱 기법을 이용한 자연스러운 잔디의 실시간 렌더링 (Real-time Rendering of Realistic Grasses Using Fractal and Shader-Instancing)

  • 김진모;조형제
    • 한국멀티미디어학회논문지
    • /
    • 제13권2호
    • /
    • pp.298-307
    • /
    • 2010
  • 게임이나 실시간 시뮬레이션 시스템과 같은 분야에서 잔디는 광범위한 지표면을 구성하는 중요한 요소 중 하나이다. 실제 넓은 지형에 자라나는 많은 수의 잔디를 효율적으로 렌더링 하는 작업은 결코 쉬운 일이 아니다. 이러한 문제를 해결하려면 모델의 질과 계산 비용 절약의 두 가지 문제에 늘 직면하게 된다. 본 논문에서는 이러한 두 가지 문제를 해결하기 위한 방안으로 프랙탈 이론과 인스턴싱 기법을 도입하여 자연스러운 잔디의 효율적인 표현 방법을 제안한다. 기존의 잔디 표현의 경우 동일한 모델을 반복적으로 적용하였지만 본 연구에서는 프랙탈의 자기 유사성의 기본 이론을 활용하되 지형의 성질과 빛의 양을 인자로 도입하여 조건에 맞는 다양한 잔디의 자연스러운 표현 방법을 설계하고 또한 많은 수의 잔디 모델을 실시간으로 렌더링하기 위하여 GPU를 활용한 셰이더 인스턴싱 기법을 적용한다.

A formal representation of data exchange for slope stability analysis of smart road design and construction

  • Dai, Ke;Huang, Wuhao;Wen, Ya;Xie, Yuru;Kim, Jung In
    • 국제학술발표논문집
    • /
    • The 9th International Conference on Construction Engineering and Project Management
    • /
    • pp.1130-1137
    • /
    • 2022
  • The Industry Foundation Classes (IFC) provides standardized product models for the building construction domain. However, the current IFC schema has limited representation for infrastructure. Several studies have examined the data schema for road and highway modeling, but not in a sufficiently comprehensive and robust manner to facilitate the overall integrated project delivery of road projects. Several discussions have focused on slope engineering for road projects, but no solution has been provided regarding the formalized parametric modeling up to now. Iterative design, analysis, and modification are observed during the process of slope design for road projects. The practitioners need to carry out the stability analysis to consider different road design alternatives, including horizontal, vertical, and cross-section designs. The procedure is neither formalized nor automated. Thus, there is a need to develop the formal representation of the product and process of slope analysis for road design. The objective of this research is to develop a formal representation (i.e., an IFC extension data schema) for slope analysis. It consists of comprehensive information required for slope analysis in a structured manner. The deliverable of this study contributes to both the formal representation of infrastructure development and, further, the automated process of slope design for road projects.

  • PDF

A Genetic Algorithm Approach to the Fire Sequencing Problem

  • Kwon, O-Jeong
    • 한국국방경영분석학회지
    • /
    • 제29권2호
    • /
    • pp.61-80
    • /
    • 2003
  • A fire sequencing problem is considered. Fire sequencing problem is a kind of scheduling problem that seeks to minimize the overall time span under a result of weapon­target allocation problem. The assigned weapons should impact a target simultaneously and a weapon cannot transfer the firing against another target before all planned rounds are consumed. The computational complexity of the fire sequencing problem is strongly NP­complete even if the number of weapons is two, so it is difficult to get the optimal solution in a reasonable time by the mathematical programming approach. Therefore, a genetic algorithm is adopted as a solution method, in which the representation of the solution, crossover and mutation strategies are applied on a specific condition. Computational results using randomly generated data are presented. We compared the solutions given by CPLEX and the genetic algorithm. Above $7(weapon){\times}15(target)$ size problems, CPLEX could not solve the problem even if we take enough time to solve the problem since the required memory size increases dramatically as the number of nodes expands. On the other hand, genetic algorithm approach solves all experimental problems very quickly and gives good solution quality.

PARTIALLY ABELIAN REPRESENTATIONS OF KNOT GROUPS

  • Cho, Yunhi;Yoon, Seokbeom
    • 대한수학회보
    • /
    • 제55권1호
    • /
    • pp.239-250
    • /
    • 2018
  • A knot complement admits a pseudo-hyperbolic structure by solving Thurston's gluing equations for an octahedral decomposition. It is known that a solution to these equations can be described in terms of region variables, also called w-variables. In this paper, we consider the case when pinched octahedra appear as a boundary parabolic solution in this decomposition. The w-solution with pinched octahedra induces a solution for a new knot obtained by changing the crossing or inserting a tangle at the pinched place. We discuss this phenomenon with corresponding holonomy representations and give some examples including ones obtained from connected sum.

All kinds of singularity avoidance in redundant manipulators for autonomous manipulation

  • Kim, Jin-Hyun;Marani, Giacomo;Chung, Wan-Kyun;Yuh, Jun-Ku
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.1587-1592
    • /
    • 2003
  • There are three kinds of singularity in controlling redundant manipulators. Kinematic, algorithmic and representation singularities are those. If manipulators fall into any singularity without proper action to avoid it, the control system must go away from our desire, and we can meet a dangerous situation. Hence, we have to deal the singularities very carefully. In this paper, we describe an on-line solution for avoiding the occurrence of both algorithmic and kinematic singularities in task-priority based kinematic controllers of robotic manipulators. Representation singularity can be easily avoided by using proper representation algorithm, so, in this paper, we only consider kinematic and algorithmic singularities. The proposed approach uses a desired task reconstruction and a successive task projection in order to maintain the measure for singularity over a user defined minimum value. It shows a gain in performance and a better task error especially when working in proximity of singular configurations. It is particularly suitable for autonomous systems where an off-line trajectory control scheme is often not applicable. The advantage and performance of the proposed controller is verified by simulation works. And, the experiment with real manipulator is remaining for the future works.

  • PDF

BIM을 위한 도면 표현 사례에 관한 연구 (A Research on Drawing Representation for BIM(Building Information Modeling))

  • 채갑수;김언용;전한종;이명식;김길채;최종천;유석준
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2008년도 정기 학술대회
    • /
    • pp.470-475
    • /
    • 2008
  • Building Information Modeling(BIM) is rooted in the economic and functional advantages of maturing from paper-based 2D drawings. The paper-based design and construction drawings are typical production from BIM and using the drawing under BIM environment is needed because there is not an alternative media instead of paper-based drawings. However using the 2D drawing process based on 2D CAD for BIM environment directly has difficulties because there are significant differences in data structure between CAD and BIM. CAD is based on traditional drawings as a whole while BIM is focused on individual objects and providing various levels of information associated with the objects. It can be an obstacle to move from 2D CAD to BIM that we don't have a standard or guideline for BIM. Futhermore, the complexity of drawing in representation would be the obstacle too, so the solution is discussed in the research based on the case of Samoo Architects and Engineers.

  • PDF

유추적 사고에 의한 디자인 문제해결의 유형 - 연상된 단어와 스케치 분석을 중심으로 - (A Study on the Types of Design Problem Solving by Analogical Thinking - Focused on the Analysis of Associated Words and Sketch -)

  • 최은희;최윤아
    • 한국실내디자인학회논문집
    • /
    • 제16권2호
    • /
    • pp.63-70
    • /
    • 2007
  • Analogy in problem solving is similarity-based reasoning facilitated by verbal and visual operation. This similarity-based reasoning generally supports initial phase of idea search. Therefore, this study intends to infer the types of problem solving by tracing the analogy use of verbal and visual representation through a experimental research. According to the result of this research, the types of problem solving by analogy are classified into 'evolving', 'divergent', and 'poor conversion' type. Firstly, 'evolving type' is distinguished between 'combination type' associated different contents to develope a new design and 'transformation type' associated similar words and sketches to be continuously revised and developed. In these types usually structural analogy rather than surface analogy is used. Secondly, in 'divergent type' associated words or sketches are individually represented, and among them one design solution is selected. In this type usually surface analogy is used. Thirdly, in 'poor conversion type' interaction between verbal representation and visual representation does not go on smoothly, and the generation of idea is poor. In here surface analogy is mostly used. These findings could form the basis of skill development of idea generation and conversion in design education.

한국어 단모음의 지각적 모음공간과 심적 표상 (Perceptual Vowel Space and Mental Representation of Korean Monophthongs)

  • 최양규
    • 음성과학
    • /
    • 제10권2호
    • /
    • pp.287-301
    • /
    • 2003
  • The purpose of this study was to examine whether the same vowel sounds are perceived differently by the two local dialect speakers, Seoul dialect speakers (SDS) and Kyungnam dialect speakers (KDS), whose vowel systems differ each other. In the first experiment SDS and KDS heard vowels synthesized in vowel space with F1 by F2 and categorized them into one of 10 Korean monophthongs. The results showed that SDS and KDS perceived the synthesized vowels differently. For example, /$\varepsilon$ versus /e/ contrast, ${\o}$/, and /y/ are differentiated by SDS, whereas they are perceptually confused by KDS. We also observed that /i/ could not be perceived unless the vowel synthesis included F3 or higher formants. In the second experiment SDS and KDS performed the similarity rating task of 10 synthesized Korean monophthongs. Two-dimensional MDS solution based on the similarity rating scores was obtained for each dialect group. The first dimension can be named 'vowel advancement' and the second 'vowel height'. The comparison of the two MDS solutions showed that the overall psychological distances among the vowels are shorter in KDS than SDS and that especially the distance between /$\Lambda$/ and /i/ is shorter in KDS than SDS. The result suggested that perception or mental representation of vowels depends on the vowel system of the listener's dialect or language. Further research problems were discussed in the final section.

  • PDF

컴퓨터기반 협력학습에서 공유지식 형성을 위한 표상도구설계 (The design of representation tool for constructing shared knowledge in CSCL)

  • 신윤희;김동식
    • 컴퓨터교육학회논문지
    • /
    • 제19권2호
    • /
    • pp.73-85
    • /
    • 2016
  • 컴퓨터기반 협력학습도구를 사용하여 한 공간에서 다양한 관점을 가진 사람들이 토의하고자 할 때, 작성된 글이 과제내용 중 어느 부분에 해당하는 것인지를 파악하는 것이 어렵고 서로의 지식과 의견을 공유하는데 어려움이 따른다. 본 연구에서는 컴퓨터 기반 협력학습에서 공유지식 형성을 방해하는 요인을 문헌연구를 통해 분석하고 도출된 원리를 기반으로 협력표상도구를 설계하였다. 설계된 도구는 평가 준거에 따른 체크리스트와 F.G.I를 통해 교수자, 설계자, 학습자의 다양한 의견을 수렴함으로써 반복 조정되었다. 최종 조정된 도구는 복합 과제를 해결해야하는 컴퓨터 기반 협력학습상황에서 학습자 간 지식 및 의견을 공유하는 데 방해요소를 최소화하여 협의를 촉진하고 고차원의 해결책을 도출하는 데 기여할 것이라 기대한다.