• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.377-381
• /
• 2003

The design of speed controller for induction motor using tabu search is studied. The proposed sensorless vector control for Induction Motor is composed of two parts. The first part is for optimizing the initial parameters of input-output. The second part is for real time changing parameters of input-output using tabu search. Proposed tabu search is improved by neighbor solution creation using Gaussian random distribution. In order to show the usefulness of the proposed method, we apply the proposed controller to the sensorless speed control of an actual AC induction Motor System. The performance of this approach is verified through simulation.

• Steel and Composite Structures
• /
• 제7권3호
• /
• pp.201-217
• /
• 2007

Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제3권3호
• /
• pp.119-124
• /
• 2014

G = (V, E) 를 그래프라 하자. Maximum Bipartite Subgraph 문제는 주어진 그래프 G로부터 최소 개수의 간선을 제거함으로써 G 를 이분그래프로 변환시키는 문제이며 결합 최적화 문제들 중 대표적인 문제들 중의 하나로 알려 져 있다. 본 문제는 NP-complete 계열에 포함되는 문제로서 본 연구에서는 Tabu Search 및 GRASP 등을 조합한 새로운 메타휴리스틱 알고리즘을 제시하고자 한다.

• Journal of Advanced Marine Engineering and Technology
• /
• 제38권8호
• /
• pp.1004-1009
• /
• 2014

The redundancy allocation problem has usually considered only the component redundancy at the lowest-level for the enhancement of system reliability. A system can be functionally decomposed into system, module, and component levels. Modular redundancy can be more effective than component redundancy at the lowest-level because in modular systems, duplicating a module composed of several components can be easier, and requires less time and skill. We consider a multi-level redundancy allocation problem in which all cases of redundancy for system, module, and component levels are considered. A tabu search of memory-based mechanisms that balances intensification with diversification via the short-term and long-term memory is proposed for its solution. To the best of our knowledge, this is the first attempt to use a tabu search for this problem. Our tabu search algorithm is compared with the previous genetic algorithm for the problem on the new composed test problems as well as the benchmark problems from the literature. Computational results show that the proposed method outstandingly outperforms the genetic algorithm for almost all test problems.

• Structural Engineering and Mechanics
• /
• 제27권5호
• /
• pp.575-588
• /
• 2007

In this paper, two algorithms are presented for the optimum design of geometrically nonlinear steel space frames using tabu search. The first algorithm utilizes the features of short-term memory (tabu list) facility and aspiration criteria and the other has long-term memory (back-tracking) facility in addition to the aforementioned features. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Allowable stress design (ASD) specification, maximum drift (lateral displacement) and interstorey drift constraints were imposed on the frames. The algorithms were applied to the optimum design of three space frame structures. The designs obtained using the two algorithms were compared to each other. The comparisons showed that the second algorithm resulted in lighter frames.

• 대한산업공학회지
• /
• 제34권2호
• /
• pp.205-215
• /
• 2008

convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• 경영과학
• /
• 제13권1호
• /
• pp.13-27
• /
• 1996

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• 한국항공우주학회지
• /
• 제37권8호
• /
• pp.737-743
• /
• 2009

본 연구는 Tabu Search를 이용하여 LHP의 최적설계를 진행하는 방법과 절차 및 결과를 제시하고자 한다. 최적설계의 목적은 항공기에 탑재된 리튬이온 전지의 작동온도 조건을 만족하면서 LHP의 중량을 최소화시키는 것이다. 전지는 고에너지 밀도의 특성으로 항공기에 장착된 고에너지 레이저의 동력원으로 사용되는 것으로 가정되었다. 해석은 Steady state analysis model에 기초하였으며 메타모델로 근사화하였다. 최적화 결과로 Tabu Search는 유전알고리듬 등 다른 비 구배기반 최적화 방법에 비해 비교적 적은 계산 시간을 소요하면서도 전역해를 보장하였으나 난수에 의해 초기해를 바꾸어 가면서 최적화를 여러 번 시도해야 하는 단점이 있었다. 그리고 최적화 과정을 통해 기 발표된 LHP와 동일한 성능을 가지면서도 경량화된 LHP를 얻을 수 있었다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2004년도 가을 학술발표회 논문집
• /
• pp.171-178
• /
• 2004

The purpose of optimum design for structures is to minimize the cost and to obtain the reasonable structural systems. This design algorithm have many objective functions including discrete variables as sections, weight, stiffness and shapes. Simulated annealing, Genetic algorithm and TABU algorithm are used search for these optimum values in the structural design. TABU algorithm is applied to many types structures to search for section and distribution optimization and compared with the results of Genetic algorithm for evaluating the efficiency of this algorithm. In this paper, the plane truss of 10 elements and the space truss of 25 element having 10 nodes, star dome and cable dome are analyzed as analytical models.