• 제목/요약/키워드: Tabu Search Algorithm

검색결과 185건 처리시간 0.025초

소분자 도킹에서의 탐색알고리듬의 현황 (Recent Development of Search Algorithm on Small Molecule Docking)

  • 정환원;조승주
    • 통합자연과학논문집
    • /
    • 제2권2호
    • /
    • pp.55-58
    • /
    • 2009
  • A ligand-receptor docking program is an indispensible tool in modern pharmaceutical design. An accurate prediction of small molecular docking pose to a receptor is essential in drug design as well as molecular recognition. An effective docking program requires the ability to locate a correct binding pose in a surprisingly complex conformational space. However, there is an inherent difficulty to predict correct binding pose. The odds are more demanding than finding a needle in a haystack. This mainly comes from the flexibility of both ligand and receptor. Because the searching space to consider is so vast, receptor rigidity has been often applied in docking programs. Even nowadays the receptor may not be considered to be fully flexible although there have been some progress in search algorithm. Improving the efficiency of searching algorithm is still in great demand to explore other applications areas with inherently flexible ligand and/or receptor. In addition to classical search algorithms such as molecular dynamics, Monte Carlo, genetic algorithm and simulated annealing, rather recent algorithms such as tabu search, stochastic tunneling, particle swarm optimizations were also found to be effective. A good search algorithm would require a good balance between exploration and exploitation. It would be a good strategy to combine algorithms already developed. This composite algorithms can be more effective than an individual search algorithms.

  • PDF

동적 수요와 세 가지 차량형태를 고려한 총괄 컨테이너 운송계획 (Aggregate Container Transportation Planning in the Presence of Dynamic Demand and Three Types of Vehicles)

  • 고창성;정기호;신재영
    • 산업공학
    • /
    • 제17권1호
    • /
    • pp.71-77
    • /
    • 2004
  • At the present time, container transportation plays a key role in the international logistics and the efforts to increase the productivity of container logistics become essential for Korean trucking companies to survive in the domestic as well as global competition. This study suggests an approach for determining fleet size for container road transportation with dynamic demand. Usually the vehicles operated by the transportation trucking companies in Korea can be classified into three types depending on the ways how their expenses occur; company-owned truck, mandated truck which is owned by outsider who entrust the company with its operation, and rented vehicle (outsourcing). Annually the trucking companies should decide how many company-owned and mandated trucks will be operated considering vehicle types and the transportation demands. With the forecasted monthly data for the volume of containers to be transported a year, a heuristic algorithm using tabu search is developed to determine the number of company-owned trucks, mandated trucks, and rented trucks in order to minimize the expected annual operating cost. The idea of the algorithm is based on both the aggregate production planning (APP) and the pickup-and-delivery problem (PDP). Finally the algorithm is tested for the problem how the trucking company determines the fleet size for transporting containers.

The Energy Saving for Separately Excited DC Motor Drive via Model Based Method

  • Udomsuk, Sasiya;Areerak, Kongpol;Areerak, Kongpan
    • Journal of Electrical Engineering and Technology
    • /
    • 제11권2호
    • /
    • pp.470-479
    • /
    • 2016
  • The model based method for energy saving of the separately excited DC motor drive system is proposed in the paper. The accurate power loss model is necessary for this method. Therefore, the adaptive tabu search algorithm is applied to identify the parameters in the power loss model. The field current values for minimum power losses at any load torques and speeds are calculated by the proposed method. The rule based controller is used to control the field current and speed of the motor. The experimental results confirm that the model based method can successfully provide the energy saving for separately excited DC motor drive. The maximum value of the energy saving is 48.61% compared with the conventional drive method.

Multicast Tree to Minimize Maximum Delay in Dynamic Overlay Network

  • 이채영;백진우
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.1609-1615
    • /
    • 2006
  • Overlay multicast technique is an effective way as an alternative to IP multicast. Traditional IP multicast is not widely deployed because of the complexity of IP multicast technology and lack of application. But overlay multicast can be easily deployed by effectively reducing complexity of network routers. Because overlay multicast resides on top of densely connected IP network, In case of multimedia streaming service over overlay multicast tree, real-time data is sensitive to end-to-end delay. Therefore, moderate algorithm's development to this network environment is very important. In this paper, we are interested in minimizing maximum end-to-end delay in overlay multicast tree. The problem is formulated as a degree-bounded minimum delay spanning tree, which is a problem well-known as NP-hard. We develop tabu search heuristic with intensification and diversification strategies. Robust experimental results show that is comparable to the optimal solution and applicable in real time

  • PDF

정적 환경의 화물컨테이너 운반 시스템에서의 차량 대수 및 경로 계획 (Fleet Sizing and Vehicle Routing for Static Freight Container Transportation)

  • 구평회;장동원;이운식
    • 산업공학
    • /
    • 제16권2호
    • /
    • pp.174-184
    • /
    • 2003
  • This paper addresses a fleet operation planning problem for a static freight container transportation system in which all the transportation requirements are predetermined at the beginning of a planning horizon. In the transportation system under consideration, a number of loaded containers are to be moved between container storage yards. An optimal fleet planning model is used to determine the minimum number of vehicles required. Based on the results from the optimal model, a tabu-search based algorithm is presented to perform a given transportation requirements with the least number of vehicles. The performance of the new procedure is evaluated through some experiments in comparison with two existing methods, and the it is found that our procedure produces good-quality solutions.

