• 한국CDE학회논문집
• /
• 제5권3호
• /
• pp.263-275
• /
• 2000

Multidisciplinary design optimization(MDO) can yield optimal design considering all the disciplinary requirements concurrently. A method to implement the collaborative optimization(CO) approach, one of the MDO methodologies, is developed using a pre-compiler “EzpreCompiler”, a design optimization library “EzOptimizer”, and a common object request broker architecture(CORBA) in distributed computing environment. The CO approach is applied to a mathematical example to show its applicability and equivalence to standard optimization(SO) formulation. In a realistic engineering problem such as optimal design of a two-member hub frame, optimal design of a speed reducer and initial design of a bulk carrier, the CO yields better results than the SO. Furthermore, the CO allows the distributed processing using the CORBA, which leads to reduction of overall computation time.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2001년도 가을 학술발표회 논문집
• /
• pp.201-210
• /
• 2001

In this study, large-scale distributed design approach for a life cycle cost (LCC) optimization of steel box girder bridges was implemented. A collaborative optimization approach is one of the multidisciplinary design optimization approaches and it has been proven to be best suited for distributed design environment. The problem of optimum LCC design of steel box girder bridges is formulated as that of minimization of the expected total LCC that consists of initial cost maintenance cost expected retrofit costs for strength, deflection and crack. To discuss the possibility of the application for the collaborative optimization of steel box girder bridges, the results of this algorithm are compared with those of single level algorithm. From the numerical investigations, the collaborative optimization approach proposed in this study may be expected to be new concepts and design methodologies associated with the LCC approach.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1999년도 가을 학술발표회 논문집
• /
• pp.429-436
• /
• 1999

The best available solution to predict the fatigue life of structural steels is the implementation of EPFM approach based on the principles and techniques of elasto plastic fracture mechanics. To predict the fatigue life, the conventional Paris law has been modified by substituting the range of J-value denoted by ΔJ for ΔK that is calculated by the proposed p-version model. The proposed P-version finite element model is formulated by the incremental theory of Plasticity that consists of the constitutive equation fur elastic-perfectly plastic materials, Tresca/von-Mises yield criteria, and associated flow rule. The experimental fatigue test is conducted with five UP(Center Clucked Panels) specimens to validate the accuracy of the p-version finite element model. Also, the results obtained by LTM approach have been compared with those by EPFM approach.

• 한국CDE학회논문집
• /
• 제6권4호
• /
• pp.254-262
• /
• 2001

It is not possible to exchange parametric information of CAD (Computer Aided Design) models based on the current version of STEP (Standard leer the Exchange of Product model data). The design intent can be lost during the STEP transfer of CAD models. The ISO Parametrics Group has proposed the SMCH (Solid Model Construction History) schema in June 2000 that includes structures fur exchange of parametric information. This paper proposes the macro parametric approach that is intended to provide capabilities to transfer parametric information. In this approach, CAD models are exchanged in the form of macro files. The macro file contains user commands which are used in the modeling phase. To exchange CAD models using the macro parametric approach, modeling commands of commercial CAD systems are analyzed. Those commands are classified by the grouping method suggested by Bill Anderson. As a neutral file format, a standard modeling commands set has been defined. Mapping relations between the standard modeling commands set and the native modeling commands set of commercial CAD systems are defined.

• 한국CDE학회논문집
• /
• 제3권4호
• /
• pp.211-222
• /
• 1998

Parametric design is an important modeling paradigm in CAD/CAM applications, enabling efficient design modifications and variations. One of the major issues in parametric design is to develop a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this appear, we propose a new approach to geometric constraint solving that employs a graph-based method to solve the ruler-and-compass constructible configurations and a numerical method to solve the ruler-and-compass non-constructible configurations, in a way that combines the advantages of both methods. The geometric constraint solving process consists of two phases: 1) planning phase and 2) execution phase. In the planning phase, a sequence of construction steps is generated by clustering the constrained geometric entities and reducing the constraint graph in sequence. in the execution phase, each construction step is evaluated to determine the geometric entities, using both approaches. By combining the advantages of the graph-based constructive approach with the universality of the numerical approach, the proposed approach can maximize the efficiency, robustness, and extensibility of geometric constraint solver.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2010년도 정기 학술대회
• /
• pp.166-169
• /
• 2010

