• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.3
• /
• pp.139-147
• /
• 2023

The metal bush assembling process is a process of inserting and compressing a metal bush that serves to reduce the occurrence of noise and stable compression in the rotating section. In the metal bush assembly process, the head diameter defect and placement defect of the metal bush occur due to metal bush omission, non-pressing, and poor press-fitting. Among these causes of defects, it is intended to prevent defects due to omission of the metal bush by using signals from sensors attached to the facility. In particular, a metal bush omission is predicted through various data mining techniques using left load cell value, right load cell value, current, and voltage as independent variables. In the case of metal bush omission defect, it is difficult to get defect data, resulting in data imbalance. Data imbalance refers to a case where there is a large difference in the number of data belonging to each class, which can be a problem when performing classification prediction. In order to solve the problem caused by data imbalance, oversampling and composite sampling techniques were applied in this study. In addition, simulated annealing was applied for optimization of parameters related to sampling and hyper-parameters of data mining techniques used for bush omission prediction. In this study, the metal bush omission was predicted using the actual data of M manufacturing company, and the classification performance was examined. All applied techniques showed excellent results, and in particular, the proposed methods, the method of mixing Random Forest and SA, and the method of mixing MLP and SA, showed better results.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.19 no.1 s.71
• /
• pp.27-37
• /
• 2006

A Metropolis genetic algorithm (MGA) is developed and applied for the structural design optimization. In MGA, favorable features of Metropolis criterion of simulated annealing (SA) are incorporated in the reproduction operations of simple genetic algorithm (SGA). This way, the MGA maintains the wide varieties of individuals and preserves the potential genetic information of early generations. Consequently, the proposed MGA alleviates the disadvantages of premature convergence to a local optimum in SGA and time consuming computation for the precise global optimum in SA. Performances and applicability of MGA are compared with those of conventional algorithms such as Holland's SGA, Krishnakumar's micro GA, and Kirkpatrick's SA. Typical numerical examples are used to evaluate the computational performances, the favorable features and applicability of MGA. The effects of population sizes and maximum generations are also evaluated for the performance reliability and robustness of MGA. From the theoretical evaluation and numerical experience, it is concluded that the proposed MGA Is a reliable and efficient tool for structural design optimization.

• Journal of the Korean Magnetic Resonance Society
• /
• v.4 no.2
• /
• pp.74-81
• /
• 2000

Saccharomyces cerevisiae Dna2 protein has biochemical activities: DNA-dependent ATPase, DNA helicase and DNA nuclease and is essential for cell viability. Especially, Pro$\^$504/ is determined as an important residue in ATPase, helicase, and nuclease activity. We synthesized and determined the three-dimensional solution structure of N-terminal domain comprising residues of Val$\^$501/ -_Phe$\^$508/ (Dna2$\^$pep/) using two-dimensional $^1$H-NMR and dynamical simulated annealing calculations. On the basis of a total of 44 experimental restraints including NOEs, $^3$J$\_$$\alpha$$\beta$/ and $^3$J$\_$$\alpha$$\beta$/ coupling constants, the solution structures of Dna2$\^$epe/ were calculated with the program CNS. The 23 lowest energy structures were selected out of 50 final simulated-annealing structures. The atomic RMSDs of the final 23 structures fur the individual residues were calculated with respect to the average structure. The mean RMSDs for the 23 structures were 0.042 nm for backbone atoms and 0.316 nm for all heavy atoms, respectively. The Ramachandran plot indicates that the $\Phi$, Ψ angles of the 23 final structures are properly distributed in energetically acceptable regions. Solution structure of Dna2$\^$pep/ showed a single unique turn spanning residues of Asn$\^$503/ Val$\^$506/.

• Journal of Navigation and Port Research
• /
• v.35 no.8
• /
• pp.657-665
• /
• 2011

This study deals with an integrated problem for deciding sequencing and storage location of export containers together at its receiving operation in the container terminal with a perpendicular layout. The preferred storage location of an export container varies with the priority of the corresponding loading operation and the waiting time of an external truck depends on its storage time. This paper proposes the mixed integer programming model considering the expected arrival time and expected finish time of an external truck and the preferred storage location for its loading operation. And we suggest the heuristic algorithm based on a simulated annealing algorithm for real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost and the performance of the heuristic algorithm is analyzed through a numerical experiment.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.1
• /
• pp.42-48
• /
• 2006

