• Title/Summary/Keyword: 타부 탐색법

Search Result 24, Processing Time 0.025 seconds

A Development Of Optimal Reconfiguration Method For Distribution Systems Using PC Clustering (PC Clustering을 이용한 배전계통 선로 재구성 최적화 방법 개발)

  • Song, Myoung-Kee;Mun, Kyeong-Jun;Kim, Hyung-Su;Park, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 2003.07a
    • /
    • pp.24-26
    • /
    • 2003
  • 본 논문에서는 경험적 최적화 알고리즘인 타부 탐색법을 이용한 배전계통 선로 재구성 시스템을 개발하였다. 제안한 알고리즘은 PC Clustering으로 병렬 처리하여 배전계통 선로 재구성 문제의 최적해 탐색에 소요되는 계산시간을 단축하고, 배전자동화 시스템의 성능개선을 도모하고자 한다. 개발한 PC Cluster System은 이용자의 편의를 위해서 MS Windows환경에서 구축하였고, Visual C++환경에서 개발하였다. 제안한 방법의 유용성을 입증하기 위해 참고 문헌의 예제 계통에 적용한 후 종래의 방법에 의해 구한 재구성 방안과 비교함으로써 제안한 방법의 유용성을 입증하였다.

  • PDF

Bin Packing Algorithm for Equitable Partitioning Problem with Skill Levels (기량수준 동등분할 문제의 상자 채우기 알고리즘)

  • Lee, Sang-Un
    • 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.

Large Scale Unit Commitment Using Parallel Tabu Search (병렬 타부 탐색법을 이용한 대규모의 발전기 기동정지계획)

  • Kim, Hyeong-Su;Mun, Gyeong-Jun;Jo, Deok-Hwan;Hwang, Gi-Hyeon;Park, Jun-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.11
    • /
    • pp.528-536
    • /
    • 2001
  • This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods.

  • PDF

The Shape Optimal Design of Marine Medium Speed Diesel Engine Piston (박용(舶用) 중속(中速) 디젤엔진 피스톤의 형상최적설계(形狀最適設計))

  • Lee, Jun-Oh;Seong, Hwal-Gyeng;Cheon, Ho-Jeong
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.9
    • /
    • pp.59-70
    • /
    • 2008
  • Polynomial is used to optimize crown bowl shape of a marine medium speed diesel engine piston. The primary goal of this paper is that it's for an original design through a thermal stress and highest temperature minimum. Piston is modeled using solid element with 6 design variables defined the positional coordinate value. Global optimum of design variables are found and evaluated as developed and integrated with the optimum algorithm combining genetic algorithm(GA) and tabu search(TS). Iteration for optimization is performed based on the result of finite element analysis. After optimization, thermal stress and highest temperature reduced 0.68% and 1.42% more than initial geometry.

Unit Commitment Using Parallel Tabu Search (병렬 타부 탐색법을 이용한 발전기 기동정지계획)

  • Kim, H.S.;Mun, K.J.;Cho, D.H.;Hwang, G.H.;Park, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 2001.05a
    • /
    • pp.84-88
    • /
    • 2001
  • This paper proposes a method of solving a unit commitment problem using parallel tabu search (PTS). The TS is efficient optimization method using meta-heuristic. In this paper, to reduce the computation time for evaluating the neighborhoods, an evaluating method only on changed part and a path relinking method as diversification strategy are proposed. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with conventional methods. Numerical results show improvements in the generation cost and the computation time compared to previously obtained results.

  • PDF

Hydro-Thermal Optimal Scheduling Using Probabilistic Tabu Search (확률 타부 탐색법을 이용한 수화력 계통의 경제운용)

  • Kim, Hyung-Su;Park, June-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2002.11b
    • /
    • 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.

  • PDF

