• 제목/요약/키워드: topological solution

검색결과 55건 처리시간 0.021초

기하공간정보(OSI)와 병합정보(SN)을 이용한 고유 명칭 방법 (An OSI and SN Based Persistent Naming Approach for Parametric CAD Model Exchange)

  • 한순흥;문두환
    • 한국CDE학회논문집
    • /
    • 제11권1호
    • /
    • pp.27-40
    • /
    • 2006
  • The exchange of parameterized feature-based CAD models is important for product data sharing among different organizations and automation systems. The role of feature-based modeling is to gonerate the shape of product and capture design intends In a CAD system. A feature is generated by referring to topological entities in a solid. Identifying referenced topological entities of a feature is essential for exchanging feature-based CAD models through a neutral format. If the CAD data contains the modification history in addition to the construction history, a matching mechanism is also required to find the same entity in the new model (post-edit model) corresponding to the entity in the old model (preedit model). This problem is known as the persistent naming problem. There are additional problems arising from the exchange of parameterized feature-based CAD models. Authors have analyzed previous studies with regard to persistent naming and characteristics for the exchange of parameterized feature-based CAD models, and propose a solution to the persistent naming problem. This solution is comprised of two parts: (a) naming of topological entities based on the object spore information (OSI) and secondary name (SN); and (b) name matching under the proposed naming.

Evolutionary Approach for Traveling Salesperson Problem with Precedence Constraints

  • 문치웅;윤영수
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2007년도 춘계학술대회 학술발표 논문집 제17권 제1호
    • /
    • pp.305-308
    • /
    • 2007
  • In this paper we suggest an efficient evolutionary approach based on topological sort techniques for precedence constrained TSPs. The determination of optimal sequence has much to offer to downstream project management and opens up new opportunities for supply chains and logistics. Experimental results show that the suggested approach is a good alternative to locate optimal solution for complicated precedence constrained sequencing as in optimization method for instance.

  • PDF

ON A CLASS OF COMPLETE NON-COMPACT GRADIENT YAMABE SOLITONS

  • Wu, Jia-Yong
    • 대한수학회보
    • /
    • 제55권3호
    • /
    • pp.851-863
    • /
    • 2018
  • We derive lower bounds of the scalar curvature on complete non-compact gradient Yamabe solitons under some integral curvature conditions. Based on this, we prove that potential functions of Yamabe solitons have at most quadratic growth for distance function. We also obtain a finite topological type property on complete shrinking gradient Yamabe solitons under suitable scalar curvature assumptions.

평균패킷지연시간과 노드연결성 제약된 네트워크 설계를 위한 Scatter Search 알고리즘 (A Scatter Search Algorithm for Network Design with Mean Packet Delay and Node Connectivity Constraints)

  • 이한진;염창선
    • 산업경영시스템학회지
    • /
    • 제34권1호
    • /
    • pp.33-41
    • /
    • 2011
  • This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

Scatter Search를 이용한 신뢰성 있는 네트워크의 경제적 설계 (Economic Design of Reliable Networks Using Scatter Search)

  • 이한진;염창선
    • 산업경영시스템학회지
    • /
    • 제31권1호
    • /
    • pp.101-107
    • /
    • 2008
  • This paper considers a topological optimization of a computer network design with a reliability constraint. The objective is to find the topological layout of links, at minimal cost, under the constraint that the network reliability is more than a given reliability. To efficiently solve the problem, a scatter search approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic algorithm approach.

비용 제약을 갖는 컴퓨터 네트워크의 최적화 (Optimization of Computer Network with a Cost Constraint)

  • 이한진;염창선
    • 산업경영시스템학회지
    • /
    • 제30권1호
    • /
    • pp.82-88
    • /
    • 2007
  • This paper considers a topological optimization of a computer network design with a cost constraint. The objective is to find the topological layout of links, at maximal reliability, under the constraint that the network cost is less or equal than a given level of budget. This problem is known to be NP-hard. To efficiently solve the problem, a genetic approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a simulated annealing method.

Identification of Topological Entities and Naming Mapping for Parametric CAD Model Exchanges

  • Mun, Duh-Wan;Han, Soon-Hung
    • International Journal of CAD/CAM
    • /
    • 제5권1호
    • /
    • pp.69-81
    • /
    • 2005
  • As collaborative design and configuration design gain increasing importance in product development, it becomes essential to exchange parametric CAD models among participants. Parametric CAD models can be represented and exchanged in the form of a macro file or a part file that contains the modeling history of a product. The modeling history of a parametric CAD model contains feature specifications and each feature has selection information that records the name of the referenced topological entities. Translating this selection information requires solving the problems of how to identify the referenced topological entities of a feature (persistent naming problem) and how to convert the selection information into the format of the receiving CAD system (naming mapping problem). The present paper introduces the problem of exchanging parametric CAD models and proposes a solution to naming mapping.

A topological optimization method for flexible multi-body dynamic system using epsilon algorithm

  • Yang, Zhi-Jun;Chen, Xin;Kelly, Robert
    • Structural Engineering and Mechanics
    • /
    • 제37권5호
    • /
    • pp.475-487
    • /
    • 2011
  • In a flexible multi-body dynamic system the typical topological optimization method for structures cannot be directly applied, as the stiffness varies with position. In this paper, the topological optimization of the flexible multi-body dynamic system is converted into structural optimization using the equivalent static load method. First, the actual boundary conditions of the control system and the approximate stiffness curve of the mechanism are obtained from a flexible multi-body dynamical simulation. Second, the finite element models are built using the absolute nodal coordination for different positions according to the stiffness curve. For efficiency, the static reanalysis method is utilized to solve these finite element equilibrium equations. Specifically, the finite element equilibrium equations of key points in the stiffness curve are fully solved as the initial solution, and the following equilibrium equations are solved using a reanalysis method with an error controlled epsilon algorithm. In order to identify the efficiency of the elements, a non-dimensional measurement is introduced. Finally, an improved evolutional structural optimization (ESO) method is used to solve the optimization problem. The presented method is applied to the optimal design of a die bonder. The numerical results show that the presented method is practical and efficient when optimizing the design of the mechanism.

확장 B-스플라인 기저함수를 이용한 레벨셋 기반의 형상 최적설계 (Level Set based Shape Optimization Using Extended B-spline Bases)

  • 김민근;조선호
    • 한국전산구조공학회논문집
    • /
    • 제21권3호
    • /
    • pp.239-245
    • /
    • 2008
  • 확장 B-스플라인 기저함수(extended B-spline basis functions)을 이용한 레벨셋 기반의 위상 형상 최적설계 기법을 정상 상태의 열전도 문제에 대하여 개발하였다. 본 해석법은 레벨셋으로 결정된 영역 안쪽만 고려하여 해석을 수행하게 되므로 열전달 문제에서 생길 수 있는 영역 바깥부분 영향을 제거할 수 있다. 설계민감도 해석으로부터 결정되는 법선속도를 활용하여 헤밀턴-자코비 방정식의 해를 구하게 되며, 주어진 체적조건 하에서 열 컴플라이언스(thermal compliance)가 최소가 되는 방향으로 최적의 형상을 결정할 수 있다. 형상 설계민감도를 정확하게 얻기 위해서는 레벨셋 함수와 B-스플라인 함수를 이용하여 수직 단위 벡터와 형상의 곡률을 정확히 결정하며, 위상 설계민감도를 통해 최적화과정 동안 필요한 위치와 시점에서 위상의 변화를 주는 홀을 쉽게 생성할 수 있다.