• Title/Summary/Keyword: problem in operation

Search Result 3,497, Processing Time 0.03 seconds

Expert System On Advanced load shedding (개선된 부하차단에 관한 전문가 시스템)

  • Kim, Jae-Chul;Kim, Eung-Sang;You, Mi-Bog
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.354-357
    • /
    • 1991
  • In the case of system operation, a line overload cause damage to spread an whole range of power system. Of the theorems on load shedding, this study applied power distribution theorem and load reduction theorem which are local load shedding method, which are not affected by the magnitude of the power system and need not a large memory capacity and computation time. In this paper, we treat the problem of overload when power system occurred to fatal fault. Especially, there is the special case that local load shedding theorem is not always solved. Therefore, we introduce a solved device of the problem and construct the expert system of expanded local load shedding. Because proposed method uses the merits of expert system, in the case of system operation, the system operator don't embarrass to fatal fault and promptly deals with.

  • PDF

Design of Integrated Database Program for Optimal Operation of Distribution Automation System (배전지능화시스템 최적 운영을 위한 통합 데이터베이스 프로그램 설계)

  • Choi, Yun-Hyuk;Jang, Moon-Jong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.8
    • /
    • pp.987-993
    • /
    • 2018
  • In the existing distribution automation system, the database is managed by each distribution office. But there is a high possibility to happened a problem during a fault processing because the representation of the connection switches between distribution offices are complicated. In addition, if a distribution office will be going to collapse due to disaster, for example, a big fire or earthquake, its own database may be lost. In order to solve this problem, it is necessary to have a structure of an integrated database management from an integration center to under the distribution office. To do this, the integration center must store and manage it as the database using the own office code.

Impact of Periodic Channel Scanning on the TCP Throughput in a WLAN (무선랜에서 주기적인 채널탐색이 TCP 처리율에 미치는 영향)

  • Hwang, Jaeryong;Choi, Jaehyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.1
    • /
    • pp.107-109
    • /
    • 2016
  • In this paper, we address the TCP-over-WLAN performance problem that occurs during periodic active background scanning with which mobile devices discover available APs in the vicinity. We measure the impact of the scanning period on the TCP throughput and observe a significant performance degradation when the scan operation period is shortened. Our experimental analysis has identified the main cause of the problem, that is, the associated AP continues to send packets to the mobile device even when the device is not able to receive due to the scanning operation.

Development of Real-Time Decision Support System for the Efficient Berth Operation of Inchon Port (인천항의 효율적 선석운영을 위한 실시간 의사결정지원시스템 구축)

  • 유재성
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1998.10a
    • /
    • pp.12-16
    • /
    • 1998
  • The purpose of this paper is to develop a knowledge-based real-time decision support system to support decision makers for efficient berth operation of Inchon Port. In these days, the efficient berth operation has been many studied. The berth operation rules differ from port to port and the problem is highly dependent on natural, geographical and operational environment of port. In Inchon Port, the ship's entrance into port and departure from port is extremely affected by the status of dock and berth because of capacity restriction. First, we analyzed the specific characteristics of Inchon Port such as dock based on the data of 1997. And then, we construct the database of experts knowledge for berth utilization. Finally, we build the real-time decision support system for the efficient berth operation of Inchon Port to make the better berth allocation in case of not only regular scheduling but also dynamic scheduling such as delay in berth operation and exchange of ship between berths. The DSS is developed with graphic user interface(GUI) concept to help the user determining user interactive updating of the port status. Then this DSS will be provide decision maker with an efficient and fast way to berth allocation, and reduce wastes of time, space, and manpower in Inchon Port operation.

  • PDF

Study on the Optimal Location of Low Altitude Air Defense Radar (저고도 방공 레이더 최적 배치에 관한 연구)

  • Baek, Kyung-Hyoek;Lee, Youngwoo;Jang, Hoon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.17 no.2
    • /
    • pp.248-257
    • /
    • 2014
  • As observed in the recent war, suppression of enemy air defense operation is one of the major tactics, simultaneously conducted with high payoff target. Specifically, our air defense operation should be properly constructed, since the operating environment of our forces mostly consists with mountainous terrain, which makes detections of the enemy difficult. The effective arrangements of low altitude air defense radars can be suggested as a way of improving the detection capability of our forces. In this paper, we consider the location problem of low altitude air defense radar, and formulate it as an Integer Programming. Specifically, we surveyed the previous researches on facility location problems and applied two particularly relevant models(MCLP, MEXCLP) to our problem. The terrain factor was represented as demand points in the models. We verified the optimal radar locations for operational situations through simulation model which depicts simple battle field. In the simulation model, the performance of optimal radar locations are measured by the enemy detection rate. With a series of experiments, we may conclude that when locating low altitude air defense radars, it is important to consider the detection probability of radar. We expect that this finding may be helpful to make a more effective air defense plan.

