• 제목/요약/키워드: heuristic rules

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

경험적 규칙을 이용한 배전계통의 재구성기법 (Distribution Feeder Reconfiguration Using Heuristic Rules)

  • 조시형;최병윤;우광방
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1991년도 하계학술대회 논문집
    • /
    • pp.363-365
    • /
    • 1991
  • This paper presents a method for feeder reconfiguration in order to operate distribution systems efficiently using heuristic rules. The reconfiguration method presented here not only eliminates various abnormal states but also achieves minimum power loss and optimum load balance of the distribution feeders under normal operating condition transfering loads from one feeder to anoter applying the experiences of the experts. To implement the method effectively, a best-first tree searching strategy based on heuristics is used to evaluate the various load transfer alternatives. The development of a rule-based system aimed at the reduction of the search space is presented as a means of implementing the best-first searching strategy. The results of the computer simulation of the above procedure are as follows; 1) achieving minimum power loss of the distribution feeder adopting the optimum load transfer alternative. 2) Enhencing system reliability and achieving load balance through rational allocation of the feeder loads.

  • PDF

765kV 변전소의 고장진단 전문가 시스템에 관한 연구 (A Study on the Fault Diagnosis Expert System for 765kV Substations)

  • 이흥재;강현재
    • 전기학회논문지
    • /
    • 제58권7호
    • /
    • pp.1276-1280
    • /
    • 2009
  • This paper presents a fault diagnosis expert system for 765kV substation. The proposed system includes the topology processor and intelligent alarm processing subsystems. This expert system estimates the fault section through the inference process using heuristic knowledge and the output of topology processor and intelligent alarm processing system. The rule-base of this expert system is composed of basic rules suggested by Korea Electric Power Corporation and heuristic rules. This expert system is developed using PROLOG language. Also, user friendly Graphic User Interface is developed using visual basic programming in the windows XP environment. The proposed expert system showed a promising performance through the several case studies.

코아제품의 생산일정계획 수립 사례연구 (A Case Study of Production Scheduling for Core Products)

  • 김봉진;김춘식
    • 한국산학기술학회논문지
    • /
    • 제4권3호
    • /
    • pp.252-256
    • /
    • 2003
  • 본 연구에서는 코아제품의 일정계획시스템을 개발한 사례연구를 다룬다. 각 제품의 납기를 준수하기 위하여 작업배정과 작업처리순서의 결정을 하는 일정계획 알고리즘과 일정계획시스템을 개발하였다. 개발된 일정계획시스템은 클라이언트/서버 환경에서 작동되며, 중요한 정보는 필요할 때마다 사용할 수 있도록 데이터베이스로 저장되었다. 대상업체에 대한 일정 계획시스템의 개발로 수작업의 배제, 생산계획과 관련된 업무처리시간의 단축, 재고량의 감축 둥과 같은 성과를 얻을 수 있었다.

  • PDF

경험적 룰에 의한 송전계통의 거리계전 방식 협조 (Heuristic rule-based coordination of Distance Relaying in Transmission System)

  • 이승재;이병철;윤상현;윤만철;이상옥
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1990년도 하계학술대회 논문집
    • /
    • pp.121-124
    • /
    • 1990
  • Distance relaying is one of the most commonly used protection schemes in the high voltage transmission systems. In this scheme, coordination between the primary and backup relays is very critical for the power system security. This paper reports an rule-based methodology for checking and correction of miscoordination problems in the distance relaying. Diagnosis rules achieving an accurate but simple checking have been developed through the geometric analysis of the impedance characteristics of the distance relays. Heuristic rules having the pratical power for miscoordination correction are suggested. The proposed method has proved very effective through the several case studies on the actual systems.

  • PDF

부품외주를 고려한 조립형 Flowshop 일정계획 해법 개선 (An Improvement of Algorithms for Assembly-type Flowshop Scheduling Problem with Outsourcing)

  • 윤상흠;전재호
    • 산업경영시스템학회지
    • /
    • 제31권2호
    • /
    • pp.80-93
    • /
    • 2008
  • This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent lead time but the other type is fabricated in-house. When both components for a job are prepared, the assembly operation for the job can be started. This problem had been proved to be NP-Complete, so branch-and-bound (B&B) and heuristic algorithms have already been developed. In this paper, we suggest other dominance rules, lowerbound and heutistic algorithms. Also, we develop a new B&B algorithm using these improved bound and dominance rules. The suggested heuristics and B&B algorithm are compared with existing algorithms on randomly-generated test problems.

