• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1436-1441
• /
• 2003

Recently, simulated annealing algorithms have widely been applied to many structural optimization problems. In this paper, simulated annealing, boltzmann annealing, fast annealing and adaptive simulated annealing are applied to optimization of truss structures for improvement quality of objective function and number of function evaluation. These algorithms are classified by cooling schedule. The authors have changed parameters of ASA's cooling schedule and the influence of cooling schedule parameters on structural optimization obtained is discussed. In addition, cooling schedule of BA and ASA mixed is applied to 10 bar-truss structure.

• International Journal of CAD/CAM
• /
• 제12권1호
• /
• pp.9-19
• /
• 2012

Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.

• 한국통신학회논문지
• /
• 제27권3A호
• /
• pp.284-289
• /
• 2002

본 논문에서는 MRF(Markov Random field)를 이용해 영상을 분할할 때, 에너지 최적화를 위해 사용되는 simulated annealing의 수렴속도를 개선하는 방법을 제안하였다. Simulated annealing은 잡음이 포함된 영상이나, 텍스쳐 영상에서 좋은 분할 결과를 나타내지만, 수렴속도가 길다는 단점이 있다. 본 논문에서는 수렴속도를 개선하기 위해 픽셀 레이블의 초기값을 픽셀의 intensity에 따라 adaptive하게 부여하여 simulated annealing을 수행하였다. 이 방법으로 모의실험을 수행한 결과, 기존의 방법보다 수렴 속도를 크게 향상시킬 수 있었다.

• 제어로봇시스템학회논문지
• /
• 제7권10호
• /
• pp.819-826
• /
• 2001

Genetic algorithms are becoming more popular because of their relative simplicity and robustness. Genetic algorithms are global search techniques for nonlinear optimization. However, traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on any particular domain because they are poor at hill-climbing, whereas simulated annealing has the ability of probabilistic hill-climbing. Therefore, hybridizing a genetic algorithm with other algorithms can produce better performance than using the genetic algorithm or other algorithms independently. In this paper, we propose an efficient hybrid optimization algorithm named the adaptive random signal-based learning. Random signal-based learning is similar to the reinforcement learning of neural networks. This paper describes the application of genetic algorithms and simulated annealing to a random signal-based learning in order to generate the parameters and reinforcement signal of the random signal-based learning, respectively. The validity of the proposed algorithm is confirmed by applying it to two different examples.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2006년도 추계학술발표대회
• /
• pp.69-72
• /
• 2006

최근 생명 정보학 기술의 발달로 마이크로 단위의 실험조작이 가능해짐에 따라 하나의 chip상에서 전체 genome의 expression pattern을 관찰할 수 있게 되었고, 동시에 수 만개의 유전자들 간의 상호작용도 연구가능하게 되었다. 이처럼 DNA 마이크로어레이 기술은 복잡한 생물체를 이해하는 새로운 방향을 제시해주게 되었다. 따라서 이러한 기술을 통해 얻어진 대량의 유전자 정보들을 효과적으로 분석하는 방법이 시급하다. 본 논문에서는 마이크로어레이 실험에서 다양한 원인에 의해 발생하는 잡음(noise)을 줄이거나 제거하는 과정인 정규화과정을 거쳐 특징 추출방법인 SVM(Support Vector Machine) 방법을 이용하여 데이터를 2개의 클래스로 나누고, 표준화 방법들의 성능 비교를 위해 Adaptive Simulated Annealing 알고리즘으로 정확도를 평가하는 분류 시스템을 설계 구현하였다.

• 한국항공우주학회지
• /
• 제32권6호
• /
• pp.49-55
• /
• 2004

컴퓨터 성능의 향상으로 통계학적 최적화기법이 구조설계최적화에 시도되고 있다. 통계학적 최적화 가법 중 시뮬레이티드 애닐링 기법도 구조 최적화 분야에 적용되기 시작하였다. 시뮬레이티드 애닐링, 불쯔만 애닐링, 패스트 애닐링, 어댑티브 시뮬레이티드 애닐링을 적용하여, 트러스 구조물의 최적화에 적용시켜 목적함수를 향상시키고 함수계산량을 감소시키도록 하였다. 특히 알고리즘 중에서 수렴성과 목적함수의 우수성을 구현하기 위하여 어댑티브 시뮬레이티드 애닐링의 냉각스케줄의 냉각변수를 다양하게 적용하여 트러스 구조물을 최적화하였다. 또한 볼쯔만 애닐링과 어댑티브 시뮬레이티드 애닐링을 복합한 냉각스캐줄로 10부재와 25부재 트러스 구조물의 최적화도 수행하여 보았다.

• 동력기계공학회지
• /
• 제2권3호
• /
• pp.60-67
• /
• 1998

Edge detection is the first step and very important step in image analysis. We cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for comparing the performances of different detectors. This cost function is made of desirable characteristics of edges such as thickness, continuity, length, region dissimilarity. And we use a simulated annealing algorithm for minimum of cost function. Simulated annealing are a class of adaptive search techniques that have been intensively studied in recent years. We present five strategies for generating candidate states. Experimental results(building image and test image) which verify the usefulness of our simulated annealing approach to edge detection are better than other operator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5243-5263
• /
• 2017

Data center networks provide critical bandwidth for the continuous growth of cloud computing, multimedia storage, data analysis and other businesses. The problem of low link bandwidth utilization in data center network is gradually addressed in more hot fields. However, the current scheduling strategies applied in data center network do not adapt to the real-time dynamic change of the traffic in the network. Thus, they fail to distribute resources due to the lack of intelligent management. In this paper, we present an improved adaptive traffic scheduling strategy utilizing the simulated annealing genetic algorithm (SAGA). Inspired by the idea of software defined network, when a flow arrives, our strategy changes the bandwidth demand dynamically to filter out the flow. Then, SAGA distributes the path for the flow by considering the scheduling of the different pods as well as the same pod. It is implemented through software defined network technology. Simulation results show that the bisection bandwidth of our strategy is higher than state-of-the-art mechanisms.

• Coupled systems mechanics
• /
• 제11권4호
• /
• pp.285-295
• /
• 2022

Laminated composite plates are utilized extensively in different fields of construction and industry thanks to their advantages such as high stiffness-to-weight ratio. Additionally, they are characterized by their directional properties that permit the designer to optimize their stiffness for specific applications. This paper presents a numerical analysis and optimization study of plates made of composite subjected to low velocity impact. The main aim is to identify the optimum fiber orientations of the composite plates that resist low velocity impact load. First, a three-dimensional finite element model is built using LS DYNA computer software package to perform the impact analyses. The composite plate has been modeled using solid elements. The failure criteria of Tsai-Wu's criterion have been used to control the strength of the composite material. A good agreement has been found between the predicted numerical results and experimental results in the literature which validate the finite element model. Then, an Adaptive Simulated Annealing (ASA) has been used to optimize the response of impacted composite laminate where its objective is to maximize the safety factor by varying the ply angles. The results show that the ASA is robust in the sense that it is capable of predicting the best optimal designs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권4호
• /
• pp.843-859
• /
• 2024

The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.