Priority Scheduling for a Flexible Job Shop with a Reconfigurable Manufacturing Cell

  • Doh, Hyoung-Ho;Yu, Jae-Min;Kwon, Yong-Ju;Lee, Dong-Ho;Suh, Min-Suk
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.1
    • /
    • pp.11-18
    • /
    • 2016
  • This paper considers a scheduling problem in a flexible job shop with a reconfigurable manufacturing cell. The flexible job shop has both operation and routing flexibilities, which can be represented in the form of a multiple process plan, i.e. each part can be processed through alternative operations, each of which can be processed on alternative machines. The scheduling problem has three decision variables: (a) selecting operation/machine pairs for each part; (b) sequencing of parts to be fed into the reconfigurable manufacturing cell; and (c) sequencing of the parts assigned to each machine. Due to the reconfigurable manufacturing cell's ability of adjusting the capacity, functionality and flexibility to the desired levels, the priority scheduling approach is proposed in which the three decisions are made at the same time by combining operation/machine selection rules, input sequencing rules and part sequencing rules. To show the performances of various rule combinations, simulation experiments were done on various instances generated randomly using the experiences of the manufacturing experts, and the results are reported for the objectives of minimizing makespan, mean flow time and mean tardiness, respectively.

Multi-Agent based Distribution Protection Coordination Algorithm (Multi-Agent 기반의 배전계통 보호협조 알고리즘)

  • Lim, Il-Hyung;Choi, Myeon-Song;Lee, Seung-Jae
    • Proceedings of the KIEE Conference
    • /
    • 2009.07a
    • /
    • pp.4_5
    • /
    • 2009
  • A new protection coordination algorithm in Multi-Agent based distribution automation system is proposed in this paper. Distribution network protection coordination is acted by normal state distribution operation. But, in more and more complex distribution network structure, it has a big problem that central server processed all measurement data, coordination setting and controls for operation. So, a algorithm to change coordination setting is proposed automatically in terminal devices which Recloser and OCR to include Multi-Agent concepts in distribution network.

  • PDF

Machine Repair Problem in Multistage Systems (직렬시스템의 수리 및 예비품 지원정책에 관한 연구)

  • Park, Young-Taek
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.15 no.2
    • /
    • pp.93-101
    • /
    • 1989
  • The classic machine repair problem is extended to the case where a number of different machines are arranged in the sequence of operation. The steady-state availability of the system with a series of operating machines is maximized under some constraints such as total cost, available space. In order to find the optimal numbers of spare units and repair channels for each operating machine, the problem is formulated as non-linear integer programming(NLIP) problem and an efficient algorithm, which is a natural extension of the new Lawler-Bell algorithm of Sasaki et al., is used to solve the NLIP problem. A numerical example is given to illustrate the algorithm.

  • PDF

Near-OptimaI Collision Avoidance Maneuvers for UAV

  • Han, Su-Cheol;Bang, Hyo-choong
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.5 no.2
    • /
    • pp.43-53
    • /
    • 2004
  • Collision avoidance for multiple aircraft can be stated as a problem ofmaintaining safe distance between aircraft in conflict. Optimal collision avoidanceproblem seeks to minimize the given cost function while simultaneously satisfyingconstraints. The cost function could be a function of time or control input. This paper addresses the trajectory time-optimization problem for collision avoidance of unmanned aerial vehicles(UAVs). The problem is difficult to handle in general due to the two-point boundary value problem subject to dynamic environments. Some simplifying aleorithms are used for potential applications in on-line operation.Although under possibility of more complicated problems, a dynamic problem is transformed into a static one by prediction of the conflict time and some appropriate assumptions.

An Approach for Optimal Dispatch Scheduling Incorporating Transmission Security Constraints (송전계통 안전도 제약조건을 반영한 급전계획 알고리즘 개발에 관한 연구)

  • Chung, Koo-Hyung;Kim, Bal-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.12
    • /
    • pp.597-602
    • /
    • 2005
  • The introduction of competition in electricity market emphasizes the importance of sufficient transmission capacities to guarantee various electricity transactions. Therefore, when dispatch scheduling, transmission security constraints should be considered for the economic and stable electric power system operation. In this paper, we propose an optimal dispatch scheduling algorithm incorporating transmission security constraints. For solving these constraints, the dispatch scheduling problem is decomposed into a master problem to calculate a general optimal power flow (OPF) without transmission security constraints and several subproblems to inspect the feasibility of OPF solution under various transmission line contingencies. If a dispatch schedule given by the master problem violates transmission security constraints, then an additional constraint is imposed to the master problem. Through these iteration processes between the master problem and subproblems, an optimal dispatch schedule reflecting the post-contingency rescheduling is derived. Moreover, since interruptible loads can positively participate as generators in the competitive electricity market, we consider these interruptible loads active control variables. Numerical example demonstrates efficiency of the proposed algorithm.