• Proceedings of the Safety Management and Science Conference
• /
• 2008.11a
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.1
• /
• pp.9-17
• /
• 2006

This paper deals with a discrete simulation optimization method for designing a complex probabilistic discrete event simulation. The developed algorithm uses the configuration algorithm that can change decision variables and the stopping algorithm that can end simulation in order to satisfy the given objective value during single run. It tries to estimate an auto-regressive model for evaluating correctly the objective function obtained by a small amount of output data. We apply the proposed algorithm to M/M/s model, (s, S) inventory model, and known-function problem. The proposed algorithm can't always guarantee the optimal solution but the method gives an approximate feasible solution in a relatively short time period. We, therefore, show the proposed algorithm can be used as an initial feasible solution of existing optimization methods that need multiple simulation run to search an optimal solution.

• Industrial Engineering and Management Systems
• /
• v.6 no.2
• /
• pp.119-124
• /
• 2007

The most difficult and time-intensive issue in the successful implementation of genetic algorithms is to find good parameter setting, one of the most popular subjects of current research in genetic algorithms. In this study, we present a new efficient experimental design method for parameter optimization in a genetic algorithm for general job shop scheduling problem using the Taguchi method. Four genetic parameters including the population size, the crossover rate, the mutation rate, and the stopping condition are treated as design factors. For the performance characteristic, makespan is adopted. The number of jobs, the number of operations required to be processed in each job, and the number of machines are considered as noise factors in generating various job shop environments. A robust design experiment with inner and outer orthogonal arrays is conducted by computer simulation, and the optimal parameter setting is presented which consists of a combination of the level of each design factor. The validity of the optimal parameter setting is investigated by comparing its SN ratios with those obtained by an experiment with full factorial designs.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.89-102
• /
• 2000

In this paper, we consider an optimal allocation of constant service efforts in queueing network to maximize the system throughput. For this purpose, using the perturbation analysis, we apply a stochastic optimization algorithm to two types of queueing systems. Our simulation results indicate that the estimates obtained from a stochastic optimization algorithm for a two-tandem queuing network are very accurate, and those for closed loop manufacturing system are a little apart from the known optimal allocation. We find that as simulation time increases for obtaining a new gradient (performance measure with respect to decision variables) by perturbation algorithm, the estimates tend to be more stable. Thus, we consider that it would be more desirable to have more accurate sensitivity of performance measure by enlarging simulation time rather than more searching steps with less accurate sensitivity. We realize that more experiments on various types of systems are needed to identify such a relationship with regards to stopping rule, the size of moving step, and updating period for sensitivity.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.11 no.1
• /
• pp.19-25
• /
• 1987

An optimal control procedure is presented for steering of an unmanned cart which has two motored wheels on its left and right side. Steering, running and stopping are enabled by controlling the motor speed independently. An optimal proportional-plus-integral control is employed to eliminate steady state error which is sustained by a simple proportional control for tracking a circular arc path. A simple and readily-implemented suboptimal control is also examined. The suboptimal control gives comparable performance and therefore provides an effective approach for industrial application of the unmanned cart. Effects of design parameters of unmanned cart such as forward velocity, wheel radius and position of sensor are investigated. It is shown that within the practicable values of the parameters the controlled performance improves rapidly with increase of those parameters then the improvement becomes negligible, which suggests base values over which the parameters should be taken.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.61-69
• /
• 2020

Systems such as database and socal network systems have been broadly used, and their unexpected failure, with great losses and sometimes a social confusion, has received attention in recent years. Therefore, it is an important issue to find optimal maintenance plans for such kind of systems from the points of system reliability and maintaining cost. However, it is difficult to maintain a system during its working cycle, since stopping works might incur users some troubles. From the above viewpoint, this paper discusses minimal repair maintenance policy with periodic replacement, while considering the random working cycles. The random working cycle and periodic replacement policies with minimal repair has been discussed in traditional literatures by usually analyzing cases for the nonstopping works. However, maintenance can be more conveniently done at discrete time and even during the working cycle in real applications. So, we propose that periodic replacement is planned at discrete times while considering the random working cycle, and moreover provide a model in which system, with a minimal repair at failures between replacements, is replaced at the minimum of discrete times KT and random cycles Y. The average cost rate model is used to determine the optimal number of periodic replacement.

• Tunnel and Underground Space
• /
• v.24 no.1
• /
• pp.11-20
• /
• 2014

This study analyzed the optimal routes of auxiliary vehicles in an open-pit mine that need to traverse the entire mine through many working points. Unlike previous studies which usually used the Dijkstra's algorithm, this study utilized a heuristic algorithm for the Traveling Salesman Problem(TSP). Thus, the optimal routes of auxiliary vehicles could be determined by considering the visiting order of multiple working points. A case study at the Pasir open-pit coal mine, Indonesia was conducted to analyze the travel route of an auxiliary vehicle that monitors the working condition by traversing the entire mine without stopping. As a result, we could know that the heuristic TSP algorithm is more efficient than intuitive judgment in determining the optimal travel route; 20 minutes can be shortened when the auxiliary vehicle traverses the entire mine through 25 working points according to the route determined by the heuristic TSP algorithm. It is expected that the results of this study can be utilized as a basis to set the direction of future research for the system optimization of auxiliary vehicles in open-pit mines.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.4
• /
• pp.791-812
• /
• 2011

This is a survey on American options. An American option allows its owner the privilege of early exercise, whereas a European option can be exercised only at expiration. Because of this early exercise privilege American option pricing involves an optimal stopping problem; the price of an American option is given as a free boundary value problem associated with a Black-Scholes type partial differential equation. Up until now there is no simple closed-form solution to the problem, but there have been a variety of approaches which contribute to the understanding of the properties of the price and the early exercise boundary. These approaches typically provide numerical or approximate analytic methods to find the price and the boundary. Topics included in this survey are early approaches(trees, finite difference schemes, and quasi-analytic methods), an analytic method of lines and randomization, a homotopy method, analytic approximation of early exercise boundaries, Monte Carlo methods, and relatively recent topics such as model uncertainty, backward stochastic differential equations, and real options. We also provide open problems whose answers are expected to contribute to American option pricing.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.261-264
• /
• 1997

A contactless eddy current type braking system is developed to take advantages of the recent brake system which uses hydraulic force can show high efficiency in a certain velocity region, but not in a high velocity region, and has initial response delay time and pressure build-up time which make stopping distance longer. These are the limits of mechanical brake system of a contact type, which makes a concept brake system required. So, in this paper, the contactless brake system .of a inductive current type is chosen instead of hydraulic brake system. This brake system can be used almost forever for being no wear and contributed to lightening weight of a vehicle. Besides, the contactless brake system can be used as that of electric or solar car with anti-lock brake system. The analysis of induced electromotive force and braking torque obtained with theoretical approximate model, the design of a braking system and a nonlinear controller, and the results of simulation of the ABS, experiment are included.

• 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.