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

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

• Korean Management Science Review
• /
• v.18 no.1
• /
• pp.155-164
• /
• 2001

The widespread diffusion of Internet has enables every college and education institute to develope cyber education systems to meet the multiple needs of students, but it is not true that the effectiveness of cyber education is fruitful in terms of evaluation systems. Most of the early developed web-based evaluation systems for cyber education require that all the students should solve uniformed test set which are included in the predetermined static HTML pages. Therefore, it is impossible to dynamically provide a test set with consistency and reliability. This paper purpose to describe the employment of simulated annealing in cyber testbank system for test set generation that satisfy all constraints. The constraints include number of items for each skill, method, domain, topic, and so on. This research developed two phase heuristic combining sequential test set generation algorithm with simulated annealing. As a result of computer simulations, it was found that the two phase heuristic outperforms the other algorithms.

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

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

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.589-594
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the losed loop problem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and efficiently. This algorithm is a hybrid type of using both declarative description (constraint represention) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

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

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.395-400
• /
• 2002

Epoxy coating and sealing used in nuclear plants for the protection of radiation degrades with aging and hazardous atmosphere. In order to evaluate the degradation of the epoxy, dependence of the acoustic impedance on the change of mechanical properties has been used. Unlike metals, the surface of the epoxy coating on a concrete liner is so wavy that the acoustic impedance is difficult to measure by using the reflectivity of the ultrasound on the interface surface because of the irregular reflection and propagation from the epoxy surface. SA(simulated annealing) algorithm is applied to calculate the acoustic impedance using a reflection wave from the rough epoxy surface. The surface waviness and acoustic impedance are taken into account and determined by SA method to evaluate the state of degradation quantitatively.

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