• 한국정보과학회논문지:소프트웨어및응용
• /
• 제28권7호
• /
• pp.467-477
• /
• 2001

반응적 타부 탐색은 단순한 타부 탐색과 비교해서 중장기 메모리를 이용한 학습을 통하여 타부리스트의 크기를 반응적으로 변화시킴으로써 NP-hard 문제에 속하는 다양한 조합 최적해 문제에 대해서 좋은 해를 효율적으로 찾는다. 본 논문에서는 반응적 타부 탐색에 있어서 중장기 메모리를 이용한 탈출 메커니즘으로 이웃 해 전략 전환 메커니즘이라는 개념을 제시한다. 제시된 이웃 해 전략 전환 메커니즘을 이용한 반응적 타부 탐색을 특정 공과 대학의 강의 시간표 작성 문제와 외판원문제 (traveling salesman problem)에 적용하여 기존의 반응적 타부 탐색과 비교 분석을 하였다. 전산 실험 결과 제시된 알고리즘은 기존의 반응적 타부 탐색 알고리즘에 비교하여 더 좋은 해를 더 짧은 시간에 찾아주었다.

• 전기학회논문지P
• /
• 제50권3호
• /
• pp.138-144
• /
• 2001

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 추계학술발표논문집 (중)
• /
• pp.789-792
• /
• 2003

타부 탐색은 타부 전략 기법과 최급 강하 알고리즘이 결합된 알고리즘이다. 이는 한번 방문한 해는 다시 방문하지 않음으로써 지역 최적해에 수렴하지 않고 새로운 방향으로 움직이게 하여 공간 탐색 능력 효율을 높인다. 그러나 기존의 타부 탐색에서 이웃 해를 생성하는 방법에 따라 성능이 많이 좌우된다. 좋지 않은 이웃 해를 생성하는 탐색에서는 얻고자 하는 최적해에 수렴하는 시간이 많이 걸린다. 따라서 이웃 해를 생성할 때 해밍 거리를 고려하여 균형 있는 이웃 해론 생성하고, 해 공간은 탐색함으로써 우수한 최적해를 얻게 됨을 본 논문에서는 보여주고 있다. 이는 다양성도 보장되므로 최적해에 수렴해 가는 속도 또한 빠른 것을 보여주고 있다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 A
• /
• 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.

• 대한산업공학회지
• /
• 제23권3호
• /
• pp.451-467
• /
• 1997

Tabu search (TS) is a useful strategy that has been successfully applied to a number of complex combinatorial optimization problems. By guiding the search using flexible memory processes and accepting disimproved solutions at some iterations, TS helps alleviate the risk of being trapped at a local optimum. In this article, we propose TS-based heuristics for solving a class of clustering problems, and compare the relative performances of the TS-based heuristic and the simulated annealing (SA) algorithm. Computational experiments show that the TS-based heuristic with a long-term memory offers a higher possibility of finding a better solution, while the TS-based heuristic without a long-term memory performs better than the others in terms of the combined measure of solution quality and computing effort required.

• 한국정밀공학회지
• /
• 제25권9호
• /
• pp.59-70
• /
• 2008

Polynomial is used to optimize crown bowl shape of a marine medium speed diesel engine piston. The primary goal of this paper is that it's for an original design through a thermal stress and highest temperature minimum. Piston is modeled using solid element with 6 design variables defined the positional coordinate value. Global optimum of design variables are found and evaluated as developed and integrated with the optimum algorithm combining genetic algorithm(GA) and tabu search(TS). Iteration for optimization is performed based on the result of finite element analysis. After optimization, thermal stress and highest temperature reduced 0.68% and 1.42% more than initial geometry.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.299-310
• /
• 1998

Actually mixed assembly line is mixed with open and close type workstation. This workstation is called hybridworkstation. The propose of this paper is to determine the sequencing of model that minimize line length for actual(hybridworkstation) mixed model assembly line. we developed three mathematical formulation of the problem to minimize the overall length of a line with hybrid station. Mathematical formulation classified model by operato schedule. Mixed model assembly line is combination program and NP-hard program. Thus computation time is often a critical factor in choosing a method of determining the sequence. This study suggests a tabu search technique which can provide a near optimal solution in real time and use the hill climbing heuristic method for selecting initial solution. Modified tabu search method is compared with MIP(Mixed Integer Program). Numerical results are reported to demonstrate the efficiency of the method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 춘계학술대회 논문집 전력기술부문
• /
• pp.84-88
• /
• 2001

This paper proposes a method of solving a unit commitment problem using parallel tabu search (PTS). The TS is efficient optimization method using meta-heuristic. In this paper, to reduce the computation time for evaluating the neighborhoods, an evaluating method only on changed part and a path relinking method as diversification strategy are proposed. 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 conventional methods. Numerical results show improvements in the generation cost and the computation time compared to previously obtained results.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 추계학술대회논문집A
• /
• 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.

• 산업경영시스템학회지
• /
• 제29권3호
• /
• pp.62-69
• /
• 2006

Vehicle routing problem with time windows is determined each vehicle route in order to minimize the transportation costs. All delivery points in geography have various time restriction in camparision with the basic vehicle routing problem. Vechicle routing problem with time windows is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems.