• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.1
• /
• pp.28-37
• /
• 2001

This paper presents an efficient algorithm for the loss minimization of distribution system by automatic sectionalizing switch operation in large scale distribution systems. Simulated annealing is particularly well suited for large combinational optimization problem, but the use of this algorithm is also responsible for an excessive computation time requirement. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. The hybrid algorithm of two methods with two tabu lists and the proposed perturbation mechanism is applied to improve the computation time and convergence property Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.2
• /
• pp.120-127
• /
• 2003

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 the 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 or genetic algorithm at the expense of increased computational burden.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.4
• /
• pp.28-36
• /
• 2009

Sequence-Pair(SP) model represents the topological relation between modules. In general, SP model based floorplanners search solutions using Simulated-Annealing(SA) algorithm. Several SA based floorplanning techniques using SP model have been published. To improve the performance of those techniques they tried to improve the speed for evaluation function for SP model, to find better scheduling methods and perturb functions for SA. In this paper we propose a two phase SA based algorithm. In the first phase, white space between modules is reduced by applying compaction technique to the floorplan obtained by an SP. From the compacted floorplan, the corresponding SP is determined. Solution space has been searched by changing the SP in the SA framework. When solutions converge to some threshold value, the first phase of the SA based search stops. Then using the typical SA based algorithm, ie, without using the compaction technique, the second phase of our algorithm continues to find optimal solutions. Experimental results with MCNC benchmark circuits show that how the proposed technique affects to the procedure for SA based floorplainning algorithm and that the results obtained by our technique is better than those obtained by existing SA-based algorithms.

• 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.

• The Korean Journal of Applied Statistics
• /
• v.22 no.3
• /
• pp.627-634
• /
• 2009

Recently, the general contour Monte Carlo has been proposed by Liang (2004) as a space annealing version(ACMC) for optimization problems. The algorithm can be applied successfully to determine the ground configurations for the prediction of protein folding. In this approach, we use the distances between the consecutive $C_{\alpha}$ atoms along the peptide chain and the mapping sequences between the 20-letter amino acids and a coarse-grained three-letter code. The algorithm was tested on the real proteins. The comparison showed that the algorithm made a significant improvement over the simulated annealing(SA) and the Metropolis Monte Carlo method in determining the ground configurations.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.11a
• /
• pp.121-126
• /
• 2003

This paper describes the optimum design for journal bearing by using simulated annealing method. Simulated annealing algorithm is an optimum design method to calculate global and local optimum solution. Dynamic characteristics of a journal bearing are calculated by using finite difference method (FDM), and these values are used for the procedure of journal bearing optimization. The objective is to minimize the resonance response (Q factor) of the simple rotor system. Bearing clearance and length to diameter ratio are used as the design variables.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.319-322
• /
• 1995

As a trend toward multi-product batch processes is increasing in Chemical Process Industry (CPI), multi-product batch scheduling has been actively studied. But the optimal production scheduling problems for multi-product batch processes are known as NP-complete. Recently Ku and Karimi [5] have studied Simulated Annealing(SA) and Jung et al.[6] have developed Modified Simulated Annealing (MSA) method which was composed of two stage search algorithms for scheduling of batch processes with UIS and NIS. Jung et al.[9] also have studied the Common Intermediate Storage(CIS) policy which have accepted as a high efficient intermediate storage policy. It can be also applied to pipeless mobile intermediate storage pacilities. In spite of these above researches, there have been no contribution of scheduling of CIS policy for chemical batch processes. In this paper, we have developed another MSA for scheduling chemical batch processes with searching the suitable control parameters for CIS policy and have tested the this algorithm with randomly generated various scheduling problems. From these tests, MSA is outperformed to general SA for CIS batch process system.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.149-155
• /
• 1996

In this paper, we designed binary phase grating with SA (simulated annealing) algorithm for image generation, and used LCTV(liquid crystal television) as phase modulator. We generated optical image using LCTV which controlled by personal computer in real time. Many parameters in SA algorithm are determined by average deviation of the cost function, not experimental method. It was confirmed that the LCTV could be used as a phase modulator through mach-zehnder interferometering experiment. The various optical images are generated in real itme by fourier transforming of the phase gratings on LCTV which is controlled by personal computer and they can be used for optical interconnection in a neural network and addressing information in a volume hologram etc.

• Journal of Korean Society for Quality Management
• /
• v.24 no.4
• /
• pp.59-69
• /
• 1996

The criteria for construction of D-optimal design in nonlinear models are derived. The procedures for finding these optimal designs using the simulated annealing algorithm are presented. It is claimed that the advantages of this method are its ability to make the given data useful by adding new observations as well as to obtain a new set of appropriate data when the model and parameters are known. Research so far indicates that there has never been a case in which there is more than one independent variable but this method can be used for such cases. The result indicates the effectiveness of the method using simulated annealing algorithm for situations in which there are many independent variables and the ranges of design spaces are wide.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.226-234
• /
• 2004

A rapid Prototyping system that laser-cuts and laminates thick layers can fabricate 3D objects promptly with a variety of materials. Building such a system must consider the surface distortions due to both vertical-cut layers and triangular surfaces. We developed a tangential layer-cutting algorithm by rearranging tangential lines such that they reconstruct 3D surfaces more closely and also constitute smoother laser trajectories. An energy function that reflects the surface-closeness with the tangential lines was formulated and then the energy was minimized by a gradient descent method. Since this simple method tends to cause many local minima for complex 3D objects, we tried to solve this problem by adding a simulated annealing process to the proposed method. To view and manipulate 3D objects, we also implemented a 3D visual environment. Under this environment, experiments on various 3D objects showed that our algorithm effectively approximates 3D surfaces and makes laser-trajectory feasibly smooth.