• Title/Summary/Keyword: Random Tabu Search

Search Result 33, Processing Time 0.026 seconds

A Tabu Search Algorithm for Controller Placement Problem in Software Defined Networks (소프트웨어 정의 네트워크에서 제어기 배치 문제를 위한 타부 서치 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.491-498
    • /
    • 2016
  • The software defined networks implement a software network control plane, which is physically separated from the data plane. For wide area software defined network deployments, multiple controllers are required, and the placement of these controllers influences importantly the performance of the software defined networks. This paper proposes a Tabu search algorithm, which is one of the meta heuristic algorithms, for an efficient controller placement in software defined networks. In order to efficiently obtain better results, we propose new neighborhood generating operations, which are called the neighbor position move and the neighbor number move, of the Tabu search algorithm. We evaluate the performances of the proposed algorithm through some experiments in terms of the minimum latency and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms the existing genetic algorithm and random method under various conditions.

Parallel Hybrid Genetic Algorithm-Tabu Search for Distribution System Reconfiguration Using PC Cluster System (배전계통 재구성 문제에 PC클러스터 시스템을 이용한 병렬 유전 알고리즘-타부탐색법 구현)

  • Mun K. J.;Kim H. S.;Park J. H.;Lee H. S.;Kang H. T.
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.36-38
    • /
    • 2004
  • This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a recokiguration in distribution system. In parallel hybrid CA-TS, after CA operations, stings which are not emerged in the past population are selected in the reproduction procedure. After reproduction operation, if there are many strings which are in the past population, we add new random strings into the population, if there's no improvement for the predetermined iteration, local search procedure is executed by TS for the strings with high fitness function value. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution system in the reference paper.

  • PDF

Parallel Hybrid Genetic Algorithm-Tabu Search for Distribution System Service Restoration Using PC Cluster System (배전계통 고장복구 문제에 PC 클러스터 시스템을 이용한 병렬 유전 알고리즘-타부탐색법 구현)

  • Mun K. J.;Kim H. S.;Park J. H.;Lee H. S.;Kang H. T.
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.446-448
    • /
    • 2004
  • This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution system. In parallel hybrid GA-TS, after GA operations, strings which are not emerged in the past population are selected in the reproduction procedure. After reproduction operation, if there are many strings which are in the past population, we add new random strings into the population. If there's no improvement for the predetermined iteration, local search procedure is executed by f for the strings with high fitness function value. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a practical distribution system in Korea.

  • PDF

Optimization of wire and wireless network using Global Search Algorithm (전역 탐색 알고리즘을 이용한 유무선망의 최적화)

  • 오정근;변건식
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.251-254
    • /
    • 2002
  • In the design of mobile wireless communication system, the location of BTS(Base Transciver Stations), RSC(Base Station Controllers), and MSC(Mobile Switching Center) is one of the most important parameters. Designing wireless communication system, the cost of equipment is need to be made low by combining various, complex parameters. We can solve this problem by combinatorial optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been extensively used for global optimization. This paper shows the four kind of algorithms which are applied to the location optimization of BTS, BSC, and MSC in designing mobile communication system and then we compare with these algorithms. And also we analyze the experimental results and shows the optimization process of these algorithms. As a the channel of a CDMA system is shared among several users, the receivers face the problem of multiple-access interference (MAI). Also, the multipath scenario leads to intersymbol interference (ISI). Both components are undesired, but unlike the additive noise process, which is usually completely unpredictable, their space-time structure helps to estimate and remove them.

  • PDF

Improvement of the efficiency from Computer-Generated Holograms by using TS algorithm and SA algorithm (TS 알고리듬과 SA 알고리듬을 이용한 컴퓨터 형성 홀로그램의 성능 향상)

  • Cho, Chang-Sub;Shin, Chang-Mok;Cho, Kyu-Bo;Kim, Soo-Joong;Kim, Cheol-Su
    • Korean Journal of Optics and Photonics
    • /
    • v.16 no.1
    • /
    • pp.43-49
    • /
    • 2005
  • In this paper, we propose a method for optimizing a computer-generated hologram(CGH) by combining the Tabu Search(TS) algorithm with the Simulated Annealing(SA) algorithm. By replacing an initial random pattern of the SA algorithm with an approximately ideal hologram pattern of the TS algorithm, we design a CGH which has high diffraction efficiency(DE). We compared the performance of the proposed algorithm with the SA algorithm using computer simulation and an optical experiment. As a result, we confirmed diffraction efficiency and uniformity to be enhanced in the proposed algorithm.

Optimum design of rotor supported on floating ring journal bearing by the enhanced artificial life optimization algorithm (인공생명 알고리듬을 이용한 프로팅 링 저널 베어링 지지 축계의 최적설계)

  • Song, Jin-Dea;Suk, Ho-Il;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.11b
    • /
    • pp.1034-1037
    • /
    • 2002
  • This paper presents an optimum design of rotor-bearing system using a hybrid method to compute 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. We applied EALA to the optimum design of rotor-shaft system supported by the floating ring journal bearings. we will propose the optimum shape of rotor, position and shape of bearings. Through this study, we investigate the reliability and usefulness of EALA.

  • PDF

Optimum design of rotor supported on floating ring journal bearing by the enhanced artificial life optimization algorithm (인공생명 알고리듬을 이용한 프로팅 링 저널 베어링 지지 축계의 최적설계)

  • Song, Jin-Dea;Suk, Ho-Il;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.11a
    • /
    • pp.400.1-400
    • /
    • 2002
  • This paper presents an optimum design of rotor-bearing system using a hybrid method to compute 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. We applied EALA to the optimum design of rotor-shaft system supported by the floating ring journal bearings. (omitted)

  • PDF

Optimal Design of Fluid Mount Using Artificial Life 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.

  • PDF

Optimal Design of Fluid Mount Using Artificial Life Algorithm (인공생명 알고리듬을 이용한 유체마운트의 최적설계)

  • 안영공;송진대;양보석;김동조
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.12 no.8
    • /
    • pp.598-608
    • /
    • 2002
  • This paper shows the optimal design methodology for the fluid engine mount by the artificial life algorithm. The design has been commonly modified by trial and error because there is many design parameters that can be varied in order to minimize transmissibility at the desired fundamental resonant and notch frequencies. The application of trial and error method to optimization of the fluid mount is a great work. 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. In this study the enhanced artificial life algorithm is applied to get the desired fundamental resonant and notch frequencies of a fluid mount and to minimize transmissibility at these frequencies. The present hybrid algorithm is the synthesis of and 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 globa1 optimum solutions. The results show that the performance of the optimized mount compared with the original mount is improved significantly.

Development of the New Hybrid Evolutionary Algorithm for Low Vibration of Ship Structures (선박 구조물의 저진동 설계를 위한 새로운 조합 유전 알고리듬 개발)

  • Kong, Young-Mo;Choi, Su-Hyun;Song, Jin-Dae;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.164-170
    • /
    • 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, 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 test functions and comparing the results to GA. And 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 rear 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.

  • PDF