Search Heuristics for Capacitated Refuse Collection Network Design in Reverse Logistics (역방향 로지스틱스에서 용량제약을 고려한 수거망 설계문제에 관한 탐색기법)

  • Kim, Ji-Su;Choi, Hyun-Seon;Lee, Dong-Ho
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.1
    • /
    • pp.41-50
    • /
    • 2010
  • 본 논문에서는 수명이 다한 제품이나 소비자가 더 이상 사용하지 않는 폐기품을 다시 재사용하거나 폐기하는데 필요한 일련의 활동을 위한 역방향 로지스틱스에서의 수거망 설계 문제를 다루고 있다. 수거망 설계 문제는 수거지점의 위치와 수요지의 폐기품을 수거 지점에 할당하는 것을 결정하는 문제로 정의할 수 있으며 수거지점은 재활용품이나 폐기품이 위치한 지점 근처에 위치하고 주어진 잠재적인 위치를 중에서 결정하게 된다. 여기서, 각 수거지점은 용량제약이 있어 수거 지점에 할당되는 폐기품의 양에는 제한이 있다. 본 논문에서 다루는 수거망 설계문제에서는 수거지점을 설치하는데 필요한 고정비용과 수요지와 수거지점간의 수송비용의 합을 최소화하는 것을 목적으로 한다. 또한 대상문제를 보다 명확히 설명하기 위하여 징수계획법을 이용한 수리적 모형을 제안하였으며 문제의 복잡도 인하여 타부 서치와 시뮬레이티드 어닐링 두 가지 형태의 탐색기법을 제안하였다. 이들 탐색기법에 대하여 최대 500개의 잠재적 위치를 가지는 문제에 대하여 실험을 수행하였고 실험결과를 제시하였다.

OPTIMIZATION OF A DRIVER-SIDE AIRBAG USING KRIGING AND TABU SEARCH METHODS (크리깅과 타부탐색법을 이용한 운전석 에어백의 최적설계)

  • Kim, Jeung-Hwan;Lee, Kwom-Hee;Joo, Won-Sik
    • Proceedings of the KSME Conference
    • /
    • 2004.04a
    • /
    • pp.1035-1040
    • /
    • 2004
  • In the proto design stage of a new car, the performance of an occupant protection system is often evaluated by CAE instead of the real test. CAE predicts and recommends the appropriate design values hence reducing the number of the real tests. However, the existing researches using CAE in predicting the performances do not consider the uncertainties of parameters, in which inconsistency between the actual test results and CAE exists. In this research, the optimization procedure of a protection system such as airbag and load limiter is suggested for the frontal collision. The DACE modeling known as Kriging interpolation is introduced to obtain the meta model of the system followed by the tabu search method to determine a global optimum. Finally, the distribution of a suggested design is determined through the Monte-Carlo Simulation.

  • PDF

Hydro-Thermal Optimal Scheduling Using Probabilistic Tabu Search (확률 타부 탐색법을 이용한 수화력 계통의 경제운용에 관한 연구)

  • Kim, Hyeong-Su;Mun, Gyeong-Jun;Park, Jun-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.3
    • /
    • pp.153-161
    • /
    • 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 optical 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. Dynamic decoding method was also used to restrict a search region and to handle water balance constraints. In order to show the usefulness of the proposed method, the PTS is applied on two cases which have independent or 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.

Unit Commitment Using Parallel Genetic Algorithms and Parallel Tabu Search (병렬 유전알고리즘과 병렬 타부탐색법을 이용한 발전기 기동정지계획)

  • Cho, Deok-Hwan;Kang, Hyun-Tae;Kwon, Jung-Uk;Kim, Hyung-Su;Hwang, Gi-Hyun;Park, June-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2001.07a
    • /
    • pp.327-329
    • /
    • 2001
  • This paper presents the application of Parallel genetic algorithm and parallel tabu search to search an optimal solution of a unit commitment problem. The proposed method previously searches the solution globally using the parallel genetic algorithm, and then searches the solution locally using tabu search which has the good local search characteristic to reduce the computation time. This method combines the benefit of both method, and thus improves the performance. To show the usefulness of the proposed method, we simulated for 10 units system. Numerical results show the improvements of cost and computation time compared to previous obtained results.

  • PDF