• Journal of Mechanical Science and Technology
• /
• v.20 no.8
• /
• pp.1169-1182
• /
• 2006

Robust design technology has been applied to versatile engineering problems to ensure consistency in product performance. Since 1980s, the concept of robust design has been introduced to numerical optimization field, which is called the robust optimization. The robustness in the robust optimization is determined by a measure of insensitiveness with respect to the variation of a response. However, there are significant difficulties associated with the calculation of variations represented as its mean and variance. To overcome the current limitation, this research presents an implementation of the approximate statistical moment method based on kriging metamodel. Two sampling methods are simultaneously utilized to obtain the sequential surrogate model of a response. The statistics such as mean and variance are obtained based on the reliable kriging model and the second-order statistical approximation method. Then, the simulated annealing algorithm of global optimization methods is adopted to find the global robust optimum. The mathematical problem and the two-bar design problem are investigated to show the validity of the proposed method.

• Nuclear Engineering and Technology
• /
• v.29 no.1
• /
• pp.68-77
• /
• 1997

The reactor power control system is described in the fashion of the order increased LQR system. To obtain the optimal state feedback gain vectors, the weighting matrix of the performance function should be determined. Since the contentional method has some limitations, stochastic searching methods are investigated to optimize the LQR weighting matrix using the modified genetic algorithm combined with the simulated annealing, a new optimizing tool named the hybrid MGA-SA is developed to determine the weighting parameters of the LQR system. This optimizing tool provides a more systematic approach in designing the LQR system. Since it can be easily incorporated with any forms of the cost function, it also provides the great flexibility in the optimization problems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.159-166
• /
• 2006

The aim of synchronization of production and transportation planning in the supply chain is to increase the flexibility and to decrease various costs. The suggested model in this study synchronizes the timing to supply to a downstream manufacturer directly after production and to be consumed in a downstream manufacturer right after receipt. This model deals with the frequent delivery in small amount which is a new trend of the transportation not governed the economy of scale principle. Moreover, various types of transportation governed by the economy of scale principle or not are considered. Then, the two-phase mathematical model is suggested to obtain optimal job sequence and production quantity for each tasks. But, it is difficult to gain optimal solutions if there is a transportation governed by the economy of scale principle in the supply chain, or the size of the problem is increased. Thus, heuristic algorithms based on simulated annealing and genetic algorithm are suggested to find good solutions in the reasonable time.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.10 s.103
• /
• pp.1123-1130
• /
• 2005

We propose an optimal design to improve the capacity by reducing the noise of the intake system. The length and radius of each component of the current Intake system are selected as control factors. We accept the output from computer simulator with orthogonal arrays. Then, the Kriging estimates are computed. From this, we exploit the optimal design of the intake system by adapting simulated annealing. From the results of this optimal design, we conclude that Kriging method with the orthogonal arrays is the efficient method for Design and Analysis of Computer Experiments and we propose the useful results for the low noise intake system.

• Industrial Engineering and Management Systems
• /
• v.8 no.1
• /
• pp.29-36
• /
• 2009

We present two local-search based metaheuristics for the multi-source capacitated facility location problem. In such a problem, each customer's demand can be supplied by one or more facilities. The problem is NP-hard and the number of locations in the optimal solution is unknown. To keep the search process effective, the proposed methods adopt the following features: (1) a multi-exchange neighborhood structure, (2) a tabu list that keeps track of recently visited solutions, and (3) a multi-start to enhance the diversified search paths. The transportation simplex method is applied in an efficient manner to obtain the optimal solutions to neighbors of the current solution under the algorithm framework. Two in-and-out selection rules are also proposed in the algorithms with the purpose of finding promising solutions in a short computational time. Our computational results for some of the benchmark instances, as well as some instances generated using a method in the literature, have demonstrated the effectiveness of this approach.

• Advances in aircraft and spacecraft science
• /
• v.10 no.5
• /
• pp.393-418
• /
• 2023

Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

• IE interfaces
• /
• v.15 no.4
• /
• pp.338-348
• /
• 2002

In this paper, we present a restricted tabu search(RTS) algorithm that schedules jobs on identical parallel machines in order to minimize the maximum lateness of jobs. Jobs have release times and due dates. Also, sequence-dependent setup times exist between jobs. The RTS algorithm consists of two main parts. The first part is the MATCS(Modified Apparent Tardiness Cost with Setups) rule that provides an efficient initial schedule for the RTS. The second part is a search heuristic that employs a restricted neighborhood generation scheme with the elimination of non-efficient job moves in finding the best neighborhood schedule. The search heuristic reduces the tabu search effort greatly while obtaining the final schedules of good quality. The experimental results show that the proposed algorithm gives better solutions quickly than the existing heuristic algorithms such as the RHP(Rolling Horizon Procedure) heuristic, the basic tabu search, and simulated annealing.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1065-1070
• /
• 2003

Facility Layout Planning is concerned with how to arrange facilities necessary for production in a given space. Its objective is often to minimize the total sum of all material flows multiplied by the distance among facilities. FLP belongs to NP complete problem; i.e., the number of possible layout solutions increases with the increase of the number of facilities. Thus, meta heuristics such as Genetic Algorithm (GA) and Simulated Annealing have been investigated to solve the FLP problems. However, one of the biggest problems which lie in the existing meta heuristics including GA is hard to find an appropriate combinations of parameters which result in optimal solutions for the specific problem. The Ant System algorithm with elitist and ranking strategies is used to solve the FLP problem as an another good alternative. Experimental results show that the AS algorithm is able to produce the same level of solution quality with less sensitive parameters selection comparing to the ones obtained by applying other existing meta heuristic algorithms.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.11a
• /
• pp.788-791
• /
• 2003

Optimal loudspeaker positions are important as much as the control algorithms and hardware performance in the active noise control system. This study is similar to the past researches on the optimal transducer locations but with a far field noise source having a plane wave characteristic and the noise coming through an opening such as a window in the enclosure. An optimization technique called simulated annealing algorithm is used to find a set of optimal loudspeaker positions from a larger possible loudspeaker positions. Loudspeakers are placed on the surface of opening at the wail. Using the measured acoustic transfer impedances and numerical simulations with the optimization technique, optimal positions we identified and compared. When a small number of loudspeakers are used, loudspeaker positions on the opening near the center seems to be the best place, but when a larger number of loudspeakers are used it was difficult to find simple patterns Un the optimal positions.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.5
• /
• pp.142-148
• /
• 2008

Facility Layout Planning is concerned with how to arrange facilities necessary for production in a given space. Its objective is often to minimize the total sum of all material flows multiplied by the distance among facilities. FLP belongs to NP complete problem; i.e., the number of possible layout solutions increases with the increase of the number of facilities. Thus, meta heuristics such as Genetic Algorithm (GA) and Simulated Annealing have been investigated to solve the FLP problems. However, one of the biggest problems which lie in the existing meta heuristics including GA is hard to find an appropriate combinations of parameters which result in optimal solutions for the specific problem. The Ant System algorithm with elitist and ranking strategies is used to solve the FLP problem as an another good alternative. Experimental results show that the AS algorithm is able to produce the same level of solution quality with less sensitive parameters selection comparing to the ones obtained by applying other existing meta heuristic algorithms.