• The Korean Journal of Applied Statistics
• /
• v.14 no.2
• /
• pp.321-332
• /
• 2001

본 논문에서는 반응변수가 두 가지의 값을 갖는 회귀분석에 적용할 수 있는 사영추적회귀를 고려하였다. 회귀모형에 필요한 설명변수들의 선형결합이 하나이고 연결함수의 형태를 사전에 알지 못한다는 가정하에서 모의담금질 기법을 이용하여 모형에 필요한 선형결합을 찾는 알고리즘을 제시하였다. 이진 반응변수의 경우에는 평활모수의 값에 따라 잔차이탈도함수의 반응표면이 단봉의 형태를 갖지 않는 경우가 있어 비동질적 마코프체인을 이용한 모의담금질 기법을 적용하면 효율적으로 선형결합을 탐색할 수 있다.

• The KIPS Transactions:PartB
• /
• v.14B no.7
• /
• pp.541-548
• /
• 2007

Due to the mathematical convergence property, Simulated Annealing (SA) has been one of the most popular optimization algorithms. However, because of its problem of slow convergence in the practical use, many variations of SA like Fast SA (FSA) have been developed for faster convergence. In this paper, we propose and prove that Greedy SA (GSA) also finds the global optimum in probability in the continuous space optimization problems. Because the greedy selection does not allow the cost to become worse, GSA is expected to have faster convergence than the conventional FSA that uses Metropolis selection. In the computer simulation, the proposed method is shown to have as good performance as FSA with Metropolis selection in the viewpoints of the convergence speed and the quality of the found solution. Furthermore, the greedy selection does not concern the cost value itself but uses only dominance of the costs of solutions, which makes GSA invariant to the problem scaling.

• Proceedings of the KSRS Conference
• /
• 2008.03a
• /
• pp.74-79
• /
• 2008

영상 융합은 센서의 자료 저장 능력과 센서에 들어오는 방사에너지 감지의 한계를 해결하고 고해상도의 멀티스펙트럴 영상을 생성할 수 있다는 측면에서 중요한 의의를 지닌다. 특히, 성분대입(component-substitution) 기반의 영상융합 기법은 대용량의 자료를 빠르게 처리할 수 있고, 융합된 영상의 분광왜곡이 적다는 장점을 지니고 있다. 본 연구에서는 최적화기법 중의 하나인 담금질 모사기법(Simulated Annealing, SA)을 이용하여 다양한 성분대입 기반 영상융합 알고리즘들을 분석 및 평가하였다. 담금질 모사기법은 원하는 목적함수가 지역적 최소값이 아닌 광역적 최소값에 수렴이 가능하도록 하는 기법으로 다양한 분야에서의 광역 최적화 기법에 사용된다. 융합 기법의 최적화된 변수를 추출하기 위하여 인위적으로 공간해상도를 낮춘 위성영상을 입력자료로, 원 멀티스펙트럴영상을 참조자료로 사용하였으며, 두 영상간의 분광유사 척도를 담금질 모사 기법의 목적 함수로 구성하였다. 이를 통해 해당 목적함수의 광역적 최소값을 추출하고, 최종적으로 해당 영상에 융합 기법 별 최적화된 변수를 결정하였다. 제안된 최적화 변수의 평가를 위하여 IKONOS 위성영상에 융합을 적용하고, 알고리즘별 분광왜곡량을 비교하였으며 이를 통하여 고해상도 위성영상에 가장 적합한 성분대입 기반 영상융합 기법 및 그에 따른 최적화 변수를 도출할 수 있었다.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.480-488
• /
• 2016

Search-Based Software Testing (SBST) is an effective technique for test data generation on large domain size. Although the performance of SBST seems to be affected by the structural characteristics of Software Under Test (SUT), studies for the comparison of SBST techniques considering structural characteristics are rare. In addition to the comparison study for SBST, we analyzed the best algorithm with different structural characteristics of SUT. For the generalization of experimental results, we automatically generated 19,800 SUTs by combining four metrics, which are expected to affect the performance of SBST. According to the experiment results, Genetic algorithm showed the best performance for SUTs with high complexity and test data evaluation with count ${\leq}20,000$. On the other hand, the genetic simulated annealing and the simulated annealing showed relatively better performance for SUTs with high complexity and test data evaluation with count ${\geq}50,000$. Genetic simulated annealing, simulated annealing and hill climbing showed better performance for SUTs with low complexity.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.377-382
• /
• 2007