In this study, a repetitive response surface enhancement technique (RRSET) is proposed as a new system approximation method for the efficient multidisciplinary design and optimization (MDO). In order to represent the highly nonlinear behavior of the response with second order polynomials, RRSET introduces a design space transformation using stretching functions and repetitive response surface improvement. The tentative optimal point is repetitively included to the set of experimental points to better approximate the response surface of the system especially near the optimal point, hence a response surface with significantly improved accuracy can be generated with very small experimental points and system iterations. As a system optimizer, the simulated annealing, which generates a global design solution is utilized. The proposed technique is applied to several numerical examples, and demonstrates the validity and efficiency of the method. With its improved approximation accuracy, the RRSET can contribute to resolve large and complex system design problems under MDO environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.251-254
• /
• 2002

In the design of mobile wireless communication system, the location of BTS(Base Transciver Stations), RSC(Base Station Controllers), and MSC(Mobile Switching Center) is one of the most important parameters. Designing wireless communication system, the cost of equipment is need to be made low by combining various, complex parameters. We can solve this problem by combinatorial optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been extensively used for global optimization. This paper shows the four kind of algorithms which are applied to the location optimization of BTS, BSC, and MSC in designing mobile communication system and then we compare with these algorithms. And also we analyze the experimental results and shows the optimization process of these algorithms. As a the channel of a CDMA system is shared among several users, the receivers face the problem of multiple-access interference (MAI). Also, the multipath scenario leads to intersymbol interference (ISI). Both components are undesired, but unlike the additive noise process, which is usually completely unpredictable, their space-time structure helps to estimate and remove them.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.5
• /
• pp.77-87
• /
• 2000

In this paper, we propose a Over-The-Cell channel routing algorithm for the advanced three-layer process. The proposed algorithm makes the channel routing problem to simplified one and makes use of simulated annealing technique to achieve the global optimal solution. And, a new method to remove the cyclic vertical constraints which are known to be the hardest element in the channel routing problem is proposed, and a way to detect the local minimal solution and escape from it successfully is presented. Futhermore, genetic algorithm based channel router is implemented and comparison is performed with the simulated annealing based one. All algorithms are written in C++ and GUI is made using Motif under Linux environment.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.9
• /
• pp.49-57
• /
• 2009

In this paper, we propose a multiple voltage scheduling method which reduces energy consumption considering both timing constraints and resource constraints. In the other multiple voltage scheduling techniques, high voltage is assigned to operations in the longest path and low voltage is assigned to operations that are not on the longest path. However, in those methods, voltages are assigned to specific operations restrictively. We use a simulated annealing technique, in which several voltages are assigned to specific operations flexibly regardless of whether they are on the longest path. In this paper, a post processing algorithm is proposed to further reduce the energy consumption. In some cases, designers may want to reduce the level shifters. To make tradeoff between the total energy and the number (or energy) of level shifters weighted term can be added to the cost function. When the level shifter energy is weighted six times, for example, the number of level shifters is reduced by about 24% and their energy consumption is reduced by about 20%.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.64-70
• /
• 2003

Current growth of VLSI design depends critically on the research and development (If automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms Performing placement and routing impact on Performance and area of VLSI design. Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for the netlist partitioning problem for 4-layer channel routing. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of simulated annealing(SA) algorithm by analyzing the results which are the solution of given problems. Consequently experimental results show that out proposed algorithm reduce area over the SA algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.69-76
• /
• 2022

The traveling salesman problem(TSP) is one of the most famous combinatorial optimization problem. So far, many metaheuristic search algorithms have been proposed to solve the problem, and one of them is local search. One of the very important factors in local search is neighbor generation method, and random-based neighbor generation methods such as inversion have been mainly used. This paper proposes 4 new greedy-based neighbor generation methods. Three of them are based on greedy insertion heuristic which insert selected cities one by one into the current best position. The other one is based on greedy rotation. The proposed methods are applied to first-choice hill-climbing search and simulated annealing which are representative local search algorithms. Through the experiment, we confirmed that the proposed greedy-based methods outperform the existing random-based methods. In addition, we confirmed that some greedy-based methods are superior to the existing local search methods.