• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1996.10a
• /
• pp.301-306
• /
• 1996

A torsional damper is generally used to reduce the torsional vibration which occurs at a crankshaft of a multi-cylinder high speed diesel engine. Vibration amplitude should be estimate by the appropriate simulation model to determine the optimum specifications of damper. In this paper a new method which was based on the random tabu search method(RTSM) would be introduced for the viscous damper design to optimize the damping performance. The result was ascertained by comparing with conventional rubber damper.

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

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.11
• /
• pp.528-536
• /
• 2001

This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.97-102
• /
• 2004

AGV flowpath layout design is one of the most important steps for efficient AGV systems design. Since it was formulated by Gaskins & Tanchoco (1987), a unidirectional AGV flowpath layout design problem has been tackled by many researchers. However, the solution methods were traded off between the solution quality and the computational time. In this paper, a tabu search technique is applied to obtain a good solution for a relatively large problem in reasonable computational time. Specifically, fast construction algorithm for feasible initial solutions, long-term memory structure and neighbor solutions generation are adapted to the problem characteristics and embedded in the tabu search algorithm. Also, sets of computational experiments show that the proposed tabu search algorithm outperforms to the Ko and Egbelu's algorithm (2003).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.135-138
• /
• 1996

In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1422-1424
• /
• 1999

This Paper Presents a efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in distribution systems of radial type. To apply tabu search to reconfiguration of distribution system, in this Paper we Propose the several move methods and efficient reconfiguration procedure. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. The experimental results show that the proposed tabu search techniques have the ability to search a good solution.

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.797-802
• /
• 2000

Flow shop scheduling problem involves processing several jobs on common facilities where a setup time Is incurred whenever there is a switch of jobs. Practical aspect of scheduling focuses on finding a near-optimum solution within a feasible time rather than striving for a global optimum. In this paper, a hybrid meta-heuristic method called tabu-genetic algorithm(TGA) is suggested, which combines the genetic algorithm(GA) with tabu list. The experiment shows that the proposed TGA can reach the optimum solution with higher probability than GA or SA(Simulated Annealing) in less time than TS(Tabu Search). It also shows that consideration of setup time becomes more important as the ratio of setup time to processing time increases.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.129-138
• /
• 2006

Various techniques have been applied to solve the maximal covering problem. Tabu search is also one of them. But, existing researches were lacking of the synthetic analysis and the effort for performance improvement about neighborhood search techniques such as hill-climbing search and simulated annealing including tabu search. In this paper, I introduce the way to improve performance of neighborhood search techniques through various experiments and analyses. Basically, all neighborhood search algorithms use the k-exchange neighborhood generation method. And I analyzed how the performance of each algorithm changes according to various parameter settings. Experimental results have shown that simple hill-climbing search and simulated annealing can produce better results than any other techniques. And I confirmed that simple hill-climbing search can produce similar results as simulated annealing unlike general case.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.34-36
• /
• 2000

This paper proposes the design of SVC adaptive fuzzy logic controller(AFLC) using Tabu search and neural network. We tuned the gain of input-output variables of fuzzy logic controller and weights of neural network using Tabu search. Neural network used to tune the output gain of FLC adaptively. We have weights of neural network learned using back propagation algorithm. We performed the nonlinear simulation on an single-machine infinite system to prove the efficiency of the proposed method. The proposed AFLC showed the better performance than PD controller in terms of the settling time and damping effect, for power system operation condition.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.36
• /
• pp.143-152
• /
• 1995

This paper determines the allocation of computers and data files to minimize the sum of processing and communication costs which occur in processing jobs at each node. The problem of optimally configuring a distributed computer system belongs to the class of NP-Complete problems and the object function of this paper is nonlinear function and is hard to solve. This paper seeks the solution of distributed processing system by Tabu Search. Firstly, it presents the method of generating the starting solution proper to the distributed processing system. Secondly, it develops the method of searching neighborhood solutions. Finally, it determines the Tabu restriction appropriate to the distributed processing system. According to the experimental results, this algorithm solves a sized problems in reasonable time and is effective in the convergence of the solution. The algorithm developed in this paper is also applicable to the general allocation problems of the distributed processing system.