• 제목/요약/키워드: Heuristic technique

검색결과 242건 처리시간 0.023초

Simulated Annealing법의 적용시 Starting Temperature 결정에 관한 연구 (A Study on Determination of Starting Temperature for the Method of Simulated Annealing)

  • 이영진;이권순
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1992년도 하계학술대회 논문집 A
    • /
    • pp.288-289
    • /
    • 1992
  • The method of simulated annealing is a technique that has recently attracted significant attention as suitable for optimization problem of very large scale. If the temperature is too high, then some of the structure created by the heuristic will be destroyed and unnecessary extra work will be done. If it is too low then solution is lost, similar to the case of a quenching cooling schedule in the Simulated Annealing (SA) phase. Therefore, a crucial issue in this study is the determination of the starting temperature and cooling schedule for SA phase.

  • PDF

2자유도 보상기를 이용한 직접 구동형 로봇의 궤도제어 (Trajectory Control of Direct Drive Robot with Two-Degree-of-Freedom Compensator)

  • 신정호;등무건사;영목달야;대웅번
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1993년도 정기총회 및 추계학술대회 논문집 학회본부
    • /
    • pp.304-306
    • /
    • 1993
  • In this paper, the authors show a link between a heuristic controller used in industry and a theoretical generalized controller. First, we clarify the internal structure of the generalized two-degree-of-freedom controller which yields a link between the theoretical researches and the practical applications. Secondly, we indicate how to blend identification and control together without any modification of the controller. This is in fact the problem of closed-loop identification. Thirdly, we propose a design technique of a free parameter taking into account a robust stability based on the information obtained from the identification. Finally, we apply the proposed algorithm to trajectory control of DD robot.

  • PDF

FLEX10K 계열에 대한 저전력 CPLD 기술 매핑 알고리즘 (Low Power CPLD Technology Mapping Algorithm for FLEX10K series)

  • 김재진;박남서;인치호;김희석
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(2)
    • /
    • pp.361-364
    • /
    • 2002
  • In this paper, we consider the problem of CLB based CPLD technology mapping for power minimization in combinational circuit. The problem has been previously proved to be NP-hard, and hence we present an efficient heuristic algorithm for it. The main idea of our algorithm is to exploit the "cut enumeration" and "feasible cluster" technique to generate possible mapping solutions for the sub-circuit rooted at each node. However, for the consideration of both run time and memory space, only a fixed-number of solutions are selected and stored by our algorithm. To facilitate the selection process, a method that correctly calculates the estimated power consumption for each mapped sub-circuit is developed. The experimental results show that our approach is shown a decrease of 30.5% compared with DDMAP and that of 15.63% for TEMPLA in the Power consumption.

  • PDF

Design and Configuration of Reconfigurable ATM Networks with Unreliable Links

  • Lee, Jong-Hyup
    • ETRI Journal
    • /
    • 제21권4호
    • /
    • pp.9-22
    • /
    • 1999
  • This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.

  • PDF

군집지능과 모델개선기법을 이용한 구조물의 결함탐지 (Structural Damage Detection Using Swarm Intelligence and Model Updating Technique)

  • 최종헌;고봉환
    • 한국소음진동공학회논문집
    • /
    • 제19권9호
    • /
    • pp.884-891
    • /
    • 2009
  • This study investigates some of swarm intelligence algorithms to tackle a traditional damage detection problem having stiffness degradation or damage in mechanical structures. Particle swarm(PSO) and ant colony optimization(ACO) methods have been exploited for localizing and estimating the location and extent damages in a structure. Both PSO and ACO are population-based, stochastic algorithms that have been developed from the underlying concept of swarm intelligence and search heuristic. A finite element (FE) model updating is implemented to minimize the difference in a set of natural frequencies between measured and baseline vibration data. Stiffness loss of certain elements is considered to simulate structural damages in the FE model. It is numerically shown that PSO and ACO algorithms successfully completed the optimization process of model updating in locating unknown damages in a truss structure.

