• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.16 no.6 s.111
• /
• pp.665-673
• /
• 2006

This paper proposes a RSM-based hybrid evolutionary Algorithm (RHEA) which combines the merits of the popular programs such as genetic algorithm (GA), tabu search method and response surface methodology (RSM). This algorithm, for improving the convergent speed that is thought to be the demerit of genetic algorithm, uses response surface methodology and simplex method. The mutation of GA offers random variety to finding the optimum solution. In this study, however, systematic variety can be secured through the use of tabu list. Efficiency of this method has been proven by applying traditional left functions and comparing the results to GA. It was also proved that the newly suggested algorithm is very effective to find the global optimum solution to minimize the weight for avoiding the resonance of fresh water tank that is placed in the after body area of ship. According to the study, GA's convergent speed in initial stages is improved by using RSM method. An optimized solution is calculated without the evaluation of additional actual objective function. In a summary, it is concluded that RHEA is a very powerful global optimization algorithm from the view point of convergent speed and global search ability.

• Journal of the military operations research society of Korea
• /
• v.35 no.3
• /
• pp.47-59
• /
• 2009

A hybrid Genetic Algorithm is applied to military resource allocation problem. Since military uses many resources in order to maximize its ability, optimization technique has been widely used for analysing resource allocation problem. However, most of the military resource allocation problems are too complicate to solve through the traditional operations research solution tools. Recent innovation in computer technology from the academy makes it possible to apply heuristic approach such as Genetic Algorithm(GA), Simulated Annealing(SA) and Tabu Search(TS) to combinatorial problems which were not addressed by previous operations research tools. In this study, a hybrid Genetic Algorithm which reinforces GA by applying local search algorithm is introduced in order to address military optimization problem. The computational result of hybrid Genetic Algorithm on Missile Interceptor Allocation problem demonstrates its efficiency by comparing its result with that of a simple Genetic Algorithm.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11a
• /
• pp.427-432
• /
• 2001

This paper shows the optimum design of the fluid engine mount. The design has been modified by trial and error because there is many design parameters that can be varied in order to obtain resonant and notch frequencies, and notch depth. It seems to be a great application for optimal design for the mount. Many combinations of parameters are possible to give us the desired resonant and notch frequencies, but the question is which combination provides the lowest resonant peak and notch depth\ulcorner In this study, the enhanced artificial life algorithm is applied to get the desired notch frequency of a fluid mount and minimize transmissibility at the notch frequency. The present hybrid algorithm is the synthesis of an artificial life algorithm with the random tabu (R-tabu) search method. The hybrid algorithm has some advantages, which 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. The results show that the performance of a conventional engine mount can be improved significantly compared with the optimized mount.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.169-178
• /
• 1996

Geographically dispersed computing system is made of computers interconnected by a telecommunications network. To make the system operated efficiently, system designer must determine the allocation of data files to each node. In designing such distributed computing system, the most important issue is the determination of the numbers and the locations where database files are allocated. This is commonly referred to as the file allocation problem (FAP)[3]. The proposed model is a 0/l integer programming problem minimizing the sum of file storage costs and communication(query and update) costs. File allocation problem belongs to the class of NP-Complete problems. Because of the complexity, it is hard to solve. So, this paper presents an efficient heuristic algorithm to solve the file allocation problem using Tabu Search Technique. By comparing the optimal solutions with the heuristic solutions, it is believed that the proposed heuristic algorithm gives good solutions. Through the experimentation of various starting points and tabu restrictions, this paper presents fast and efficient method to solve the file allocation problem in the distributed computing system.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.27-37
• /
• 2012

This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.105-108
• /
• 2002

Although asynchronous designs have become a promising way to develop complex modern digital systems, there is a few complete design framework for VLSI designers who wish to use automatic CAD tools. Especially, high-level synthesis is not widely concerned until now. In this paper we Proposed a method for high-level synthesis of asynchronous systems as a part of an asynchronous design framework. Our method performs scheduling, allocation, and binding, which are three subtasks of high-level synthesis, in simultaneous using a transformational approach. To deal with complexity of high-level synthesis we use neighborhood search algorithm such as Tabu search.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.1
• /
• pp.48-57
• /
• 2010

A comparison of two kinds of scheduling optimization algorithms is presented in this paper. As satellite control and operation techniques have been developed, satellite missions became more complicated and overall quantity of missions also increased. These changes require more specific consideration and a huge amount of computation for the satellite mission scheduling. Therefore, it is a good strategy to make a scheduling optimization algorithm for the efficient satellite mission scheduling operation. In this paper, two kinds of scheduling optimization algorithms are designed with tabu-search algorithm and genetic algorithm respectively. These algorithms are applied for the same mission scenario and the results of each algorithm are compared and analyzed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.7
• /
• pp.930-939
• /
• 2021

In recent years, the use of broadband bandwidth and redundant links for stable transmission in networks has resulted in excessive energy consumption and reduced transmission efficiency. In this paper, we propose an optimization algorithm that reduces the number of transmission links and minimizes transmission energy by removing redundant traffic in networks where traffic redundancy is allowed. The optimization algorithm proposed in this paper uses the meta-heuristic method using Tabu search algorithm. The proposed optimization algorithm minimizes transmission energy by designing a neighborhood generation method that efficiently routes overlapping traffic. The performance evaluation of the proposed optimization algorithm was performed in terms of the number of links used to transmit all traffic generated in the network and the transmission energy consumed. From the performance evaluation results, it was confirmed that the proposed algorithm is superior to other algorithms previously proposed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.209-214
• /
• 2020

The equitable partitioning problem(EPP) is classified as [0/1] binary skill existence or nonexistence and integer skill levels such as [1,2,3,4,5]. There is well-known a polynomial-time optimal solution finding algorithm for binary skill EPP. On the other hand, tabu search a kind of metaheuristic has apply to integer skill level EPP is due to unknown polynomial-time algorithm for it and this problem is NP-hard. This paper suggests heuristic greedy algorithm with polynomial-time to find the optimal solution for integer skill level EPP. This algorithm descending sorts of skill level frequency for each field and decides the lower bound(LB) that more than the number of group, packing for each group bins first, than the students with less than LB allocates to each bin additionally. As a result of experimental data, this algorithm shows performance improvement than the result of tabu search.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2004.06a
• /
• pp.61-66
• /
• 2004

본 논문에서는 Tabu Search(TS) 알고리듬과 Simulated Anneal ing(SA) 알고리듬을 결합하여 향상된 성능을 갖는 컴퓨터 형성 홀로그램을 설계할 수 있는 방법을 제안하였다. 회절 효율의 향상을 위해 TS 알고리듬으로 이상적인 홀로그램에 근접한 패턴을 생성하고, 이를 SA 알고리듬에서 무작위로 구성된 초기 패턴과 대체하여 컴퓨터 형성 홀로그램을 설계하였다. 컴퓨터 모의 실험과 광 실험을 통하여 제안한 방법과 SA 알고리듬과의 성능을 비교한 결과 제안한 방법으로 재생한 영상이 SA 알고리듬을 이용하였을 때보다 향상된 회절 효율을 가지는 것을 확인 할 수 있었다.