This paper proposes a training algorithm for global optimization of the parameters of radial basis function networks. Since conventional training algorithms usually perform only local optimization, the performance of the network is limited and the final network significantly depends on the initial network parameters. The proposed hybrid simulated annealing algorithm performs global optimization of the network parameters by combining global search capability of simulated annealing and local optimization capability of gradient-based algorithms. Via experiments for function approximation problems, we demonstrate that the proposed algorithm can find networks showing better training and test performance and reduce effects of the initial network parameters on the final results.

• Journal of the Korea Society for Simulation
• /
• v.32 no.1
• /
• pp.23-34
• /
• 2023

The purpose of this paper is to review global stochastic optimization algorithms(GSOA) in case binary response experimentation is used and to compare the performances of them. GSOAs utilise estimator of probability of success $\^p$ instead of population probability of success p, since p is unknown and only known by its estimator which has stochastic characteristics. Hill climbing algorithm algorithm, simple random search, random search with random restart, random optimization, simulated annealing and particle swarm algorithm as a population based algorithm are considered as global stochastic optimization algorithms. For the purpose of comparing the algorithms, two types of test functions(one is simple uni-modal the other is complex multi-modal) are proposed and Monte Carlo simulation study is done to measure the performances of the algorithms. All algorithms show similar performances for simple test function. Less greedy algorithms such as Random optimization with Random Restart and Simulated Annealing, Particle Swarm Optimization(PSO) based on population show much better performances for complex multi-modal function.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.648-653
• /
• 2010

The non-metric multidimensional scaling (nMDS) is a method for analyzing the relation among objects by mapping them onto the Euclidean space. The nMDS is useful when it is difficult to use the concept of distance between pairs of objects due to non-metric dissimilarities between objects. The nMDS can be regarded as an optimization problem in which there are many local optima. Since the conventional nMDS algorithm utilizes the steepest descent method, it has a drawback in that the method can hardly find a better solution once it falls into a local optimum. To remedy this problem, in this paper, we applied the simulated annealing to the nMDS and proposed a new optimization algorithm which could search for a global optimum more effectively. We examined the algorithm using benchmarking problems and found that improvement rate of the proposed algorithm against the conventional algorithm ranged from 0.7% to 3.2%. In addition, the statistical hypothesis test also showed that the proposed algorithm outperformed the conventional one.

• The KIPS Transactions:PartB
• /
• v.14B no.7
• /
• pp.523-530
• /
• 2007

This paper proposes a new stochastic optimization algorithm for hidden Markov models (HMMs) used as a recognizer of automatic lipreading. The proposed method combines a global stochastic optimization method, the simulated annealing technique, and the local optimization method, which produces fast convergence and good solution quality. We mathematically show that the proposed algorithm converges to the global optimum. Experimental results show that training HMMs by the method yields better lipreading performance compared to the conventional training methods based on local optimization.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.53-60
• /
• 2008

This paper proposes a new multiobjective optimization method for discriminative training of hidden Markov models (HMMs) used as the recognizer for automatic lipreading. While the conventional Baum-Welch algorithm for training HMMs aims at maximizing the probability of the data of a class from the corresponding HMM, we define a new training criterion composed of two minimization objectives and develop a global optimization method of the criterion based on simulated annealing. The result of a speaker-dependent recognition experiment shows that the proposed method improves performance by the relative error reduction rate of about 8% in comparison to the Baum-Welch algorithm.

• Journal of Hydrogen and New Energy
• /
• v.32 no.4
• /
• pp.212-218
• /
• 2021

In this study, we conducted a design optimization of the Type 4 composite pressure vessels to enhance the pressure-resistant performance of the vessels while keeping the thickness of the composite layer. The design variables for the optimization were the stacking angles of the helical layers of the vessels to improve the performance. Since the carbon fibers are expensive material, it is desirable to reduce the use of the carbon fibers by applying an optimal design of the composite pressure vessel. The structural analysis and optimization process for the design of Type 4 composite pressure vessels were carried out using a commercial finite element analysis software, Abaqus and a plug-in for automated simulation, Isight, respectively. The optimization results confirmed the performance and safety of the optimized Type 4 composite pressure vessels was enhanced by 12.84% compared to the initial design.