• 제목/요약/키워드: Random search method

검색결과 221건 처리시간 0.027초

유전알고리즘과 Random Tabu 탐색법을 조합한 최적화 알고리즘에 의한 배관지지대의 최적배치 (Optimum Allocation of Pipe Support Using Combined Optimization Algorithm by Genetic Algorithm and Random Tabu Search Method)

  • 양보석;최병근;전상범;김동조
    • 한국지능시스템학회논문지
    • /
    • 제8권3호
    • /
    • pp.71-79
    • /
    • 1998
  • 본 논문은 유전알고리즘과 random tabu 탐색법을 조합한 새로운 최적화 알고리즘을 제안한다. 유전알고리즘과 전역적인 최적해에 대한 탐색능력이 우수하고, random tabu 탐색법은 최적해에의 수렴속도가 매우 빠른 알고리즘이다. 본 논문에서는 이 두 알고리즘의 장점을 이용해서 수렴정도와 수렴속도가 더욱 향상된 최적알고리즘을 제안하여 알고리즘의 수렴성능을 조사하고, 실제 최적화문제로서 지진응답을 최소로 하기위한 배관지지대의 최적배치문제에 적용하여 기존의 방법과 비교를 통하여 유용성을 검토하였다.

  • PDF

Nonlinear control system using universal learning network with random search method of variable search length

  • Shao, Ning;Hirasawa, Kotaro;Ohbayashi, Masanao;Togo, Kazuyuki
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
    • /
    • pp.235-238
    • /
    • 1996
  • In this paper, a new optimization method which is a kind of random searching is presented. The proposed method is called RasVal which is an abbreviation of Random Search Method with Variable Seaxch Length and it can search for a global minimum based on the probability density functions of searching, which can be modified using informations on success or failure of the past searching in order to execute intensified and diversified searching. By applying the proposed method to a nonlinear crane control system which can be controlled by the Universal Learning Network with radial basis function(R.B.P.), it has been proved that RasVal is superior in performance to the commonly used back propagation learning algorithm.

  • PDF

유전알고리즘과 Tabu탐색법에 의한 제진판의 최적설계 (Ooptimum Design Damping Plate by Combined Method of Genetic Algorithm and Random Tabu Search Method)

  • 양보석;전상범;유영훈;최병근
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1997년도 추계학술대회논문집; 한국과학기술회관; 6 Nov. 1997
    • /
    • pp.184-189
    • /
    • 1997
  • This paper introduces a new combined method by genetic algorithm and random tabu search method as optimization algorithm. Genetic algorithm can search the global optimum and tabu search method is very fast in speed. The optimizing ability of new combined method is identified by comparing other optimizing algorithm and used for optimum design of damping plate.

  • PDF

Development of Pareto strategy multi-objective function method for the optimum design of ship structures

  • Na, Seung-Soo;Karr, Dale G.
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제8권6호
    • /
    • pp.602-614
    • /
    • 2016
  • It is necessary to develop an efficient optimization technique to perform optimum designs which have given design spaces, discrete design values and several design goals. As optimization techniques, direct search method and stochastic search method are widely used in designing of ship structures. The merit of the direct search method is to search the optimum points rapidly by considering the search direction, step size and convergence limit. And the merit of the stochastic search method is to obtain the global optimum points well by spreading points randomly entire the design spaces. In this paper, Pareto Strategy (PS) multi-objective function method is developed by considering the search direction based on Pareto optimal points, the step size, the convergence limit and the random number generation. The success points between just before and current Pareto optimal points are considered. PS method can also apply to the single objective function problems, and can consider the discrete design variables such as plate thickness, longitudinal space, web height and web space. The optimum design results are compared with existing Random Search (RS) multi-objective function method and Evolutionary Strategy (ES) multi-objective function method by performing the optimum designs of double bottom structure and double hull tanker which have discrete design values. Its superiority and effectiveness are shown by comparing the optimum results with those of RS method and ES method.

지각열류량(地殼熱流量)의 선형(線型) 반전(反轉) (Linear Inversion of Heat Flow Data)

  • 한욱
    • 자원환경지질
    • /
    • 제17권3호
    • /
    • pp.163-169
    • /
    • 1984
  • 암석의 대표적 열원치(熱源値)를 사용하여 지각 열류량(熱流量)의 반전(反轉)을 연구하였으며 2-D 모델은 아주 얇은 정방형판(正方形板)이 고려되었다. 포텐샬 이론을 기초로 하여 지각 열류량과 열원 사이의 새로운 관계를 도출하였으며 두가지 경우의 계산결과가 도시되어 있다. Random search 방법과 ridge regression방법이 비교되었으며 지각열류량의 반전(反轉) 연구에서는 random search 방법의 중요성이 발견되었다.

  • PDF

