• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.25-32
• /
• 1998

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.522-527
• /
• 2004

Resealed Simulated Annealing (RSA) has been devised for improving the disadvantage of Simulated Annealing (SA) which require tremendous amount of computation time. RSA and SA have been for optimization of satellite structures and for comparison of results from two algorithms. As a practical application, a satellite structure is optimized by the two algorithms. Weights of satellite upper platform and propulsion module are minimized. MSC/NASTRAN is used for the static and dynamic analysis. The optimization results of the RSA are compared with results of the classical SA. The numbers of optimization iterations could be effectively reduced by the RSA.

• Steel and Composite Structures
• /
• v.8 no.6
• /
• pp.475-490
• /
• 2008

A hybrid tabu-simulated annealing algorithm is proposed for the optimum design of steel frames. The special character of the hybrid algorithm is that it exploits both tabu search and simulated annealing algorithms simultaneously to obtain near optimum. The objective of optimum design problem is to minimize the weight of steel frames under the actual design constraints of AISC-LRFD specification. The performance and reliability of the hybrid algorithm were compared with other algorithms such as tabu search, simulated annealing and genetic algorithm using benchmark examples. The comparisons showed that the hybrid algorithm results in lighter structures for the presented examples.

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

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.4
• /
• pp.371-378
• /
• 1999

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.1-26
• /
• 1994

Simulated annealing is an attractive, but expensive, heuristic method for approximating the solution to combinatorial optimization problems. Attempts to parallel simulated annealing, particularly on distributed memory multicomputers, are hampered by the algorithm's requirement of a globally consistent system state. In a multicomputer, maintaining the global state S involves explicit message traffic and is a critical performance bottleneck. To mitigate this bottleneck, it becomes necessary to amortize the overhead of these state updates over as many parallel state changes as possible. By using this technique, errors in the actual cost C(S) of a particular state S will be introduced into the annealing process. This paper places analytically derived bounds on this error in order to assure convergence to the correct optimal result. The resulting parallel simulated annealing algorithm dynamically changes the frequency of global updates as a function of the annealing control parameter, i.e. temperature. Implementation results on an Intel iPSC/2 are reported.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.1025-1036
• /
• 2003

Variable selection algorithm for principal component analysis using penalty function is proposed. We use the fact that usual principal component problem can be expressed as a maximization problem with appropriate constraints and we will add penalty function to this maximization problem. Simulated annealing algorithm is used in searching for optimal solutions with penalty functions. Comparisons between several well-known penalty functions through simulation reveals that the HARD penalty function should be suggested as the best one in several aspects. Illustrations with real and simulated examples are provided.

• Structural Engineering and Mechanics
• /
• v.25 no.2
• /
• pp.239-268
• /
• 2007

This paper deals with optimal stacking sequence design of laminate composite structures. The stacking sequence optimisation of laminate composites is formulated as a combinatorial problem and is solved using Simulated Annealing (SA), an algorithm devised based on inspiration of physical process of annealing of solids. The combinatorial constraints are handled using a correction strategy. The SA algorithm is strengthened by embedding Tabu search in order to prevent recycling of recently visited solutions and the resulting algorithm is referred to as tabu embedded simulated Annealing (TSA) algorithm. Computational performance of the proposed TSA algorithm is enhanced through cache-fetch implementation. Numerical experiments have been conducted by considering rectangular composite panels and composite cylindrical shell with different ply numbers and orientations. Numerical studies indicate that the TSA algorithm is quite effective in providing practical designs for lay-up sequence optimisation of laminate composites. The effect of various neighbourhood search algorithms on the convergence characteristics of TSA algorithm is investigated. The sensitiveness of the proposed optimisation algorithm for various parameter settings in simulated annealing is explored through parametric studies. Later, the TSA algorithm is employed for multi-criteria optimisation of hybrid composite cylinders for simultaneously optimising cost as well as weight with constraint on buckling load. The two objectives are initially considered individually and later collectively to solve as a multi-criteria optimisation problem. Finally, the computational efficiency of the TSA based stacking sequence optimisation algorithm has been compared with the genetic algorithm and found to be superior in performance.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.5
• /
• pp.42-49
• /
• 2007

This paper introduces a study on reliability-driven device placement using simulated annealing algorithm which can be applicable to MCM or electronic systems embedded in a spacecraft running at thermal conduction environment. Reliability of the unit's has been predicted with the devices' junction temperatures calculated from FDM solver and optimized by simulated annealing algorithm. Simulated annealing in this paper adopts swapping devices method as a perturbation. This paper describes and compares the optimization simulation results with respect to two objective functions: minimization of failure rate and minimization of average junction temperature. Annealing temperature variation simulation case and equilibrium coefficient variation simulation case are also presented at the two respective objective functions. This paper proposes a new approach for reliability optimization of MCM and electronic systems considering those simulation results.

• Journal of the Korea Society for Simulation
• /
• v.10 no.2
• /
• pp.1-14
• /
• 2001

The layout design of component plays an important role in the design and usability of many engineering products. The Engineering artifacts of today are becoming increasingly complicated. The simulated annealing method has been applied effectively to the layout and packing problems of wafer. The main characteristics of simulated annealing method is that an optimum can be obtained from the many local optimums by controlling the temperature and introducing the statistic flickering. The objective of this study is to suggest a method to apply the simulated annealing method to the three dimensional layout design of submergible boat which has multiple constraint conditions and evaluation criteria. We describe an approach to define cost function, constraints and generate layouts using a computer. In this research three dimensional LAYout Design Optimization Program(LAYDOP ver.2) has been developed. The layout result(the total value of evaluation criteria) designed by a human layout expert has been improved by 31.0% using this program.