• 제목/요약/키워드: Weighted Sum Algorithm

검색결과 133건 처리시간 0.024초

유전자 알고리듬을 이용한 운행비용 최소화 다용량 차량경로문제 (A Heterogeneous VRP to Minimize the Transportation Costs Using Genetic Algorithm)

  • 임무균;전건욱
    • 산업공학
    • /
    • 제20권2호
    • /
    • pp.103-111
    • /
    • 2007
  • A heterogeneous VRP which considers various capacities, fixed and variable costs was suggested in this study. The transportation cost for vehicle is composed of its fixed and variable costs incurred proportionately to the travel distance. The main objective is to minimize the total sum of transportation costs. A mathematical programming model was suggested for this purpose and it gives an optimal solution by using OPL-STUDIO (ILOG CPLEX). A genetic algorithm which considers improvement of an initial solution, new fitness function with weighted cost and distance rates, and flexible mutation rate for escaping local solution was also suggested. The suggested algorithm was compared with the results of a tabu search and sweeping method by Taillard and Lee, respectively. The suggested algorithm gives better solutions rather than existing algorithms.

Reference code를 이용한 새로운 PN code 획득 알고리즘 (A new PN code acquisition algorithm using a reference code)

  • 이승환;김운경;박재영
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
    • /
    • pp.279-282
    • /
    • 2002
  • Here we introduce so called Reference code-weighted sum of all PN codes used in the system-. We do inner product operation between received PN code and Reference code rather than locally generated PN code in the receiver. Acquisition process can be accomplished by only one inner product during full period of PN code. It's essential innovation against present method which can be viewed successive hypothesis test by inner product for entire candidate PH codes set. Well -defined decision region makes it possible. We suggest the. criterion fur designing the decision region and find a condition for weight (coefficient) of Reference code.

  • PDF

클러스터링 기반의 CR시스템에서 가중치 협력 스펙트럼 센싱 기술의 개선연구 (Improved Weighted-Collaborative Spectrum Sensing Scheme Using Clustering in the Cognitive Radio System)

  • 최규진;손성환;이주관;김재명
    • 한국ITS학회 논문지
    • /
    • 제7권6호
    • /
    • pp.101-109
    • /
    • 2008
  • 본 논문은 클러스터링 기법을 도입하여 기존에 제안된 가중치 협력 스펙트럼 시스템에서 실질적으로 구하지 못했던 Pd를 구하고, 새로운 가중치 생성 알고리즘을 통하여 1차 사용자 신호의 감지 성능을 향상시키는 방법을 제안하였다. 유사한 채널을 같는 CR 사용자를 클러스터링 기법을 이용하여 그룹화하여 각각의 사용자로부터 획득한 센싱 결과를 토대로 Pd를 계산하였다. 또한, 각 클러스터의 검출확률의 제곱 합을 이용하여 가중치(Wj(n+1))를 생성하였다. 이는 기존의 방식보다 센싱 성능이 우수하였으며, 특히 1차 사용자의 신호가 갑자기 사라졌을 경우 신호가 없는 상황에서의 검출 확률인 false alarm rate가 낮아지는 결과를 보였다. 컴퓨터 모의실험을 통하여 이를 검증한다.

  • PDF

행동기반 다개체 로봇 시스템을 이용한 환경감시 알고리즘 (Environment Monitoring Algorithm using Behavior-Based Multiple Robot System)

  • 권지욱;홍석교;좌동경
    • 전기학회논문지
    • /
    • 제61권4호
    • /
    • pp.622-628
    • /
    • 2012
  • This paper proposes an environment monitoring algorithm using a behavior-based multiple robot system. This paper handles an escort and a boundary-tracking especially. Unlike previous research works, the proposed environment monitoring system which is based on the behavior-based multiple robot control allows the system to employ the reusable code and general algorithm. Also, the proposed method can be applied to cheaper process with low performances. In the proposed method, escort and boundary-tracking missions are constructed by weighted sum of predefined basic behaviors after redefining the basic behaviors in previous works and introducing the novel basic behavior. Simulation results of the proposed method are included to demonstrate the practical application of the proposed algorithm.

자동 시각 검사를 위한 개선된 서브픽셀 알고리즘 (An Improved Subpixel Algorithm for Automated Visual Inspection System)

  • 장동식;이만희;김길동
    • 산업공학
    • /
    • 제11권3호
    • /
    • pp.15-22
    • /
    • 1998
  • A new improved algorithm in edge location to subpixel accuracy using decent-based weight to spatial information is proposed in this paper and applied to automated visual inspection(AVI) system. An application of the new edge operator as an edge detector is also provided and compared with Tabatabai and Lyvers edge detectors. The existing algorithms located edger to subpixel accuracy using least-square or moment-based methods. The algorithms also use only spatial information or grey-level values to locate edges. However, the proposed algorithm consider the weighted sum of grey-levels values of each edge pattern. The results show that the proposed algorithm is relatively less biased and has smaller standard deviation than the edge operations developed by Tabatabai and Lyvers in the presence of noise.

  • PDF

