• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.591-593
• /
• 1998

As evolution of the process technology, we proposed the Over-The-Cell channel routing algorithm for the advanced three-layer process. The proposed algorithm simplifies the channel routing problem, and then makes use of Simulated Annealing Technique to converge at global optimal solution. Also, we proposed a new method to remove the cyclic vertical constraints which are known to be the hardest element in the channel routing problem and a way to detect the local minimal solution and escape from it successfully.

• Journal of the Korean Ceramic Society
• /
• v.27 no.6
• /
• pp.721-728
• /
• 1990

Hydroxyapatite powders were synthesized with Ca/P=1.67 and pH=11 by precipitaton method, after characterization of these specimen, behavior in Ringer's solution and biocompatibility of hydroxyapatite, such as cytotoxity test and implantation test, were investigated. The hydroxyapatite ceramics had structural stability in Ringer's solution, and hydroxyapatite ceramics did not prevent cell growing and exhibit any cytotoxic effects. In implantation of hydroxyapatite ceramics into muscle under abdome of guinea pig, hydroxyapatite ceramics did not show any symptom of rejection for cellular texture.

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

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.251-260
• /
• 1998

This paper deals with a simulated annealing neural network model for determining sequences of models inputted into a mixed model assembly line. We first present a energy function fitting to our problem, next determine the value of the parameters of the energy function using convergence ratio and the number of searched feasible solution. Finally we compare our model NMS with the modified Thomopoulos model. The result of the comparison shows that NMS and Thomopoulos offer a similar output in the problems having good smoothness.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.69-78
• /
• 2004

This paper presents a simulated algorithm(SA) for the optimal reliability design problem of a series system with multiple component choices incorporated at each subsystem. The objective of the problem is to maximize the system reliability while satisfying some constraint on system budget. The problem is formulated as a nonlinear binary integer programming problem and characterized as an NP-hard problem. The SA algorithm is developed by introducing some solution-improvements methods. Numerical examples are tested and the results are compared. The results have demonstrated the efficiency and the effectiveness of the proposed SA algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.33-49
• /
• 1995

Simulated annealing(SA) has been admitted as a general purpose optimization technique which can be utilized for almost all kinds of combinatorial optimization problems without much difficulty. But there are still some weak points to be resolved, one of which is the slow speed of convergence. In this study, we carefully review various previous efforts to improve SA and propose some variations of SA which can enhance the speed of convergence to the optimum solution. Then, we apply the revised SA algorithms to the scheduling and hardware allocation problems occurring in high-level synthesis(HLS) of VLSI design. We confirm the efficiency of the proposed methods through several HLS examples.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.465-468
• /
• 1996

We deal with facility layout problems with shape constraints. A simulated annealing algorithm is developed for the problems. In the algorithm, a solution is encoded as a matrix that has information about relative locations of the facilities in the floor. A block layout is constructed by partitioning the floor into a set of rectangular blocks according to the information while satisfying areas of facilities. In this paper, three methods are suggested for the partitioning procedure and they are employed in the simulated annealing algorithm. Results of computational experiments show that the proposed algorithm performs better than existing algorithms, especially for problems with tight shape constraints.

• IE interfaces
• /
• v.21 no.3
• /
• pp.254-261
• /
• 2008

Connected-(r,s)-out of-(m,n) : F system is an important topic in redundancy design of the complex system reliability and it's maintenance policy. Previous studies applied Monte Carlo simulation and genetic, simulated annealing algorithms to tackle the difficulty of maintenance policy problem. These algorithms suggested most suitable maintenance cycle to optimize maintenance pattern of connected-(r,s)-out of-(m,n) : F system. However, genetic algorithm is required long execution time relatively and simulated annealing has improved computational time but rather poor solutions. In this paper, we propose the ant colony optimization approach for connected-(r,s)-out of-(m,n) : F system that determines maintenance cycle and minimum unit cost. Computational results prove that ant colony optimization algorithm is superior to genetic algorithm, simulated annealing and tabu search in both execution time and quality of solution.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.2
• /
• pp.125-140
• /
• 1996

Simulated annealing (SA) is a very promising general purpose algorithm which can be conveniently utilized for various complicated combinatorial optimization problems. But its slowness has been pointed as a major drawback. In this paper, we propose an accelerated SA and test its performance experimentally by applying it for two standard combinatorial optimization problems (TSP(Travelling Salesman Problem) and GPP(Graph Partitioning Problem) of various sizes. It turns out that performance of the proposed method is consistently better both in convergenge speed and the quality of solution than the conventional SA or SE (Stochastic Evolution). In the second part of the paper we apply the accelerated SA to solve the virtual path management problem encountered in ATM netowrks. The problem is modeled as a combinatorial optimization problem to optimize the utilizy of links and an efficient SA implementation scheme is proposed. Two application examples are given to demonstrate the validity of the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.1085-1087
• /
• 1998

A distribution systems loss minimum reconfiguration method by simulated annealing is proposed. The problem is a complex mixed integer programming problem and is very difficult to solve by a mathematical programming approach. Simulated annealing generates feasible solutions randomly and moves among these solutions using a strategy leading to a global minimum with high probabilities. The solution algorithm has been implemented in developed software package and tested on 32-bus system.