• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.3
• /
• pp.44-53
• /
• 2007

Forming central warehouses for a number of stores can save costs in the continuous review inventory model due to economy of scale and information sharing. In this paper, transportation costs are included in this inventory model. Hence, the tradeoff between inventory-related costs and transportation costs is required. The main concern of this paper is to determine the number and location of central warehouses. Transportation costs are dependent on the distance from several central warehouses to each store. Hence, we develop an efficient simulated annealing algorithm using distance-based local search heuristic and merging heuristic to determine the location and the number of central warehouses. The objective of this paper is to minimize total costs such as holding, setup, penalty, and transportation costs. The performance of the proposed approach is tested by using some computational experiments.

• Journal of Information Processing Systems
• /
• v.18 no.4
• /
• pp.562-574
• /
• 2022

As traditional ways of evaluation prove to be ineffective in evaluating the effect of interactive multimedia physical education (PE) teaching, this study develops a new evaluation model based on the simulated annealing algorithm. After the evaluation subjects and the principle of the evaluation system are determined, different subjects are well chosen to constitute the evaluation system and given the weight. The backpropagation neural network has been improved through the simulated annealing algorithm, whose improvement indicates the completion of the evaluation model. Simulation results show that the evaluation model is highly efficient. Compared with traditional evaluation models, the proposed one enhances students' performance in PE classes by 50%.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.25-30
• /
• 2001

This paper proposes an enhanced Simulated Annealing(SA) algorithm for Rural Postman Problems(RPPs). In SA, the cooling schedule is an important factor for SA algorithms. Hence, in this paper a cooling schedule is proposed for SA for RPPs. In the simulation. the results of the SA using the proposed cooling schedule and the results of the SA using the existing cooling schedules are compared and analyzed. In the simulation results, the proposed method obtained the better results than the existing methods.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.2
• /
• pp.13-20
• /
• 2021

Placement is a very important step in the VLSI physical design process. It is the problem of placing circuit modules to optimize the circuit performance and reliability of the circuit. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for circuit placement include the cluster growth, simulated annealing, integer linear programming and genetic algorithm. In this paper we propose a adapted genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of each implementation. As a result, it was found that the adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• International Journal of Reliability and Applications
• /
• v.13 no.2
• /
• pp.91-104
• /
• 2012

Sarhan and Kundu (2009) introduced a new distribution named as the generalized linear failure rate distribution. This distribution generalizes several well known distributions. The probability density function of the generalized linear failure rate distribution can be right skewed or unimodal and its hazard function can be increasing, decreasing or bathtub shaped. This distribution can be used quite effectively to analyze lifetime data in place of linear failure rate, generalized exponential and generalized Rayleigh distributions. In this paper, we apply the simulated annealing algorithm to obtain the maximum likelihood point estimates of the parameters of the generalized linear failure rate distribution. Simulated annealing algorithm can not only find the global optimum; it is also less likely to fail because it is a very robust algorithm. The estimators obtained using simulated annealing algorithm have been compared with the corresponding traditional maximum likelihood estimators for their risks.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.1020-1025
• /
• 2005

The set covering(SC) problem has many practical application of modeling not only real world problems in civilian but also in military. In this paper we study optimal allocation model for maximizing utility of consolidating old fashioned and new air defense weapon system like Patriot missile and develop the new computational algorithm for the SC problem by using simulated annealing(SA) algorithm. This study examines three different methods: 1) simulated annealing(SA); 2) accelerated simulated annealing(ASA); and 3) selection by effectiveness degree(SED) with SA. The SED is adopted as an enhanced SA algorithm that the neighboring solutions could be generated only in possible optimal feasible region at the PERTURB function. Furthermore, we perform various experiments for both a reduced and an extended scale sized situations depending on the number of customers(protective objective), service(air defense), facilities(air defense artillery), threat, candidate locations, and azimuth angles of Patriot missile. Our experiment shows that the SED obtains the best results than others.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.288-289
• /
• 1992

The method of simulated annealing is a technique that has recently attracted significant attention as suitable for optimization problem of very large scale. If the temperature is too high, then some of the structure created by the heuristic will be destroyed and unnecessary extra work will be done. If it is too low then solution is lost, similar to the case of a quenching cooling schedule in the Simulated Annealing (SA) phase. Therefore, a crucial issue in this study is the determination of the starting temperature and cooling schedule for SA phase.

• International Journal of CAD/CAM
• /
• v.12 no.1
• /
• pp.9-19
• /
• 2012

Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.381-386
• /
• 2000

Simple spring-damper-mass models have been widely used to understand whole-body vertical biodynamic response characteristics of the seated vehicle driver. However, most previous models have not considered about the non-rigid masses(wobbling masses). A simple mechanical model of seated human body developed in this study included the torso represented by a rigid and a wobbling mass. Within the 0.5-20Hz frequency range and for excitation amplitudes maintained below $5ms^{-2}$, this 4-degree-of-freedom driver model is proposed to satisfy the measured vertical vibration response characteristics defined from a synthesis of published data for subjects seated erect without backrest support. The parameters are identified by using the combinatorial optimization technique, simulated annealing method. The model response was found to be provided a closer agreement with the response characteristics than previously published models.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.256-256
• /
• 2000

In this parer, we present a real-time path planning algorithm which is integrated the artificial potential field(APF) and simulated annealing(SA) methods for mobile robot. The APF method in path planning has gained popularity since 1990's. It doesn't need the modeling of the complex configuration space of robot, and is easy to apply the path planning with simple computation. However, there is a major problem with APF method. It is the formation of local minima that can trap the robot before reaching its goal. So, to provide local minima recovery, we apply the SA method. The effectiveness of the proposed algorithm is verified through simulation.