Likelihood search method with variable division search

  • Koga, Masaru;Hirasawa, Kotaro;Murata, Junichi;Ohbayashi, Masanao
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
    • /
    • pp.14-17
    • /
    • 1995
  • Various methods and techniques have been proposed for solving optimization problems; the methods have been applied to various practical problems. However the methods have demerits. The demerits which should be covered are, for example, falling into local minima, or, a slow convergence speed to optimal points. In this paper, Likelihood Search Method (L.S.M.) is proposed for searching for a global optimum systematically and effectively in a single framework, which is not a combination of different methods. The L.S.M. is a sort of a random search method (R.S.M.) and thus can get out of local minima. However exploitation of gradient information makes the L.S.M. superior in convergence speed to the commonly used R.S.M..

  • PDF

Random Tabu 탐색법을 이용한 점성 비틀림 진동감쇠기의 최적설계 (Optimum Design of Viscous Torsional Vibration Damper Using Random Tabu Search Method)

  • 김유신;양보석
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1996년도 추계학술대회논문집; 한국과학기술회관, 8 Nov. 1996
    • /
    • pp.301-306
    • /
    • 1996
  • A torsional damper is generally used to reduce the torsional vibration which occurs at a crankshaft of a multi-cylinder high speed diesel engine. Vibration amplitude should be estimate by the appropriate simulation model to determine the optimum specifications of damper. In this paper a new method which was based on the random tabu search method(RTSM) would be introduced for the viscous damper design to optimize the damping performance. The result was ascertained by comparing with conventional rubber damper.

  • PDF

Pareto 최적점 기반 다목적함수 기법 개발에 관한 연구 (Development of a Multi-objective function Method Based on Pareto Optimal Point)

  • 나승수
    • 대한조선학회논문집
    • /
    • 제42권2호
    • /
    • pp.175-182
    • /
    • 2005
  • It is necessary to develop an efficient optimization technique to optimize the engineering structures which have given design spaces, discrete design values and several design goals. As optimization techniques, direct search method and stochastic search method are widely used in designing of engineering structures. The merit of the direct search method is to search the optimum points rapidly by considering the search direction, step size and convergence limit. And the merit of the stochastic search method is to obtain the global optimum points by spreading point randomly entire the design spaces. In this paper, a Pareto optimal based multi-objective function method (PMOFM) is developed by considering the search direction based on Pareto optimal points, step size, convergence limit and random search generation . The PMOFM can also apply to the single objective function problems, and can consider the discrete design variables such as discrete plate thickness and discrete stiffener spaces. The design results are compared with existing Evolutionary Strategies (ES) method by performing the design of double bottom structures which have discrete plate thickness and discrete stiffener spaces.

향상된 인공생명 최적화 알고리듬의 개발과 소폭 저널 베어링의 최적설계 (Development of an Enhanced Artificial Life Optimization Algorithm and Optimum Design of Short Journal Bearings)

  • 양보석;송진대
    • 한국소음진동공학회논문집
    • /
    • 제12권6호
    • /
    • pp.478-487
    • /
    • 2002
  • This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.

Derivative Evaluation and Conditional Random Selection for Accelerating Genetic Algorithms

  • Jung, Sung-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제5권1호
    • /
    • pp.21-28
    • /
    • 2005
  • This paper proposes a new method for accelerating the search speed of genetic algorithms by taking derivative evaluation and conditional random selection into account in their evolution process. Derivative evaluation makes genetic algorithms focus on the individuals whose fitness is rapidly increased. This accelerates the search speed of genetic algorithms by enhancing exploitation like steepest descent methods but also increases the possibility of a premature convergence that means most individuals after a few generations approach to local optima. On the other hand, derivative evaluation under a premature convergence helps genetic algorithms escape the local optima by enhancing exploration. If GAs fall into a premature convergence, random selection is used in order to help escaping local optimum, but its effects are not large. We experimented our method with one combinatorial problem and five complex function optimization problems. Experimental results showed that our method was superior to the simple genetic algorithm especially when the search space is large.