In early design stages structural form finding is of importance. Theses days the structural forms are forced to satisfy not only engineering criteria but also aesthetic concerns including symbolism. Geometric approach seems to provide many possibilities in generating creative forms as design alternatives for bridge structures. However, the increase in possibilities of geometric application didn't gather much attention from bridge designers who are focusing mainly on structural aspects. Prior to adopting the geometric approach, it is needed to review bridge structures in terms of geometric vocabulary. This study has proposed how to generate geometric forms of bridge structures in terms of geometric computing concepts.

• 한국CDE학회논문집
• /
• 제14권4호
• /
• pp.261-270
• /
• 2009

We can save a lot of efforts and time to perform various kinds of multibody system dynamics simulations if the equations of motion of the multibody system can be formulated automatically. In general, the equations of motion are formulated based on Newton's $2^{nd}$law. And they can be transformed into the equations composed of independent variables by using velocity transformation matrix. In this paper the velocity transformation matrix is derived based on a topological modeling approach which considers the topology and the joint property of the multibody system. This approach is, then, used to formulate the equations of motion automatically and to implement a multibody system dynamics simulation program. To verify the the efficiency and convenience of the program, it is applied to the lifting simulation of a floating crane.

• 인터넷정보학회논문지
• /
• 제19권1호
• /
• pp.123-130
• /
• 2018

With the emergence of a new paradigm called Open Science and Big Data, the need for data sharing and collaboration is also emerging in the computational science field. This paper, we analyzed data-driven research cases for computational science by field; material design, bioinformatics, high energy physics. We also studied the characteristics of the computational science data and the data management issues. To manage computational science data effectively it is required to have data quality management, increased data reliability, flexibility to support a variety of data types, and tools for analysis and linkage to the computing infrastructure. In addition, we analyzed trends of platform technology for efficient sharing and management of computational science data. The main contribution of this paper is to review the various computational science data repositories and related platform technologies to analyze the characteristics of computational science data and the problems of data management, and to present design considerations for building a future computational science data platform.

• Journal of Computational Design and Engineering
• /
• 제1권3호
• /
• pp.187-193
• /
• 2014

One of the hottest challenges in automotive industry is related to weight reduction in sheet metal forming processes, in order to produce a high quality metal part with minimal material cost. Stamping is the most widely used sheet metal forming process; but its implementation comes with several fabrication flaws such as springback and failure. A global and simple approach to circumvent these unwanted process drawbacks consists in optimizing the initial blank shape with innovative methods. The aim of this paper is to introduce an efficient methodology to deal with complex, computationally expensive multicriteria optimization problems. Our approach is based on the combination of methods to capture the Pareto Front, approximate criteria (to save computational costs) and global optimizers. To illustrate the efficiency, we consider the stamping of an industrial workpiece as test-case. Our approach is applied to the springback and failure criteria. To optimize these two criteria, a global optimization algorithm was chosen. It is the Simulated Annealing algorithm hybridized with the Simultaneous Perturbation Stochastic Approximation in order to gain in time and in precision. The multicriteria problems amounts to the capture of the Pareto Front associated to the two criteria. Normal Boundary Intersection and Normalized Normal Constraint Method are considered for generating a set of Pareto-optimal solutions with the characteristic of uniform distribution of front points. The computational results are compared to those obtained with the well-known Non-dominated Sorting Genetic Algorithm II. The results show that our proposed approach is efficient to deal with the multicriteria shape optimization of highly non-linear mechanical systems.

• Journal of Computational Design and Engineering
• /
• 제3권4호
• /
• pp.295-311
• /
• 2016

This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem.