• 제목/요약/키워드: search functions

검색결과 799건 처리시간 0.023초

유전자 알고리즘을 이용한 트러스 구조물의 최적설계 (Optimization of Truss Structure by Genetic Algorithms)

  • 백운태;조백희;성활경
    • 한국CDE학회논문집
    • /
    • 제1권3호
    • /
    • pp.234-241
    • /
    • 1996
  • Recently, Genetic Algorithms(GAs), which consist of genetic operators named selection crossover and mutation, are widely adapted into a search procedure for structural optimization. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GAs are very simple in their algorithms and there is no need of continuity of functions(or functionals) any more in GAs. So, they can be easily applicable to wide territory of design optimization problems. Also, virtue to multi-point search procedure, they have higher probability of convergence to global optimum compared with traditional techniques which take one-point search method. The introduction of basic theory on GAs, and the application examples in combination optimization of ten-member truss structure are presented in this paper.

  • PDF

오프라인 검색기능을 가진 주문형 비디오 서비스 시스템 설계 및 구현 (A Design and Implementation of VOD Service System with Off-line Search Function)

  • 이혜정;박두순
    • 한국멀티미디어학회논문지
    • /
    • 제4권3호
    • /
    • pp.205-214
    • /
    • 2001
  • As the real time multimedia data service has become available due to the rapid progress of computer and Internet technology, the users can enjoy the newly developed service, which is called Video On-Dem-and(VOD). However, most of service providers have not paid their attention much on the software for various service modes on VOD, but they are only concentrating un the hardware to provide with the high resolution video display. Therefore, the service providers are recently to pay more attention on the software to cope with the various demands of users than hardware. So this paper has designed and implemented the VOD service system for those demands. Since the VOD service system suggested by this paper enable off-line search functions through E-mail, the users can possibly get the necessary information from off-line Search without connecting to the server while the current VOD service can prominently help users to save the time and effort to sea고 and select the Video contents by using periodical current awareness service supported by PUSH technology and user oriented information booking and feedback service supported by SDI service.

  • PDF

On Modification and Application of the Artificial Bee Colony Algorithm

  • Ye, Zhanxiang;Zhu, Min;Wang, Jin
    • Journal of Information Processing Systems
    • /
    • 제14권2호
    • /
    • pp.448-454
    • /
    • 2018
  • Artificial bee colony (ABC) algorithm has attracted significant interests recently for solving the multivariate optimization problem. However, it still faces insufficiency of slow convergence speed and poor local search ability. Therefore, in this paper, a modified ABC algorithm with bees' number reallocation and new search equation is proposed to tackle this drawback. In particular, to enhance solution accuracy, more bees in the population are assigned to execute local searches around food sources. Moreover, elite vectors are adopted to guide the bees, with which the algorithm could converge to the potential global optimal position rapidly. A series of classical benchmark functions for frequency-modulated sound waves are adopted to validate the performance of the modified ABC algorithm. Experimental results are provided to show the significant performance improvement of our proposed algorithm over the traditional version.

시뮬레이션 최적화 기법과 절삭공정에의 응용 (Simulation Optimization Methods with Application to Machining Process)

  • 양병희
    • 한국시뮬레이션학회논문지
    • /
    • 제3권2호
    • /
    • pp.57-67
    • /
    • 1994
  • For many practical and industrial optimization problems where some or all of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computer simulation is one of the most effective means of studying such complex systems. In this paper, with discussion of simulation optimization techniques, a case study in machining process for application of simulation optimization is presented. Most of optimization techniques can be classified as single-or multiple-response techniques. The optimization of single-response category, these strategies are gradient based search methods, stochastic approximate method, response surface method, and heuristic search methods. In the multiple-response category, there are basically five distinct strategies for treating the responses and finding the optimum solution. These strategies are graphical method, direct search method, constrained optimization, unconstrained optimization, and goal programming methods. The choice of the procedure to employ in simulation optimization depends on the analyst and the problem to be solved.

  • PDF

유전 알고리즘을 이용한 전방향 신경망 제어기의 구조 최적화 (Structure Optimization of a Feedforward Neural Controller using the Genetic Algorithm)

  • 조철현;공성곤
    • 전자공학회논문지B
    • /
    • 제33B권12호
    • /
    • pp.95-105
    • /
    • 1996
  • This paper presents structure optimization of a feedforward neural netowrk controller using the genetic algorithm. It is important to design the neural network with minimum structure for fast response and learning. To minimize the structure of the feedforward neural network, a genralization of multilayer neural netowrks, the genetic algorithm uses binary coding for the structure and floating-point coding for weights. Local search with an on-line learnign algorithm enhances the search performance and reduce the time for global search of the genetic algorithm. The relative fitness defined as the multiplication of the error and node functions prevents from premature convergence. The feedforward neural controller of smaller size outperformed conventional multilayer perceptron network controller.

  • PDF

ALGORITHM FOR WEBER PROBLEM WITH A METRIC BASED ON THE INITIAL FARE

  • Kazakovtsev, Lev A.;Stanimirovic, Predrag S.
    • Journal of applied mathematics & informatics
    • /
    • 제33권1_2호
    • /
    • pp.157-172
    • /
    • 2015
  • We introduce a non-Euclidean metric for transportation systems with a defined minimum transportation cost (initial fare) and investigate the continuous single-facility Weber location problem based on this metric. The proposed algorithm uses the results for solving the Weber problem with Euclidean metric by Weiszfeld procedure as the initial point for a special local search procedure. The results of local search are then checked for optimality by calculating directional derivative of modified objective functions in finite number of directions. If the local search result is not optimal then algorithm solves constrained Weber problems with Euclidean metric to obtain the final result. An illustrative example is presented.

NASTRAN 기반 R-Tabu 탐색법을 이용한 선박구조물의 진동최적설계 (Vibration Optimization Design of Ship Structure Using NASTRAN-based R-Tabu Search Method)

  • 채상일;송진대;김용한;공영모;최수현;양보석
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2003년도 추계학술대회논문집
    • /
    • pp.672-676
    • /
    • 2003
  • Recently, the importance of ship vibration is emerging due to the large scaling, high speed and lightning of ship. For pleasantness in a cabin, shipbuilders ask for strict vibration criteria and the degree of vibration level at a deckhouse became an important condition for taking order from customers. This study conducted optimum design to attenuate vibration level of a deckhouse to solve above problems. New method was implemented, that is NASTRAN external call type independence optimization method. The merit of this method is global searching after setting various object functions and design variables. The global optimization algorithm used here is R-Tabu search method, which has fast converging time and searching various size domains. By modeling similar type to ship structure, validity of the suggested method was investigated.

  • PDF

기울기 기반 빠른 정상점 탐색에 대한 연구 (A Simulation Study on the Fast Gradient-based Peak Searching Method)

  • 안정호
    • 디지털콘텐츠학회 논문지
    • /
    • 제11권1호
    • /
    • pp.39-45
    • /
    • 2010
  • 본 논문에서는 기울기 기반 빠른 정상점 탐색 방법론을 제시하고 시뮬레이션 결과를 제시한다. 제안하는 방법론은 유한 구간에서 단봉 그래프를 가지는 함수의 정상점(최대치)을 최대한 적은 수의 함수값을 참조하여 찾는 문제에 대한 솔루션으로, 대표적인 적용분야로는 자동초점이 있다. 우리는 정상점 탐색을 위해 주기적 탐색, 기울기 기반 탐색, 상세 탐색과 같이 세가지 탐색 전략을 통해 정상점을 찾는다. 노이즈가 첨가된 가우시안 함수를 발생시켜 시뮬레이션 한 결과 대략 8번탐색 횟수와 1.04의 오차를 보임을 알 수 있었다.

The comparative analysis of optimal designed web expanded beams via improved harmony search method

  • Erdal, Ferhat
    • Structural Engineering and Mechanics
    • /
    • 제54권4호
    • /
    • pp.665-691
    • /
    • 2015
  • This study aims at comparing the optimum design of two common types open web expanded beams: with hexagonal openings, also called castellated beams and beams with circular openings referred to as cellular beams. The minimum weights of both beams are taken as the objective functions while the design constraints are respectively implemented from The Steel Construction Institute Publication Numbers 5 and 100. The design methods adopted in these publications are consistent with BS5950 parts. The formulation of the design problem considering the limitations of the above mentioned turns out to be a discrete programming problem. Improved harmony search algorithm is suggested to compare the optimum design of mentioned web-expanded beams to analysis the performance of both beams. The design algorithms based on the technique select the optimum Universal Beam sections, dimensional properties of hexagonal and circular holes and total number of openings along the beam as design variables.

연관 태그의 군집 알고리즘의 설계 및 구현 (A Design and Development of A Related Tag Clustering Algorithm)

  • 박병재;우종우
    • 한국IT서비스학회지
    • /
    • 제7권4호
    • /
    • pp.199-208
    • /
    • 2008
  • Tagging represents one of the Web 2.0 technology, and has an appropriate mechanism for the classification of dynamically changing Web informations. This technique is capable of searching the Web informations using the user specified tags, but still it has a limitation of providing only the limited informations to the tags. Therefore, in order to search the related informations easily, we need to extend this technique further to search not only the desired informations through the designated tags and also the related informations. In this paper, we first have designed and developed an algorithm that can get a desired tag cluster, which is capable of collecting the searched tags along with the related tags. We first performed a test to compare the difference between the user collected tag data through RSS and the reduced data. The second test focused on the accuracy of extracted related tags that depends on the similarity functions, such as the Pearson Correlation and Euclidean. Finally, we showed the final results visually using the graph algorithm.