• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.8
• /
• pp.1854-1868
• /
• 1995

An effective nesting algorithm has been proposed to allocate the arbitrary shapes on one or several raw sheets by applying the well-known simulated annealing algorithm as the optimization technique. In this approach, both the shapes to be allocated and the raw sheets are represented as the grid-based models. This algorithm can accommodate every possible situations encountered in cutting apparel parts from the raw leather sheets. In other words, the usage of the internal hole of a shape for other small shapes, handling of the irregular boundaries and the interior defects of the raw sheets, and the simultaneous allocation on more than one raw sheets have been tackled on successfully in this study. Several computational experiments are presented to verify the robustness of the proposed algorithm.

• Journal of Information Processing Systems
• /
• v.18 no.5
• /
• pp.665-676
• /
• 2022

In modern logistics, the effective use of the vehicle volume and loading capacity will reduce the logistic cost. Many heuristic algorithms can solve this knapsack problem, but lots of these algorithms have a drawback, that is, they often fall into locally optimal solutions. A fusion optimization method based on simulated annealing algorithm (SA) and binary particle swarm optimization algorithm (BPSO) is proposed in the paper. We establish a logistics knapsack model of the fusion optimization algorithm. Then, a new model of express logistics simulation system is used for comparing three algorithms. The experiment verifies the effectiveness of the algorithm proposed in this paper. The experimental results show that the use of BPSO-SA algorithm can improve the utilization rate and the load rate of logistics distribution vehicles. So, the number of vehicles used for distribution and the average driving distance will be reduced. The purposes of the logistics knapsack problem optimization are achieved.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.57-62
• /
• 2002

The semiconductor industry has continuously been looking for the ways to improve yield and to reduce manufacturing cost. The layout modification approach, one of yield enhancement techniques, is applicable to all design styles, but it does not require any additional resources in terms of silicon area. The layout modification method for yield enhancement consists of making local variations in the layout of some layers in such a way that the critical area, and consequently the sensitivity of the layer to point defects, is reduced. Chen and Koren (1995) proposed a greedy algorithm that removes defect sensitive area using via moving, but it is easy to fall into a local minimum. In this paper, we present a via moving algorithm using simulated annealing and enhance yield by diminishing defect sensitive area. As a result, we could decrease the defect sensitive area effectively compared to the greedy algorithm presented by Chen and Koren. We expect that the proposed algorithm can make significant contributions on company profit through yield enhancement.

• Smart Structures and Systems
• /
• v.13 no.3
• /
• pp.389-406
• /
• 2014

Optimal sensor placement techniques play a significant role in enhancing the quality of modal data during the vibration based health monitoring of civil structures, where many degrees of freedom are available despite a limited number of sensors. The literature has shown a shift in the trends for solving such problems, from expansion or elimination approach to the employment of heuristic algorithms. Although these heuristic algorithms are capable of providing a global optimal solution, their greatest drawback is the requirement of high computational effort. Because a highly efficient optimisation method is crucial for better accuracy and wider use, this paper presents an improved simulated annealing (SA) algorithm to solve the sensor placement problem. The algorithm is developed based on the sensor locations' coordinate system to allow for the searching in additional dimensions and to increase SA's random search performance while minimising the computation efforts. The proposed method is tested on a numerical slab model that consists of two hundred sensor location candidates using three types of objective functions; the determinant of the Fisher information matrix (FIM), modal assurance criterion (MAC), and mean square error (MSE) of mode shapes. Detailed study on the effects of the sensor numbers and cooling factors on the performance of the algorithm are also investigated. The results indicate that the proposed method outperforms conventional SA and Genetic Algorithm (GA) in the search for optimal sensor placement.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.535-538
• /
• 2003

We employ Genetic Programming (GP) which is optimized with Simulated Annealing (SA) to recognize characteristic of a plan. Its result is described in Laplace function. The algorithm proceeds with automatic PID designs for the plant.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.10
• /
• pp.1941-1945
• /
• 2011

In this paper, we propose a real-time classifier to distinguish humans from livestock by using the spatial integral. The image-difference method and the Expectation Maximization are used to reduce noises in input image. A histogram analysis based on Simulated Annealing and the fuzzy-Bayesian algorithm are used to classify human and livestock. Finally, the experiment results show the validity of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.337-354
• /
• 2004

SA, TS, GA and ACS are four of the main algorithms for solving challenging problems of intelligent systems. In this paper we consider Examination Timetabling Problem that is a common problem for all universities and institutions of higher education. There are many methods to solve this problem, In this paper we use Simulated Annealing, Tabu Search, Genetic Algorithm and Ant Colony System in their basic frameworks for solving this problem and compare results of them with each other.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.425-428
• /
• 2000

In this paper, we propose a new method based on SA(simulated annealing) with a fast algorithm for 3D image reconstructrion from the coded apereture images. The reconstructed images can be significantly improved by SA and to large computation cost of SA can be significantly reduced by the fast algorithm.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.940-942
• /
• 2003

In an attempt to enhance the visual effect of SPOT image, this study develops a neural network algorithm to transform SPOT false color into simulated true color. The method has been tested using Landsat TM and SPOT images. The qualitative and quantitative comparisons indicate that the striking similarity can be found between the true and simulated true images in terms of the visual looks and the statistical analysis.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.3
• /
• pp.322-333
• /
• 2012

AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability. For this reason, Radar Resource Management(RRM) becomes new challenging issue. RRM is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed a rule-based scheduling algorithm and Simulated Annealing(SA) based scheduling algorithm, which are alternatively selected and applied to beam scheduler according radar load status in real-time. The performance of the proposed algorithm was evaluated on the multi-function radar scenario. As a result, we showed that our proposed algorithm can process a lot of beams at the right time with real time capability, compared with applying only rule-based scheduling algorithm. Additionally, we showed that the proposed algorithm can save scheduling time remarkably, compared with applying only SA-based scheduling algorithm.