• Title/Summary/Keyword: design and analysis of algorithms

Search Result 621, Processing Time 0.025 seconds

Design Sensitivity Analysis of Welded Strut Joints on Vehicle Chassis Frame (샤시 프레임에 용접한 스트러트 접합부의 설계 민감도 해석)

  • 김동우;양성모;김형우;배대성
    • Journal of Welding and Joining
    • /
    • v.16 no.3
    • /
    • pp.141-147
    • /
    • 1998
  • Design sensitivity analysis of a vehicle system is an essential tool for design optimization and trade-off studies. Most optimization algorithms require the derivatives of cost and constraint function with respect to design in order to calculate the next improved design. This paper presents an efficient algorithm application for the design sensitivity analysis, using the direct differentiation method. A mounting area of suspension that welded on chassis frame is analyzed to show the validity and the efficiency of the proposed method. A mounting area of suspension that welded on chassis frame is analyzed to show the validity and the efficiency of the proposed method.

  • PDF

Adaptive symbiotic organisms search (SOS) algorithm for structural design optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.3
    • /
    • pp.226-249
    • /
    • 2016
  • The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.

AN OPTIMAL PARALLEL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS PROBLEM ON CIRCULAR-ARC GRAPHS

  • SAHA ANITA;PAL MADHUMANGAL;PAL TAPAN K.
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.1-23
    • /
    • 2005
  • The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

Service ORiented Computing EnviRonment (SORCER) for deterministic global and stochastic aircraft design optimization: part 1

  • Raghunath, Chaitra;Watson, Layne T.;Jrad, Mohamed;Kapania, Rakesh K.;Kolonay, Raymond M.
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.3
    • /
    • pp.297-316
    • /
    • 2017
  • With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

Service ORiented Computing EnviRonment (SORCER) for deterministic global and stochastic aircraft design optimization: part 2

  • Raghunath, Chaitra;Watson, Layne T.;Jrad, Mohamed;Kapania, Rakesh K.;Kolonay, Raymond M.
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.3
    • /
    • pp.317-334
    • /
    • 2017
  • With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

Applying Decision Tree Algorithms for Analyzing HS-VOSTS Questionnaire Results

  • Kang, Dae-Ki
    • Journal of Engineering Education Research
    • /
    • v.15 no.4
    • /
    • pp.41-47
    • /
    • 2012
  • Data mining and knowledge discovery techniques have shown to be effective in finding hidden underlying rules inside large database in an automated fashion. On the other hand, analyzing, assessing, and applying students' survey data are very important in science and engineering education because of various reasons such as quality improvement, engineering design process, innovative education, etc. Among those surveys, analyzing the students' views on science-technology-society can be helpful to engineering education. Because, although most researches on the philosophy of science have shown that science is one of the most difficult concepts to define precisely, it is still important to have an eye on science, pseudo-science, and scientific misconducts. In this paper, we report the experimental results of applying decision tree induction algorithms for analyzing the questionnaire results of high school students' views on science-technology-society (HS-VOSTS). Empirical results on various settings of decision tree induction on HS-VOSTS results from one South Korean university students indicate that decision tree induction algorithms can be successfully and effectively applied to automated knowledge discovery from students' survey data.

The analysis of MPPT algorithms (최대전력추종제어기법 비교 분석)

  • Lee, Kyung-Soo;Jung, Young-Seck;So, Jung-Hoon;Yu, Gwon-Jong;Choi, Jae-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2004.04a
    • /
    • pp.212-214
    • /
    • 2004
  • As the maximum power operating point(MPOP) of photovoltaic(PV) power generation systems changes with changing atmospheric conditions such as solar radiation and temperature, an important consideration in the design of efficient PV system is to track the MPOP correctly. Many maximum power point tracking(MPPT) techniques have been considered in the past, however, techniques using microprocessors with appropriate MPPT algorithms are favored because of their flexibility and compatibility with different PV arrays. Although the efficiency of these MPPT algorithms is usually high, it drops noticeably in case of rapidly changing atmospheric conditions. This paper analysed and researched the characteristics of three MPPT algorithms; P&O, Inc&Cond, ImP&O and simulated them with irradiance changing.

  • PDF

A Study on the Structural Integrity of Lifting Lug without Appendage (부가물이 미부착된 리프팅 러그의 구조 건전성에 관한 연구)

  • Choi, Kyung-Shin;Kim, Ji-Jun;Choi, JeongJu
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.20 no.11
    • /
    • pp.108-114
    • /
    • 2021
  • In this study, a multivariate function was applied to the genetic algorithm for D-type lugs currently used in shipyards to closely analyze the behavioral form of weight loss without double plates. An optimal lifting lug structure design without attachments is proposed. MATLAB R2016a was used to design features by applying multivariate functions to genetic algorithms. Furthermore, the design was achieved by deriving the optimal shapes of lugs using genetic algorithms. The shapes of the designed lugs were validated for structural bonding using the structural analysis program ANSYS 2020 R2, and a robust design of lugs with no appendages was developed.

Systematization Design of a Differential Transformer by Analogical Analysis (유추해석에 의한 차동변압기의 계열화 설계)

  • Jo, Gyeong-Jae;Cha, In-Su;Lee, Gwon-Hyeon
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.49 no.9
    • /
    • pp.578-583
    • /
    • 2000
  • We introduce the systematization design method using analogical analysis. The design method can make us predict the characteristic experiment for the magnitude we desire as the expression equation applied continuously. We can induce the design sample the users demand with the verification of the data on optimum design previously. Therefore in case of designing and developing the products systematization design method is very useful for the standardization of the developed goods compatability the reduction of construction time and price. In this paper we present the analogical algorithms of systematization design using similarity theory design factors and processing method of the restriction factors. Also we analyze the output voltage in terms of input voltage and displacement as choosing a differential transformer as the model.

  • PDF

AN OPTIMAL ALGORITHM FOR FINDING DETH-FIRST SPANNING TREE ON PERMUTATION GRAPHS

  • Mondal, Sukumar;Pal, Madhumangal;Pal, Tapan K.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.3
    • /
    • pp.727-734
    • /
    • 1999
  • Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.