• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.24 no.1
• /
• pp.63-68
• /
• 2015

Pattern layout design is very important to the automation of apparel industry. Until now, the genetic algorithm and Tabu search method have been applied to layout design automation. With the genetic algorithm and Tabu search method, the obtained values are not always consistent depending on the initial conditions, number of iterations, and scheduling. In addition, the selection of various parameters for these methods is not easy. This paper presents a hybrid search method that uses a neural network and simulated annealing to solve these problems. The layout of pattern elements was optimized to verify the potential application of the suggested method to apparel pattern layout design.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• pp.327-329
• /
• 2001

This paper presents the application of Parallel genetic algorithm and parallel tabu search to search an optimal solution of a unit commitment problem. The proposed method previously searches the solution globally using the parallel genetic algorithm, and then searches the solution locally using tabu search which has the good local search characteristic to reduce the computation time. This method combines the benefit of both method, and thus improves the performance. To show the usefulness of the proposed method, we simulated for 10 units system. Numerical results show the improvements of cost and computation time compared to previous obtained results.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.05a
• /
• pp.400-403
• /
• 2004

This paper presents an optimum design of journal bearings using a hybrid method to find the solutions of optimization problem. The present hybrid algorithm, namely Enhanced Artificial Life Algorithm(EALA), is a synthesis of an artificial life algorithm(ALA) and the random tabu search(R-tabu) method. EALA is applied to the optimum design of journal bearings supporting simple rotor. The applicability of EALA to optimum design of rotor-bearing system is exemplified through this study.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.382-384
• /
• 2000

산업의 발달에 따라 배전계통의 자동화가 서서히 자리 매김하고 있다. 이에 따라 배전계통에서 발생하는 사고를 계통의 상태와 신뢰도를 동시에 만족시키고, 빠른 시간 내에 복구하는 문제는 매우 중요한 문제로 대두되고 있다. 배전계통 사고복구 문제는 많은 개폐기들의 조합에 의해 구성되어 있고, 계통의 구성상태 와 연계선로의 예비력 등 많은 제약조건들로 인하여 사고복구에 많은 시간이 걸린다. 본 논문에서는 유전 알고리즘과 Tabu Search (TS) 기법을 이용하여 계통의 사고 후 선로손실과 신뢰도손실을 최소로하는 배전계통 사고복구 알고리즘을 제안하고자 한다. 전역 최적해 탐색 및 여러 해의 동시 탐색이 가능한 유전알고리즘과 전역적 탐색은 약하지만 빠른 시간 내의 국부적 탐색(local search)이 우수한 TS를 서로 연계한 알고리즘의 우수성을 계통의 모의실험을 통하여 증명하였다.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.698-702
• /
• 2001

This paper presents a combinatorial method to compute the solutions of optimization problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The hybrid algorithm is not only faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. And the enhanced artificial life algorithm is applied to optimum design of high-speed, short journal bearings and the usefuless is verified through this example.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.198-208
• /
• 2011

At a shipyard, the efficient handling of blocks is one of the most important factors in the shipbuilding process. We consider the problem of deployment planning of blocks from storage yards. As some information of block arrangement should be considered to handle the problem, we adopt the block arrangement based on the coordinates and sizes of each block at a storage yard. Deployment planning for a block involves deciding upon its transportation route from the storage yard and searching for blocks that would obstruct its transportation along this route. A tabu search algorithm for deploying several blocks is developed to minimize the number of obstructive blocks deployed together from the storage yards at a shipyard. The results of computational experiments show that the developed algorithm is very useful in the deployment planning of multiple blocks from the storage yards.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.10
• /
• pp.229-237
• /
• 2010

Recently, forest management objectives become more complex and complicated, and spatial constraints were necessarily considered for ecological stability. Now forest planning is required to provide an optimized solution that is able to achieve a number of management objectives and constraints. In this study, we developed a decision supporting system based on the one of dynamic planning techniques, Tabu Search (TS) heuristic algorithm, which enable one to generate an optimized solution for given objectives and constraints. For this purpose, we analyzed the logical flow of the algorithm and designed the subsequence of processes. To develop a high-performance computing system, we examined a number of strategy to minimize execution time and workloads in each process and to maximize efficiency of using system resources. We examined two model based on the original TS algorithm and revised version of TS algorithm and compared their performance in optimization process. The results showed high performance of the developed system in providing feasible solutions for several management objectives and constraints. Moreover, the revised version of TS algorithm was appeared to be more stable for providing results with minimum variation. The developed system is expected to use for developing forest management plans in Korea.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.5
• /
• pp.499-505
• /
• 2003

In the design of mobile wireless communication system, base station location is one of the most important parameters. Designing base station location, the cost must be minimized by combining various, complex parameters. We can solve this problem by combining optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been used extensively fur global optimization. This paper shows the 4 kinds of algorithm to be applied to the optimization of base station location for communication system and then compares, analyzes the results and shows optimization process of algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.6
• /
• pp.1838-1855
• /
• 2008

The manufacturing industry seeks for improvements in efficiency at the manufacturing process. This paper presents a method for effective real time dispatching for parallel machines with multi product that minimizes mean tardiness and maximizes the quality of the product. What is shown in this paper is that using the Rolling Horizon Tabu search method in the real time dispatching process, mean tardiness can be reduced to the minimum. The effectiveness of the method presented in this paper has been examined in the simulation and compared with other dispatching methods. In fact, using this method manufacturing companies can increase profits and improve customer satisfaction as well.