• Steel and Composite Structures
• /
• 제8권6호
• /
• pp.475-490
• /
• 2008

A hybrid tabu-simulated annealing algorithm is proposed for the optimum design of steel frames. The special character of the hybrid algorithm is that it exploits both tabu search and simulated annealing algorithms simultaneously to obtain near optimum. The objective of optimum design problem is to minimize the weight of steel frames under the actual design constraints of AISC-LRFD specification. The performance and reliability of the hybrid algorithm were compared with other algorithms such as tabu search, simulated annealing and genetic algorithm using benchmark examples. The comparisons showed that the hybrid algorithm results in lighter structures for the presented examples.

• 한국지능시스템학회논문지
• /
• 제21권1호
• /
• pp.138-144
• /
• 2011

그래프 G = (V, E )의 L(2, 1)-labeling 은 무선통신에서 무선 기기에 할당되는 주파수를 효율적으로 사용하기 위한 최적화 문제로서 NP-complete 계열에 포함되는 문제이다. 본 연구에서는 L(2, 1)-labeling 문제에 적용 가능한 Simulated Annealing 알고리즘을 제시한 후 다양한 그래프에 제시된 알고리즘을 적용하여 그 효용성을 보이고자 한다.

• Structural Engineering and Mechanics
• /
• 제25권2호
• /
• pp.239-268
• /
• 2007

This paper deals with optimal stacking sequence design of laminate composite structures. The stacking sequence optimisation of laminate composites is formulated as a combinatorial problem and is solved using Simulated Annealing (SA), an algorithm devised based on inspiration of physical process of annealing of solids. The combinatorial constraints are handled using a correction strategy. The SA algorithm is strengthened by embedding Tabu search in order to prevent recycling of recently visited solutions and the resulting algorithm is referred to as tabu embedded simulated Annealing (TSA) algorithm. Computational performance of the proposed TSA algorithm is enhanced through cache-fetch implementation. Numerical experiments have been conducted by considering rectangular composite panels and composite cylindrical shell with different ply numbers and orientations. Numerical studies indicate that the TSA algorithm is quite effective in providing practical designs for lay-up sequence optimisation of laminate composites. The effect of various neighbourhood search algorithms on the convergence characteristics of TSA algorithm is investigated. The sensitiveness of the proposed optimisation algorithm for various parameter settings in simulated annealing is explored through parametric studies. Later, the TSA algorithm is employed for multi-criteria optimisation of hybrid composite cylinders for simultaneously optimising cost as well as weight with constraint on buckling load. The two objectives are initially considered individually and later collectively to solve as a multi-criteria optimisation problem. Finally, the computational efficiency of the TSA based stacking sequence optimisation algorithm has been compared with the genetic algorithm and found to be superior in performance.

• 한국통신학회논문지
• /
• 제28권5C호
• /
• pp.468-475
• /
• 2003

본 논문에서는 패턴생성을 위한 최적의 이진 위상 컴퓨터형성 홀로그램을 설계하기 위해 합성된 SA알고리듬 및 유전 알고리듬을 이용하였다. 제안된 방법의 탐색과정에서 sGA를 사용하여 BPCGH를 생성하고. 결과 홀로그램 패턴을 SA 알고리듬의 초기 랜덤 투과함수로 이용하여 최적의 BPCGH를 설계하였다. 컴퓨터 시뮬레이션에서 독립적으로 사용된 SA 알고리듬과 유전 알고리듬을 비교한 결과 제안한 알고리듬이 회절 효율이 향상된 것을 확인할 수 있었다.

• 디지털산업정보학회논문지
• /
• 제17권2호
• /
• pp.13-20
• /
• 2021

Placement is a very important step in the VLSI physical design process. It is the problem of placing circuit modules to optimize the circuit performance and reliability of the circuit. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for circuit placement include the cluster growth, simulated annealing, integer linear programming and genetic algorithm. In this paper we propose a adapted genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of each implementation. As a result, it was found that the adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권4호
• /
• pp.371-378
• /
• 1999

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

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

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

• 한국산업정보학회논문지
• /
• 제10권4호
• /
• pp.16-25
• /
• 2005

본 논문에서는 최적의 이진 위상 컴퓨터형성홀로그램을 설계하기 위해 SA 및 GA를 합성한 새로운 방법을 제안하였다. 블럭단위 탐색을 하는 GA의 교배연산 및 돌연변이 연산과정 후에 화소단위의 면밀한 탐색을 하는 SA 알고리듬을 삽입하므로써 BPCGH의 성능을 개선시켰다. 컴퓨터 시뮬레이션에서 제안된 합성 반복 알고리듬이 기존의 SA 알고리듬보다 회절효율이 향상됨을 보였다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집A
• /
• pp.939-944
• /
• 2001

Genetic algorithm is modelled on natural evolution and simulated annealing is based on the simulation of thermal annealing. Both genetic algorithm and simulated annealing are stochastic method. So they can find global optimum values. For compare efficiency of SA and GA's, some function value was maximized. In the result, that was a little better than GA's.

• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.25-32
• /
• 1998

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.