RC tree의 지연시간 예측 (RC Tree Delay Estimation)

  • 유승주;최기영
    • 전자공학회논문지A
    • /
    • 제32A권12호
    • /
    • pp.209-219
    • /
    • 1995
  • As a new algorithm for RC tree delay estimation, we propose a $\tau$-model of the driver and a moment propagation method. The $\tau$-model represents the driver as a Thevenin equivalent circuit which has a one-time-constant voltage source and a linear resistor. The new driver model estimates the input voltage waveform applied to the RC more accurately than the k-factor model or the 2-piece waveform model. Compared with Elmore method, which is a lst-order approximation, the moment propagation method, which uses $\pi$-model loads to calculate the moments of the voltage waveform on each node of RC trees, gives more accurate results by performing higher-order approximations with the same simple tree walking algorithm. In addition, for the instability problem which is common to all the approximation methods using the moment matching technique, we propose a heuristic method which guarantees a stable and accureate 2nd order approximation. The proposed driver model and the moment propagation method give an accureacy close to SPICE results and more than 1000 times speedup over circuit level simulations for RC trees and FPGA interconnects in which the interconnect delay is dominant.

  • PDF

요격미사일 배치문제에 대한 하이브리드 유전알고리듬 적용방법 연구 (An Application of a Hybrid Genetic Algorithm on Missile Interceptor Allocation Problem)

  • 한현진
    • 한국국방경영분석학회지
    • /
    • 제35권3호
    • /
    • pp.47-59
    • /
    • 2009
  • A hybrid Genetic Algorithm is applied to military resource allocation problem. Since military uses many resources in order to maximize its ability, optimization technique has been widely used for analysing resource allocation problem. However, most of the military resource allocation problems are too complicate to solve through the traditional operations research solution tools. Recent innovation in computer technology from the academy makes it possible to apply heuristic approach such as Genetic Algorithm(GA), Simulated Annealing(SA) and Tabu Search(TS) to combinatorial problems which were not addressed by previous operations research tools. In this study, a hybrid Genetic Algorithm which reinforces GA by applying local search algorithm is introduced in order to address military optimization problem. The computational result of hybrid Genetic Algorithm on Missile Interceptor Allocation problem demonstrates its efficiency by comparing its result with that of a simple Genetic Algorithm.

패밀리 셋업이 존재하는 병렬기계 일정계획 수립 (Scheduling for Parallel Machines with Family Setup Times)

  • 권익현;신현준;엄동환;김성식
    • 한국경영과학회지
    • /
    • 제30권1호
    • /
    • pp.27-41
    • /
    • 2005
  • This paper considers identical parallel machine scheduling problem. Each job has a processing time. due date. weight and family type. If a different type of job is followed by prior job. a family setup is incurred. A two phased heuristic is presented for minimizing the sum of weighted tardiness. In the first phase. using roiling horizon technique. group each job into same family and schedule each family. In the second phase. assign each job to machines using schedule obtained in the first phase. Extensive computational experiments and comparisons among other algorithms are carried out to show the efficiency of the proposed algorithm.

개미 시스템 알고리듬을 이용한 윤곽선 검출 (Edge Detection Using an Ant System Algorithm)

  • 이성열;이창훈
    • 한국산업정보학회논문지
    • /
    • 제8권4호
    • /
    • pp.38-45
    • /
    • 2003
  • 메타 휴리스틱의 한 기법인 Ant System (AS) 알고리듬을 윤곽선 검출 문제에 적용하고 그 실험 결과를 보여준다. 윤곽선의 품질을 픽셀영역간 불일치 정도, 연속성, 두께 및 길이의 관점에서 규정지었다. 적합도 함수를 윤곽선 경로비용 최소화 문제로 전환하여 최적해를 탐색하였다. 예제 영상 실험결과 기존의 다른 기법에 비해, 영상의 질에 무관하게 상대적으로 신속하게 적은 메모리를 차지하는 즉, 최소량의 픽셀로 구성된 윤곽선을 검출할 수 있었다.

  • PDF

순환적 부분트리 탐색법을 이용한 중부하 배전계통의 손실최소화 (Loss Reduction in Heavy Loaded Distribution Networks Using Cyclic Sub Tree Search)

  • 최상열;신명철
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제50권5호
    • /
    • pp.241-247
    • /
    • 2001
  • Network reconfiguration in distribution systems is realized by changing the status of sectionalizing switches, and is usually done for loss reduction of load balancing in the system. This paper presents an effective heuristic based switching scheme to solve the distribution feeder loss reduction problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to apply a proposed technique called cyclic best first search. the proposed algorithm identify the most effective the set of switch status configuration of distribution system for loss reduction. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the 32, 69 bus system models.

  • PDF