SDN 분산 컨트롤러와 타부 서치 알고리즘 (SDN Distributed Controllers and Tabu Search Algorithm)

  • 유승언;김동현;이병준;김경태;윤희용
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2018년도 제58차 하계학술대회논문집 26권2호
    • /
    • pp.147-148
    • /
    • 2018
  • 네트워크 제어 기능과 데이터 전송 기능을 물리적으로 분리하는 SDN 기술을 광범위하게 구현하기 위해서는 분산된 다중 컨트롤러가 필요하다. 이를 효과적으로 구현하기 위해 최적화 문제를 푸는 데 적합한 메타휴리스틱 알고리즘 중 하나인 타부 서치 알고리즘에 관해 설명하였다.

  • PDF

Tabu 탐색학습알고리즘에 의한 신경회로망을 이용한 결함진단 (Fault Diagnosis using Neural Network by Tabu Search Learning Algorithm)

  • 양보석;신광재;최원호
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1995년도 추계학술대회논문집; 한국종합전시장, 24 Nov. 1995
    • /
    • pp.280-283
    • /
    • 1995
  • 계층형 신경회로망은 학습능력이나 비선형사상능력을 가지고 있고, 그 특징을 이용하여 패턴인식이나 동정 및 제어 등에의 적용이 시도되어 성과를 올리고 있다. 현재, 그 학습법으로 널리 이용되고 있는 것이 역전파학습법으로 최급 강하법이나 공액경사법 등의 최적화 방법이 적용되고 있지만, 학습에 많은 시간이 걸리는 점, 국소적 최적해(local minima)에 해의 수렴이 이루어져 오차가 충분히 작게 되지 않는 점 등이 문제점으로 지적되고 있다. 본 논문에서는 Hu에 의해 고안된 random 탐색법과 조합된 random tabu 탐색법으로 최적결합계수를 구하는 학습알고리즘으로, 국소적 최적해에 수렴하는 것을 방지하고, 수렴정도를 개선하는 새로운 방법을 이용하여 회전기계의 이상진동진단에 적용가능성을 검토하고 오차역전파법에 의한 진단결과와 비교검토한다.

  • PDF

Optimum Design of Sandwich Panel Using Hybrid Metaheuristics Approach

  • Kim, Yun-Young;Cho, Min-Cheol;Park, Je-Woong;Gotoh, Koji;Toyosada, Masahiro
    • 한국해양공학회지
    • /
    • 제17권6호
    • /
    • pp.38-46
    • /
    • 2003
  • Aim of this article is to propose Micro-Genetic Simulated Annealing (${\mu}GSA$) as a hybrid metaheuristics approach to find the global optimum of nonlinear optimisation problems. This approach combines the features of modern metaheuristics such as micro-genetic algorithm (${\mu}GAs$) and simulated annealing (SA) with the general robustness of parallel exploration and asymptotic convergence, respectively. Therefore, ${\mu}GSA$ approach can help in avoiding the premature convergence and can search for better global solution, because of its wide spread applicability, global perspective and inherent parallelism. For the superior performance of the ${\mu}GSA$, the five well-know benchmark test functions that were tested and compared with the two global optimisation approaches: scatter search (SS) and hybrid scatter genetic tabu (HSGT) approach. A practical application to structural sandwich panel is also examined by optimism the weight function. From the simulation results, it has been concluded that the proposed ${\mu}GSA$ approach is an effective optimisation tool for soloing continuous nonlinear global optimisation problems in suitable computational time frame.

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

  • 안영공;송진대;양보석;김동조
    • 한국소음진동공학회논문집
    • /
    • 제12권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)

  • 공영모;최수현;송진대;양보석
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2006년도 춘계학술대회논문집
    • /
    • pp.164-170
    • /
    • 2006
  • 본 연구는 유전 알고리듬, 타부탐색법 그리고 반응표면법등 최근 많이 사용하고 있는 프로그램들의 장점들을 결합한 새로운 조합 유전 알고리듬을 제안한다. 본 알고리듬은 반응표면법 및 심플렉스법을 사용하여 유전알고리듬의 약점으로 여겨지는 수렴속도를 항상시키도록 하였다. 또한 유전 알고리듬에서 램덤한 다양성을 제공하지만, 본 연구에서는 타부리스트를 이용하여 체계적인 다양성을 추구하도록 하였다. 그리고 전통적인 시험함수에 본 알고리듬을 적용함으로써 본 방법의 효율성을 입증하였고 그 결과를 유전 알고리듬의 결과와 비교하였다. 또한 새롭게 제안된 알고리듬을 선미부에 위치한 청수탱크의 중량최적화에 적용한 길과 전역최적해를 효율적으로 찾는 것을 입증하였다. 또한 반응표면법을 사용한 새로운 유전알고리듬의 경우 실제 추가적인 목적함수를 평가하기 위한 계산이 필요 없으므로 수렴속도가 일반 유전 알고리듬보다 향상 되었음을 알 수 있었다. 마지막으로 제안된 조합 유전 알고리듬은 전역탐색능력과 수렴속도 측면에서 매우 강력한 전역 최적화 알고리듬임을 알 수 있었다.

  • PDF