• 제목/요약/키워드: The Simulated Annealing

검색결과 626건 처리시간 0.029초

수정 시뮬레이티드 어닐링에 의한 항공우주 구조물의 최적설계 (Optimization of Aerospace Structures using Reseated Simulated Annealing)

  • 류미란;지상현;임종빈;박정선
    • 한국전산구조공학회논문집
    • /
    • 제18권1호
    • /
    • pp.71-78
    • /
    • 2005
  • 수정 시뮬레이티드어닐링은 Simulated Annealing(SA)가 확률 탐색 방법을 사용하기 때문에 수렴시간이 오래 걸리는 단점를 개선한 방법이다. 따라서 본 논문에서는 RSA와 SA을 트러스구조물과 인공위성구조물의 최적화에 적용하여 서로 비교하여 보았다. 최적화 예제로 10부재 트러스, 실제 응용예제로 인공위성구조물은 위성 상단 플랫폼과 추진모듈의 최적화를 수행하였다. 인공위성구조물의 최적화에서 응력과 고유진동수, 전단응력 등을 제한조건으로 고려하여 최적화를 수행하였다. 인공위성구조물의 최적화를 수행한 결과 RSA을 이용하여 다양한 인공위성 구조물의 최적화에 적용될 수 있음을 확인하였으며, 인공위성 구조물의 최적화에서 RSA가 SA보다 수렴속도가 향상되었음을 확인하였다.

다수요인을 가진 설비배치문제를 위한 모형과 simulated annealing 알고리즘 (A Model and Simulated Annealing Algorithm for the Multi-factor Plant Layout Problem)

  • 홍관수
    • 한국경영과학회지
    • /
    • 제20권1호
    • /
    • pp.63-81
    • /
    • 1995
  • This paper presents a model and algorithm for solving the multi-factor plant layout problem. The model can incorporate more than two factors that may be either quantitative or qualitative. The algorithm is based on simulated annealing, which has been successfully applied for the solution of combinatorial problems. A set of problems previously used by various authors is solved to demonstrate the effectiveness of the proposed methods. The results indicate that the proposed methods can yield good quality for each of eleven test problems.

  • PDF

The Comparison of Neural Network Learning Paradigms: Backpropagation, Simulated Annealing, Genetic Algorithm, and Tabu Search

  • Chen Ming-Kuen
    • 한국품질경영학회:학술대회논문집
    • /
    • 한국품질경영학회 1998년도 The 12th Asia Quality Management Symposium* Total Quality Management for Restoring Competitiveness
    • /
    • pp.696-704
    • /
    • 1998
  • Artificial neural networks (ANN) have successfully applied into various areas. But, How to effectively established network is the one of the critical problem. This study will focus on this problem and try to extensively study. Firstly, four different learning algorithms ANNs were constructed. The learning algorithms include backpropagation, simulated annealing, genetic algorithm, and tabu search. The experimental results of the above four different learning algorithms were tested by statistical analysis. The training RMS, training time, and testing RMS were used as the comparison criteria.

  • PDF

Optimal estimation of rock joint characteristics using simulated annealing technique - A case study

  • Hong, Chang-Woo;Jeon, Seok-Won
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 한국지구물리탐사학회 2003년도 Proceedings of the international symposium on the fusion technology
    • /
    • pp.78-82
    • /
    • 2003
  • In this paper, simulated annealing technique was used to estimate the rock joint characteristics, RMR(rock mass rating) values, to overcome the defects of ordinary kriging. Ordinary kriging reduced the variance of data, so lost the characteristics of distribution. Simulated annealing technique could reflect the distribution feature and the spatial correlation of the original data. Through the comparisons between three times simulations, the uncertainty of the simulation could be quantified, and sufficient results were obtained.

  • PDF

A Simulated Annealing Method for the Optimization Problem in a Multi-Server and Multi-Class Customer Ssystem

  • Yoo, Seuck-Cheun
    • 한국경영과학회지
    • /
    • 제18권2호
    • /
    • pp.83-103
    • /
    • 1993
  • This paper addresses an optimization problem faced by a multi-server and multi-class customer system in manufacturing facilities and service industries. This paper presents a model of an integrated problem of server allocation and customer type partitioning. We approximate the problem through two types of models to make it tractable. As soution approach, the simulated annealing heuristic is constructed based on the general simulated annealing method. Computational results are presented.

  • PDF