통신채널 할당 최적화 규칙 (An Optimization Rule for Channel Assignment Problem (CAP))

  • 이상운
    • 한국컴퓨터정보학회논문지
    • /
    • 제18권6호
    • /
    • pp.37-45
    • /
    • 2013
  • 통신채널 최적 할당 문제는 아직까지 결정론적 규칙이 알려지지 않고 있어 비결정론적 방법인 휴리스틱 알고리즘으로 대부분 해를 구하고 있다. 본 논문은 통신채널 최적 할당 문제에 대해 결정론적 방법으로 채널 배정을 할 수 있음을 보인다. 채널 배정 규칙을 적용하여 필라델피아의 9개 사례에 대해 적용한 결과 최적해를 구하였다.

The FRTU-Based Intelligent Fault Location Determination Strategy in Ubiquitous Based Distribution Systems

  • Ko, Yun-Seok
    • Journal of Electrical Engineering and Technology
    • /
    • 제3권2호
    • /
    • pp.192-198
    • /
    • 2008
  • This paper proposes a FRTU-based intelligent fault distance determination strategy in which each FRTU is able to avoid multiple estimations and reduce the level of estimation error by utilizing heuristic rules driven by voltage and current information collected by 1:1 communication with other FRTUs from the same zone in a ubiquitous-based distribution system. In the proposed method, each FRTU, at first, determines a fault zone and a fault path on the faulted zone based on the proposed heuristic rules which use its current data and the voltage data of its neighboring FRTUs as input data. Next, it determines the fault distance from its position based on the fault current estimated from the current data of the neighboring FRTUs. Finally, in order to prove the effectiveness of the proposed method, the diverse fault cases are simulated in several positions of the typical distribution system using the EMTP.

Dempster-Shafer Theory를 이용한 스케듈링 휴리스틱선정 지식습득 (Knowledge Acquisition on Scheduling Heuristics Selection Using Dempster-Shafer Theory(DST))

  • Han, Jae-Min;Hwang, In-Soo
    • 지능정보연구
    • /
    • 제1권2호
    • /
    • pp.123-137
    • /
    • 1995
  • Most of solution methods in scheduling attempt to generate good solutions by either developing algorithms or heuristic rules. However, scheduling problems in the real world require considering more factors such as multiple objectives, different combinations of heuristic rules due to problem characteristics. In this respect, the traditional mathematical a, pp.oach showed limited performance so that new a, pp.oaches need to be developed. Expert system is one of them. When an expert system is developed for scheduling one of the most difficult processes faced could be knowledge acquisition on scheduling heuristics. In this paper we propose a method for the acquisition of knowledge on the selection of scheduling heuristics using Dempster-Shafer Theory(DST). We also show the examples in the multi-objectives environment.

  • PDF

휴리스틱 및 기계 학습을 응용한 엔진 모델의 보정 (ICALIB: A Heuristic and Machine Learning Approach to Engine Model Calibration)

  • Kwang Ryel Ryu
    • 전자공학회논문지B
    • /
    • 제30B권11호
    • /
    • pp.84-92
    • /
    • 1993
  • Calibration of Engine models is a painstaking process but very important for successful application to automotive industry problems. A combined heuristic and machine learning approach has therefore been adopted to improve the efficiency of model calibration. We developed an intelligent calibration program called ICALIB. It has been used on a daily basis for engine model applications, and has reduced the time required for model calibrations from many hours to a few minutes on average. In this paper, we describe the heuristic control strategies employed in ICALIB such as a hill-climbing search based on a state distance estimation function, incremental problem solution refinement by using a dynamic tolerance window, and calibration target parameter ordering for guiding the search. In addition, we present the application of amachine learning program called GID3*for automatic acquisition of heuristic rules for ordering target parameters.

  • PDF

휴리스틱 탐색기법에 근거한 철도입환진로의 자동결정전략 설계 (Strategies for the Automatic Decision of Railway Shunting Routes Based on the Heuristic Search Method)

  • 고윤석
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제52권5호
    • /
    • pp.283-289
    • /
    • 2003
  • This paper proposes an expert system which can determine automatically the shunting routes corresponding to the given shunting works by considering totally the train operating environments in the station. The expert system proposes the multiple shunting routes with priority of selection based on heuristic search strategy. Accordingly, system operator can select a shunting route with the safety and efficiency among the those shunting routes. The expert system consists of a main inference engine and a sub inference engine. The main inference engine determines the shunting routes with selection priority using the segment routes obtained from the sub inference engine. The heuristic rules are extracted from operating knowledges of the veteran route operator and station topology. It is implemented in C computer language for the purpose of the implementation of the inference engine using the dynamic memory allocation technique. And, the validity of the builted expert system is proved by a test case for the model station.