• 한국컴퓨터정보학회논문지
• /
• 제10권4호
• /
• pp.93-102
• /
• 2005

제한된 통신 환경 상에서 P2P 어플리케이션에 의해 발생되는 과도한 트래픽은 네트워크 대역폭 문제와 연관된다. 또한 P2P시스템은 피어들의 P2P 오버레이 네트워크에의 연결성이 매우 약한 약결합 시스템으로 검색 단계에서 원하는 자원을 찾는다 하여도 다운로드 단계에서 반드시 그 피어에서 자원을 다운받을 수 있다는 보장이 없다. 이전 검색 알고리즘(1)에서는 이러한 문제를 해결하기 위해 Random Walks 기반의 휴리스틱 피어 선택 기법을 적용하였다. 본 논문에서는 각 피어의 컴퓨팅 파워에 영향 받는 노드 분산율을 개선하기 위해 이전 알고리즘(1) 기반의 적응적 P2P 검색 알고리즘을 제안하였다. 또한 트래픽 양을 줄이기 위해 부가적으로 질의율 기반의 차별적 리플리케이션 기법을 채택했다. 제안한 시스템의 성능 평가 결과 검색의 방향성과 통신 발생의 분포 측면에서 적절한 타협점에서 동작함을 확인하였다.

• 한국전산구조공학회논문집
• /
• 제31권6호
• /
• pp.301-308
• /
• 2018

이 논문에서는 다중 재난을 고려한 복합 구조제어 시스템의 최적 설계방법을 제시한다. 한 가지 유형의 위험에 대해 하나의 시스템이 설계되는 전형적인 구조제어 시스템과는 달리, 구조물의 지진 및 바람에 의한 진동응답을 저감하기 위해 능동 및 수동제어 시스템에 대한 동시 최적 설계방법을 제안하였다. 수치 예로서, 30층 빌딩 구조물에 설치된 30개의 점성 댐퍼와 복합형 질량 감쇠기에 대한 최적 설계문제를 보였다. 최적화 문제를 풀기 위해 자체적응 화음탐색(harmony search, HS)알고리즘을 채택하였다. 화음탐색 알고리즘은 사람이 연주하는 악기의 튜닝 과정을 모방한 전역 최적화를 위한 메타 휴리스틱 진화 연산방법의 하나이다. 또한 전역 탐색 및 빠른 수렴을 위해 자가적응적이고 동적인 매개변수 조정 알고리즘을 도입하였다. 최적화 설계 결과, 능동 및 수동 시스템이 독립적으로 최적화된 표준적인 복합제어 시스템에 비해 제안한 동시 최적제어 시스템의 성능과 효율성이 우수함을 보였다.

• Industrial Engineering and Management Systems
• /
• 제11권2호
• /
• pp.170-175
• /
• 2012

In this paper, a procedure using a genetic algorithm (GA) and a heuristic local search (HLS) is proposed for solving facility rearrangement problem (FRP). FRP is a decision problem for stopping/running of facilities and integration of stopped facilities to running facilities to maximize the production capacity of running facilities under the cost constraint. FRP is formulated as an integer programming model for maximizing the total production capacity under the constraint of the total facility operating cost. In the cases of 90 percent of cost constraint and more than 20 facilities, the previous solving method was not effective. To find effective alternatives, this solving procedure using a GA and a HLS is developed. Stopping/running of facilities are searched by GA. The shifting the production operation of stopped facilities into running facilities is searched by HLS, and this local search is executed for one individual in this GA procedure. The effectiveness of the proposed procedure using a GA and HLS is demonstrated by numerical experiment.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.143-146
• /
• 2000

Motion Estimation/compensation(ME/MC) is one of the efficient interframe ceding techniques for its ability to reduce the high redundancy between successive frames of an image sequence. Calculating the blocking matching takes most of the encoding time. In this paper a new fast block matching algorithm(BMA) is developed for motion estimation and for reduction of the computation time to search motion vectors. The feature of the new algorithm comes from the center-biased checking concept and the trend of pixel movements. At first, Motion Vector(MV) is searched in ${\pm}$1 of search area and then the motion estimation is exploited in the rest block. The ASP and MSE of the proposed search algorithm show good performance.

• 디지털콘텐츠학회 논문지
• /
• 제11권3호
• /
• pp.367-374
• /
• 2010

최근 무선인터넷 기술은 급속히 발전하고 있으며 새로운 모바일 미디어를 통하여 일상 생활에 직간접적으로 많은 영향을 끼치고 있다. 본 연구에서는 모바일 폰에 의한 촬영으로 이미지의 픽셀(Pixel) 정보를 얻어내고 DB에 저장된 레퍼런스(Reference)이미지와 비교하여 근접 값을 검색하는 알고리즘을 제안한다. 이것은 눈앞에 보이는 사물에 대한 정보에 대하여 알고 싶을 때 소지하고 있는 모바일 폰으로 이미지를 촬영한 후 인터넷 검색을 통해 알 수 있는 가능성을 제시한다. 또한 제안한 알고리즘에 의한 시스템의 예를 본 논문에 구현하였다.

• 한국경영과학회지
• /
• 제32권4호
• /
• pp.1-18
• /
• 2007

In this paper, we develop an adaptive genetic algorithm (aGA). The aGA has an adaptive scheme which can automatically determine the use of local search technique and adaptively regulate the rates of crossover and mutation operations during its search process. For the adaptive scheme, the ratio of degree of dispersion resulting from the various fitness values of the populations at continuous two generations is considered. For the local search technique, an improved iterative hill climbing method is used and incorporated into genetic algorithm (GA) loop. In order to demonstrate the efficiency of the aGA, i) a canonical GA without any adaptive scheme and ii) several conventional aGAs with various adaptive schemes are also presented. These algorithms, including the aGA, are tested and analyzed each other using various test problems. Numerical results by various measures of performance show that the proposed aGA outperforms the conventional algorithms.

• 경영과학
• /
• 제22권1호
• /
• pp.167-178
• /
• 2005

The 2DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical .rectangular bins. The 2DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification Strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.123-136
• /
• 2004

In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.

• 대한기계학회논문집
• /
• 제18권10호
• /
• pp.2606-2615
• /
• 1994

Sorting time is one of the most important issues for auto IC test handling systems. In actual system, because of too much path, reducing the computing time for finding a sorting path is the key way to enhancing the system performance. The exhaustive path search technique can not be used for real systems. This paper proposes heuristic sorting algorithm to find the minimal sorting time. The suggested algorithm is basically based on the best-first search technique and multi-level search technique. The results are close to the optimal solutions and computing time is greately reduced also. Therefore the proposed algorthm can be effectively used for real-time sorting process in auto IC test handling systems.

• 한국생산제조학회지
• /
• 제24권1호
• /
• pp.63-68
• /
• 2015

Pattern layout design is very important to the automation of apparel industry. Until now, the genetic algorithm and Tabu search method have been applied to layout design automation. With the genetic algorithm and Tabu search method, the obtained values are not always consistent depending on the initial conditions, number of iterations, and scheduling. In addition, the selection of various parameters for these methods is not easy. This paper presents a hybrid search method that uses a neural network and simulated annealing to solve these problems. The layout of pattern elements was optimized to verify the potential application of the suggested method to apparel pattern layout design.