• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.13 no.8
• /
• pp.619-625
• /
• 2003

A successful design approach for noise barriers should be multidisciplinary because noise reduction goals influence both acoustical and non-acoustical considerations, such as maintenance, safety, physical construction, cost, and visual impact. These various barrier design options are closely related with barrier dimensions. In this study, we have proposed an optimal design method of noise barriers using simulated annealing algorithm, providing a harrier having the smallest dimension and achieving the specified noise reduction at a receiver region exposed to the noise due to Industry and infrastructure, to help a successful barrier design.

• Korean Management Science Review
• /
• v.15 no.2
• /
• pp.153-159
• /
• 1998

Clustering or classification is a very fundamental task that may occur almost everywhere for the purpose of grouping. Optimal clustering is an example of very complicated combinatorial optimization problem and it is hard to develop a generally applicable optimal algorithm. In this paper we propose a general-purpose algorithm for the optimal clustering based on SA(simulated annealing). Among various iterative global optimization techniques imitating natural phenomena that have been proposed and utilized successfully for various combinatorial optimization problem, simulated annealing has its superiority because of its convergence property and simplicity. We first present a version of accelerated simulated annealing(ASA) and then we apply ASA to develop an efficient clustering algorithm. Application examples are also given.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.1020-1025
• /
• 2003

A successful design approach for noise barriers should be multidisciplinary because noise reduction goals influence both acoustical and non-acoustical considerations, such as maintenance, safety, physical construction, cost and visual impact These various barrier design options are closely related with barrier dimensions. In this study, we have proposed an optimal design method of noise barriers using simulated annealing algorithm, providing a barrier having the smallest dimension and achieving the specified noise reduction at a receiver region exposed to the industry and infrastructures, to help a successful barrier design.

• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.69-74
• /
• 2011

The minimum dominating set problem of a graph G is to find a smallest possible dominating set. The minimum dominating set problem is a well-known NP-complete problem such that it cannot be solved in polynomial time. Heuristic or approximation algorithm, however, will perform well in certain area of application. In this paper, we suggest three different simulated annealing algorithms and experimentally show better efficiency improvement by applying these algorithms to the graph instances developed by DIMACS.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.04a
• /
• pp.102-109
• /
• 1999

Two phase simulated annealing algorithm is presented as a structural optimization technique and applied to minimum weight design of space trusses subjected to stress and displacement constraints under multiple loading conditions. Univariate searching algorithm is adopted for automatic selection of initial values of design variables for SA algorithm. The proper values of cooling factors and reasonable stopping criteria for optimum design of space truss structures are proposed to enhance the performance of optimization process. Optimum weights and design solutions are presented for two well-blown example structures and compared with those reported in the literature.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.3 no.2
• /
• pp.147-154
• /
• 1999

A new approach to conducting the vibration parameters identification algorithm is proposed. The approach employs the concept of modal amplitude ratio implemented in a mode shape estimation. The accuracy of the improved Ibrahim Time Domain identification algorithm in extracting structural modal parameters from free response functions has been studied using computer simulated data for 9 stations on the two-span continuous beam. Simulated responses from the lumped and distributed parameter system demonstrate that this algorithm produces excellent results, even in the 300% noise response.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• 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.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.211-216
• /
• 2005

In electrical impedance tomography (EIT), various image reconstruction algorithms have been used in order to compute the internal resistivity distribution of the unknown object with its electric potential data at the boundary. Mathematically, the EIT image reconstruction algorithm is a nonlinear ill-posed inverse problem. This paper presents a simulated annealing technique as a statistical reconstruction algorithm for the solution of the static EIT inverse problem. Computer simulations with 32 channels synthetic data show that the spatial resolution of reconstructed images by the proposed scheme is improved as compared to that of the mNR algorithm at the expense of increased computational burden.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2002.04a
• /
• pp.687-692
• /
• 2002

This paper reviews the existing methods to divide the gear ratios of a multi-stage gear train, and proposes a simulated annealing-based algorithm to find the best gear ratios. The existing methods have their own limitations to be used in practical design, and are also problematic to be automated in a design system. However, the proposed algorithm is a general one which can be applied to gear trains having any number of stages, and offers a satisfactory result in a very short time. It is expected to be useful as a design sub-module of the design system for multi-stage gear drives.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.168-175
• /
• 2003

A new algorithm based on Genetic Algorithms is proposed f3r solving process optimization problems formulated in MINLP, GDP and hybrid MINLP/GDP. This work is focused especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is experimented and many heuristics are adopted. Real and binary coded Genetic Algorithm initiates the global search in the entire search space and at every stage Simulated Annealing makes the candidates to climb up the local hills. Multi-Niche Crowding method is adopted as the multimodal function optimization technique. and the adaptation of probabilistic parameters and dynamic penalty systems are also implemented. New strategies to take the logical variables and constraints into consideration are proposed, as well. Various test problems selected from many fields of process systems engineering are tried and satisfactory results are obtained.