• 디지털산업정보학회논문지
• /
• 제13권3호
• /
• pp.65-73
• /
• 2017

The fifth generation(5G) of wireless networks will connect not only smart phone but also unimaginable things. Therefore, 5G cellular network is facing the soaring traffic demand of numerous user devices. To solve this problem, a huge amount of 5G base stations will need to be installed. The base station positioning problem is an NP-hard problem that does not know how long it will take to solve the problem. Because, it can not find an answer other than to check the number of all cases. In this paper, to solve the NP hard problem, we compare the tabu search and the genetic algorithm using real maps for optimal cell planning. We also perform Monte Carlo simulations to study the performance of the Tabu search and Genetic algorithm for 5G cell planning. As a results, Tabu search required 2.95 times less computation time than Genetic algorithm and showed accuracy difference of 2dBm.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권12호
• /
• pp.561-567
• /
• 2001

This paper describes the application of Fuzzy Logic Controller (FLC) to Thyristor Controlled Series Capacitor (TCSC) which can have significant impact on power system dynamics. The function of the FLC is to control the firing angle of the TCSC. We tuned the scaling factors of the FLC using Tabu Search. The proposed FLC is used for damping the low frequency oscillations caused by disturbances such as the sudden changes of small or large loads or the outages in the generators or transmission lines. To evaluate usefulness of the proposed FLC, we performed the computer simulation fur single-machine infinite system. The response of FLC is compared with that of PD controller optimized using Tabu Search. Simulation results that the FLC shows better control performance than PD controller.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권4호
• /
• pp.843-859
• /
• 2024

The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.181-197
• /
• 2001

A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 추계학술대회 논문집 전력기술부문
• /
• pp.76-79
• /
• 2002

In this paper, we propose a Probabilistic Tabu Search(PTS) method for hydro-thermal scheduling. Hydro scheduling has many constraints and very difficult to solve the optimal schedule because it has many local minima. To solve the problem effectively, the proposed method uses two procedures, one is Tabu search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify its search region. To adjust parameters such as a reducing rate and initial searching region, search strategy is selected according to its probability after Restarting procedure. In order to show the usefulness of the proposed method, the PTS is applied on two cases which have dependent hydro plants and compared to those of other method. The simulation results show it is very efficient and useful algorithm to solve the hydro-thermal scheduling problem.

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

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

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2003년도 추계학술대회논문집
• /
• pp.672-676
• /
• 2003

Recently, the importance of ship vibration is emerging due to the large scaling, high speed and lightning of ship. For pleasantness in a cabin, shipbuilders ask for strict vibration criteria and the degree of vibration level at a deckhouse became an important condition for taking order from customers. This study conducted optimum design to attenuate vibration level of a deckhouse to solve above problems. New method was implemented, that is NASTRAN external call type independence optimization method. The merit of this method is global searching after setting various object functions and design variables. The global optimization algorithm used here is R-Tabu search method, which has fast converging time and searching various size domains. By modeling similar type to ship structure, validity of the suggested method was investigated.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권1호
• /
• pp.28-37
• /
• 2001

This paper presents an efficient algorithm for the loss minimization of distribution system by automatic sectionalizing switch operation in large scale distribution systems. Simulated annealing is particularly well suited for large combinational optimization problem, but the use of this algorithm is also responsible for an excessive computation time requirement. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. The hybrid algorithm of two methods with two tabu lists and the proposed perturbation mechanism is applied to improve the computation time and convergence property Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.

• 대한산업공학회지
• /
• 제33권4호
• /
• pp.469-479
• /
• 2007

This paper focuses on the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer must be visited exactly once by one vehicle starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied. The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the existing search heuristics. In particular, our algorithm incorporates the neighborhood reduction method using the proximity information of the Voronoi diagram corresponding to each problem instance. To show the performance of the Voronoi tabu search algorithm suggested in this paper, computational experiments are done on the benchmark problems and the test results are reported.