• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.912-924
• /
• 2003

Design restructuring improves software quality by reorganizing design elements and reduces maintenance cost. Object-oriented metrics can help to detect design flaws and find transformations to reorganize design elements. Basically, the transformations must preserve the behavior of an initial system. This paper describes a metric based restructuring technique preserving the behavior of object-oriented designs, founded on set theory, and gives its validity by applying the technique to applications written in Java. This paper also compares the technique with a technique using simulated annealing algorithm to show its effectiveness.

• Advances in Computational Design
• /
• v.2 no.1
• /
• pp.1-13
• /
• 2017

This paper presents a variant of the Harmony Search Algorithm (HS) and its application to discrete optimization. The main proposed modifications regarding original HS are related to stopping criterion and reinitialization of population, called Harmony Memory. In order to investigate the efficiency of the algorithm, it was applied for obtaining optimal sections of reinforced concrete columns subjected to uniaxial flexural compression. To minimize the cost of the section, the amount and diameters of the reinforcement bars and the dimensions of the columns cross sections were considered as design variables. The obtained results were compared to those generated by other optimization methods. Since, to the examples, Harmony Search reached the same results achieved by Simulated Annealing, some additional analysis are presented in order to compare these methods regarding success rate and number of iterations to reach the optimum.

• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.15-23
• /
• 2011

This research considers scheduling problems with jobs which can be divided into sub-jobs and do not required to be processed immediately following one another. Heuristic algorithms considering how to divide jobs are proposed in an attempt to find near-optimal solutions within reasonable run time. The algorithms contain two phases which are executed recursively. Phase 1 of the algorithm determines how jobs should be divided while phase 2 solves the scheduling problem given the sub-jobs established in phase 1. Simulated annealing and genetic algorithms are applied for the two phases and four heuristic algorithms are established. Numerical experiment is conducted to determine the best parameter values for the heuristic algorithms. Examples with different sizes and levels of complexity are generated. Performance of the proposed algorithms is evaluated. It is shown that the proposed algorithms are able to efficiently and effectively solve the considered problems.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.12
• /
• pp.3236-3245
• /
• 1994

The nesting of two-dimensional patterns onto a given raw sheet has applications in a number industries. It is a common problem often faced by designers in the shipbuilding, garment making, blanking die design, glass and wood industries. This paper presents a multi-stage layout approach for nesting two-dimensional patterns by using artificial intelligence techniques with a relatively short computation time. The raw material with irregular boundaries and internal defects which must be considered in various cases of nesting was also investigated in this study. The proposed nesting approach consists of two stages : initial layout stage and layout improvement stage. The initial layout configuration is achieved by the self-organizing assisted layout(SOAL) algorithm while in the layout improvement stage, the simulated annealing(SA) is adopted for a finer optimization.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.618-629
• /
• 2006

This Paper is about optimizing preventive maintenance period of connected (r,s) out of(m,n) : F lattice system that one of multi-component system, (m,n) matrix failure of whole system is occurrence when parts that belong in (r,s) matrix part procession of parts arranged with procession are breakdown all. The preventive maintenance about system is very important viewing from system reliability and operational expense viewpoint. Preventive maintenance that misses a time calls big loss by system failure and expense of frequent full equipment is paid excessively in preventive maintenance itself but expense is paid much in preventive maintenance itself and whole expense escalation can be achieved preferably. Through this research, reliability model is constructed that do expense by smallest under full equipment policy chosen through comparison of each full equipment policy and preventive maintenance expense full equipment cycle and r ,s value are made using simulated annealing algorithm and simulated annealing algorithm that converge fast in multi-component system certified most suitable to optimization decision

• The KIPS Transactions:PartB
• /
• v.14B no.7
• /
• pp.523-530
• /
• 2007

This paper proposes a new stochastic optimization algorithm for hidden Markov models (HMMs) used as a recognizer of automatic lipreading. The proposed method combines a global stochastic optimization method, the simulated annealing technique, and the local optimization method, which produces fast convergence and good solution quality. We mathematically show that the proposed algorithm converges to the global optimum. Experimental results show that training HMMs by the method yields better lipreading performance compared to the conventional training methods based on local optimization.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.470-475
• /
• 1999

Recently as the application of gear drive increases in high-speed and high-loading, the concern of designing multi-stage gear drive is being risen. Until now however, the research of gear drive is focused on single-stage gear drive and the design depends on experiences and know-how of designer and is carried out by trial and error. This research automated the basic design and the configuration design for two and three-stage gear drives which consist of cylindrical gears. In basic design, design is executed with two design processes, which minimize the overall volume of gear, and whose results are compared each other. In configuration design, the positions of gears are determined to minimize the volume of gearbox using the result of basic design and simulated annealing algorithm.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.529-532
• /
• 1988

This paper proposes a graph matching algorithm based on simulated annealing, which assures the globally optimal solution for circuit partitioning for the placement in the rectilinear region occurring as a result of the pre-placement of some macro cells, or onto the nonplanar surface in some military or space applications. The circuit graph ($G_{C}$) denoting the circuit topology is formed by a hierarchical bottom-up clustering of cells, while another graph called region graph ($G_{R}$) represents the geometry of a planar rectilinear region or a nonplanar surface for circuit placement. Finding the optimal many-to-one vertex mapping function from $G_{C}$ to $G_{R}$, such that the total mismatch cost between two graphs is minimal, is a combinatorial optimization problem which was solved in this work for various examples using simulated annealing.

• Computational Structural Engineering
• /
• v.5 no.2
• /
• pp.93-104
• /
• 1992

The final objective of optimization methods is to find global optimum accurately and efficiently. The optmization processes by simulated annealing and genetic algorithm which have stochastic search process are examined and are applied to several mathematical models and truss, beam structures. Then the robustnesses of these two methods are studied and compared with the results of deterministic optimization methods from the viewpoints of reliability and running time in obtaining the global optimum.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.375-378
• /
• 2000

This paper discusses on application of meta-heuristic algorithms such as the genetic algorithm (GA) and the simulated annealing (SA) to the LSI module placement. We propose useful crossover method for improving of searching capability in genetic algorithm. By using our proposed crossover method, we have been able to keep good schemata in the chromosome and the variety of the solution. From the experimental results, we have obtained better result than the simulated annealing method by starting from the initial placement of the min-cut method.