• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1992년도 봄 학술발표회 논문집
• /
• pp.79-84
• /
• 1992

An integrated design system has as its aim the incoporation of all the design processes, such as, planning, preliminary design, analysis, detailed design (mamber design), evaluation, and drafting into an unified software system. Successful implementation such a system could lead to major improvements in efficiency by eliminating duplication of data and efforts. reducing errors, saving design time, providing management support, and so on. This study presents a methodology for an computer-integrated design system for building structures, synthesizing algorithmic procedures and knowledge based expert systems on the network database. Network database, which was designed to store all information systematically during the design processes, provides centeral communication area between algorithms and expert systems. The conventional procedural codes automate the routine design phases such as structural analysis, whereas knowledge-based expert systems support designer's decisions at the creative design phases such as preliminary design etc. The user interface with interactive and batch modes controls the design phases and manages design information and activates the algorithms and the expert systems. The concept presented in this paper will contribute to the formulation of automated design systems for building structures.

• 한국자동차공학회논문집
• /
• 제14권2호
• /
• pp.1-8
• /
• 2006

In this paper, an optimum design technology is developed to find an optimal position of the shock absorber using ADAMS and VisualDOC. A vehicle with a torsion-beam rear suspension is modeled by using ADAMS. Design variables for the optimal positioning of the shock absorber are defined considering the hard points of the chassis structure and design positioning are specified through the sensitivity analysis using a bump-crossing simulation. The objective function is defined as the joint reaction forces of the shock absorber connecting joints of the chassis structure. Sequential Quadratic Programming and Genetic Algorithms are used for this study. To validate the optimized design variables, pothole simulations are performed. GA showed better results than SQP algorithms for this design purpose.

• Journal of Computational Design and Engineering
• /
• 제3권1호
• /
• pp.24-36
• /
• 2016

During the past decade, solving complex optimization problems with metaheuristic algorithms has received considerable attention among practitioners and researchers. Hence, many metaheuristic algorithms have been developed over the last years. Many of these algorithms are inspired by various phenomena of nature. In this paper, a new population based algorithm, the Lion Optimization Algorithm (LOA), is introduced. Special lifestyle of lions and their cooperation characteristics has been the basic motivation for development of this optimization algorithm. Some benchmark problems are selected from the literature, and the solution of the proposed algorithm has been compared with those of some well-known and newest meta-heuristics for these problems. The obtained results confirm the high performance of the proposed algorithm in comparison to the other algorithms used in this paper.

• 대한산업공학회지
• /
• 제31권1호
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.607-612
• /
• 1998

In this paper, a controller using fuzzy-genetic algorithms is proposed for pat-tracking of WMR. A fuzzy controller is implemented so as to adjust appropriate crossover rate and mutation rate. A genetic algorithms is also implemented to have adaptive adjustment of control gain during optimizing process. To check effectiveness of this algorithms, computer simulation is applied.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.501-507
• /
• 1997

Composite material has very excellent mechanical properties including tensile stress and specific strength. Especially impact loads may be expected in many of the engineering applications of it. The suitability of composite material for such applications is determined not only by the usual paramenters, but its impactor energy-absorbing properties. Composite material under impact load has poor mechanical behavior and so needs tailoring its structure. Genetic algorithms(GA) is probabilistic optimization technique by principle of natural genetics and natural selection and neural networks(NN) is useful for prediction operation on the basis of learned data. Therefore, This study presents optimization techniques on the basis of genetic algorithms and neural networks to minimum stiffness design of laminated composite material.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• International Journal of Computer Science & Network Security
• /
• 제23권7호
• /
• pp.109-118
• /
• 2023

Energy awareness is an essential design flaw in wireless sensor network. Clustering is the most highly regarded energy-efficient technique that offers various benefits such as energy efficiency and network lifetime. Clusters create hierarchical WSNs that introduce the efficient use of limited sensor node resources and thus enhance the life of the network. The goal of this paper is to provide an analysis of the various energy efficient clustering algorithms. Analysis is based on the energy efficiency and network lifetime. This review paper provides an analysis of different energy-efficient clustering algorithms for WSNs.

• Journal of applied mathematics & informatics
• /
• 제5권1호
• /
• pp.141-152
• /
• 1998

Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.

• 한국음향학회지
• /
• 제18권1호
• /
• pp.67-71
• /
• 1999

본 논문에서는 회로의 테스트 시간과 비용을 절감할 수 있는 BIST(Built-In Self Test)기법을 이용하여 메모리 테스트 알고리즘을 칩내에서 수행하는 회로를 설계하였다. 메모리 테스트에 사용되는 MSCAN, Marching, Checkerboard알고리즘을 수행하는 회로를 구현하기 위해 BIST회로에서 요구되는 구조를 파악하고 VHDL을 이용하여 각 블록별로 기술하였다. 그리고 CAD tool을 이용하여 각 블록에 대한 동작을 검증하고 회로합성기로써 각 알고리즘에 대한 BIST 회로를 추출하였다. 추출된 회로는 전체 메모리에 대해 무시할 정도의 오버헤드를 갖는다.