모의 담금질 기법을 이용한 다목적함수 최적화 알고리즘 개발 (Multiobjective Optimization Using Simulated Annealing)

  • 이선영;박철훈
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.651-652
    • /
    • 2008
  • In this paper, we suggest a new multiobjective optimization algorithm which is based on the simulated annealing(SA) method. The proposed algorithm uses population-based simulated annealing and adapts elitism in the process of selection.

  • PDF

혼합형 유전 알고리즘을 이용한 퍼지 안정화 제어기의 계수동조 기법에 관한 연구 (A Study on the Parameters Tuning Method of the Fuzzy Power System Stabilizer Using Genetic Algorithm and Simulated Annealing)

  • 이흥재;임찬호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제49권12호
    • /
    • pp.589-594
    • /
    • 2000
  • The fuzzy controllers have been applied to the power system stabilizer due to its excellent properties on the nonlinear systems. But the design process of fuzzy controller requires empirical and heuristic knowledge of human experts as well as many trial-and-errors in general. This process is time consuming task. This paper presents an parameters tuning method of the fuzzy power system stabilizer using the genetic algorithm and simulated annealing(SA). The proposed method searches the local minimum point using the simulated annealing algorithm. The proposed method is applied to the one-machine infinite-bus of a power system. Through the comparative simulation with conventional stabilizer and fuzzy stabilizer tuned by genetic algorithm under various operating conditions and system parameters, the robustness of fuzzy stabilizer tuned by proposed method with respect to the nonlinear power system is verified.

  • PDF

다수제품의 수익성 최대화를 위한 설비입지선정 문제 (The Maximal Profiting Location Problem with Multi-Product)

  • 이상헌;백두현
    • 한국경영과학회지
    • /
    • 제31권4호
    • /
    • pp.139-155
    • /
    • 2006
  • The facility location problem of this paper is distinguished from the maximal covering location problem and the flxed-charge facility location problem. We propose the maximal profiting location problem (MPLP) that is the facility location problem maximizing profit with multi-product. We apply to the simulated annealing algorithm, the stochastic evolution algorithm and the accelerated simulated annealing algorithm to solve this problem. Through a scale-down and extension experiment, the MPLP was validated and all the three algorithm enable the near optimal solution to produce. As the computational complexity is increased, it is shown that the simulated annealing algorithm' is able to find the best solution than the other two algorithms in a relatively short computational time.

Simulated Annealing Algorithm의 변형을 지원하기 위한 객체지향 프레임워크 설계 (Designing an Object-Oriented Framework for the Variants of Simulated Annealing Algorithm)

  • 정영일;유제석;전진;김창욱
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
    • /
    • pp.409-412
    • /
    • 2004
  • Today, meta-heuristic algorithms have been much attention by researcher because they have the power of solving combinational optimization problems efficiently. As the result, many variants of a meta-heuristic algorithm (e.g., simulated annealing) have been proposed for specific application domains. However, there are few efforts to classify them into a unified software framework, which is believed to provide the users with the reusability of the software, thereby significantly reducing the development time of algorithms. In this paper, we present an object-oriented framework to be used as a general tool for efficiently developing variants of simulated annealing algorithm. The interface classes in the framework achieve the modulization of the algorithm, and the users are allowed to specialize some of the classes appropriate for solving their problems. The core of the framework is Algorithm Configuration Pattern (ACP) which facilitates creating user-specific variants flexibly. Finally, we summarize our experiences and discuss future research topics.

  • PDF

Optimal Design of Truss Structures by Resealed Simulated Annealing

  • Park, Jungsun;Miran Ryu
    • Journal of Mechanical Science and Technology
    • /
    • 제18권9호
    • /
    • pp.1512-1518
    • /
    • 2004
  • Rescaled Simulated Annealing (RSA) has been adapted to solve combinatorial optimization problems in which the available computational resources are limited. Simulated Annealing (SA) is one of the most popular combinatorial optimization algorithms because of its convenience of use and because of the good asymptotic results of convergence to optimal solutions. However, SA is too slow to converge in many problems. RSA was introduced by extending the Metropolis procedure in SA. The extension rescales the state's energy candidate for a transition before applying the Metropolis criterion. The rescaling process accelerates convergence to the optimal solutions by reducing transitions from high energy local minima. In this paper, structural optimization examples using RSA are provided. Truss structures of which design variables are discrete or continuous are optimized with stress and displacement constraints. The optimization results by RSA are compared with the results from classical SA. The comparison shows that the numbers of optimization iterations can be effectively reduced using RSA.