ITERATIVE REWEIGHTED ALGORITHM FOR NON-CONVEX POISSONIAN IMAGE RESTORATION MODEL

  • Jeong, Taeuk;Jung, Yoon Mo;Yun, Sangwoon
    • 대한수학회지
    • /
    • 제55권3호
    • /
    • pp.719-734
    • /
    • 2018
  • An image restoration problem with Poisson noise arises in many applications of medical imaging, astronomy, and microscopy. To overcome ill-posedness, Total Variation (TV) model is commonly used owing to edge preserving property. Since staircase artifacts are observed in restored smooth regions, higher-order TV regularization is introduced. However, sharpness of edges in the image is also attenuated. To compromise benefits of TV and higher-order TV, the weighted sum of the non-convex TV and non-convex higher order TV is used as a regularizer in the proposed variational model. The proposed model is non-convex and non-smooth, and so it is very challenging to solve the model. We propose an iterative reweighted algorithm with the proximal linearized alternating direction method of multipliers to solve the proposed model and study convergence properties of the algorithm.

주파수 대역 특성을 이용한 초점 검출 알고리즘 (Multi Bands Focus Detection Algorithm)

  • 최종성;한영석;강문기
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.825-826
    • /
    • 2008
  • Focusing is the principal factor that decides the image quality. In the low illuminance condition, captured images with a digital camera usually blurred because the autofocus system of the camera fail to detect the in-focus position. The failure of focusing is due to thermal noise in the captured image. In this paper, we propose a new focus detection algorithm. The proposed algorithm use the new focusing index which is weighted sum of the high-frequency energy and mid-frequency energy. The weight is determined by the local variance of the image. The proposed algorithm performs stable focusing detection with in the low illuminance condition.

  • PDF

The Dynamic Allocated Bees Algorithms for Multi-objective Problem

  • Lee, Ji-Young;Oh, Jin-Seok
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제33권3호
    • /
    • pp.403-410
    • /
    • 2009
  • The aim of this research is to develop the Bees Algorithm named 'the dynamic allocated Bees Algorithm' for multi-objective problem, especially in order to be suit for Pareto optimality. In addition two new neighbourhood search methods have been developed to produce enhanced solutions for a multi-objective problem named 'random selection neighbourhood search' and 'weighted sum neighbourhood search' and they were compared with the basic neighbourhood search in the dynamic allocated Bees Algorithm. They were successfully applied to an Environmental/Economic (electric power) dispatch (EED) problem and simulation results presented for the standard IEEE 30-bus system and they were compared to those obtained using other approaches. The comparison shows the superiority of the proposed dynamic allocated Bees Algorithms and confirms its suitability for solving the multi-objective EED problem.

동적 스펙트럼 접근을 위한 유전자 알고리즘 기반 전송 매개변수 최적화 기법 (A Transmission Parameter Optimization Scheme Based on Genetic Algorithm for Dynamic Spectrum Access)

  • 채근홍;윤석호
    • 한국통신학회논문지
    • /
    • 제38A권11호
    • /
    • pp.938-943
    • /
    • 2013
  • 본 논문에서는 동적 스펙트럼 접근을 위한 유전자 알고리즘 기반 전송 매개변수 최적화 기법을 제안한다. 구체적으로는 전송 매개변수 최적화를 위해 다목적 적합도 함수를 단일 목적 적합도 함수들의 가중합으로 표현하고, 유전자 알고리즘을 이용하여 주어진 전송 시나리오에 최적화된 전송 매개변수 값을 얻는다. 모의실험을 통하여 제안한 다목적 적합도 함수를 이용하여 주어진 시나리오에 따라 전송 매개변수를 최적화한 결과를 보인다.

블록 프로세싱 기법을 이용한 주파수 영역에서의 회귀 최소 자승 알고리듬 (Frequency-Domain RLS Algorithm Based on the Block Processing Technique)

  • 박부견;김동규;박원석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.240-240
    • /
    • 2000
  • This paper presents two algorithms based on the concept of the frequency domain adaptive filter(FDAF). First the frequency domain recursive least squares(FRLS) algorithm with the overlap-save filtering technique is introduced. This minimizes the sum of exponentially weighted square errors in the frequency domain. To eliminate discrepancies between the linear convolution and the circular convolution, the overlap-save method is utilized. Second, the sliding method of data blocks is studied Co overcome processing delays and complexity roads of the FRLS algorithm. The size of the extended data block is twice as long as the filter tap length. It is possible to slide the data block variously by the adjustable hopping index. By selecting the hopping index appropriately, we can take a trade-off between the convergence rate and the computational complexity. When the input signal is highly correlated and the length of the target FIR filter is huge, the FRLS algorithm based on the block processing technique has good performances in the convergence rate and the computational complexity.

  • PDF