• Title/Summary/Keyword: reconfiguration problems

Search Result 53, Processing Time 0.026 seconds

Optimal Configuration of Distribution Network using Genetic Algorithms

  • Kim, Intaek;Wonhyuk Cho
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.625-628
    • /
    • 1998
  • This paper presents an application of genetic algorithms(GAs) for optimal configuration of distribution network. Three problems have been used to show how genetic algorithms are modified and applied. Solutions to the problems are found by minimizing the cost function which is directly related with balancing the loads. Simulation results show that genetic algorithms are technically feasible if they are tailored to meet the needs of real problems.

  • PDF

NETWORK RECONFIGURATION ALGORITHM FOR AUTOMATED DISTRIBUTION SYSTEM BASED ON THE BEST-FIRST TREE SEARCH (경험적 탐색기법에 근거한 배전계통의 선로 재구성 앨고리즘)

  • Jung, Kyung-Hee;Kim, Ho-Yong;Ko, Yun-Seok
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.350-353
    • /
    • 1991
  • This study develops an expert system which solves the problems of the MTr/feeder overloads and the feeder constraints in automated radial distribution systems. Then, the objective is to perform the network reconfiguration by switching the tie and sectionalizing switches which eliminates the system violation, while achieving the load balance of the MTrs/feeders. To reduce the search space, an expert system based on heuristic rules is presented, and implemented in AI language Prolog. This system adopts the best-first tree search technique. The computational results are also prepared to show the performance of the heuristic algorithm developed.

  • PDF

Virtual Path Routing Optimization in ATM Network (ATM 망의 가상경로 루팅 최적화)

  • 박구현
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.20 no.1
    • /
    • pp.35-54
    • /
    • 1995
  • Routing in ATM network is set up by combination of both virtual path routing and virtual channel routing. While virtual channel is similar concept to virtual circuit of data networks, virtual path is a special concept which is not used in traditional data networks. Virtual path can rearrange in structure and size by simply changing virtual path routing tables and giving the network the capability to eash allocate network resources according to the demand needs. This paper provides reconfiguration models of virtual path network which give the bandwidth of link and the routing path for each traffic class. The reconfiguration models are network optimization problems of multicommodity network flow type. The numerical examples are also included.

  • PDF

Implementation of RRS-based Base station Communication platform using General-Purpose DSP (범용 DSP를 이용한 RRS 기반 기지국 통신 플랫폼 구현)

  • Kim, Hoil;Ahn, Heungseop;Choi, Seungwon
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.14 no.4
    • /
    • pp.87-92
    • /
    • 2018
  • One of the problems with the base station equipment is that there is a large difference between the replacement time of the hardware equipment such as the base station equipment and the radio access equipment, and the evolution period of the communication standard. Therefore, the base station communication platform must be flexible enough to handle the evolving communication standards after purchase. Recent research on reconfigurable communications platforms has focused on the efficient architecture of the communications platform to meet these requirements through software downloads while still using existing hardware. This paper presents a prototype of a base station communications platform based on the ETSI standard reconfigurable architecture. The communication platform presented in this paper is implemented as an ETSI standard reconfigurable architecture using a general-purpose DSP (Digital Signal Processor). In the implemented prototype, we verify the real-time feasibility of communication protocol updates through software reconfiguration.

A Study on Enhancement Method of Hosting Capacity for PV System Based on Primary Feeder Reconfiguration (배전선로 절체에 의한 태양광전원의 수용성 향상방안에 관한 연구)

  • Lee, Myung-Geun;Lee, Hu-Dong;Ferreira, Marito;Park, Ji-Hyun;Tae, Dong-Hyun;Rho, Dae-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.11
    • /
    • pp.239-249
    • /
    • 2019
  • Recently, the Korean government has implemented a policy to expand renewable energy sources. Large-scale PV systems are being actively interconnected with the distribution system. On the other hand, when a large-scale PV system is installed and operated, the customer voltages could violate the allowable voltage limit due to reverse power flow of the PV system. To overcome these problems, an enhancement method for hosting the capacity of the PV system in a distribution system is being actively conducted. Therefore, to improve the hosting capacity of the PV system, this paper proposes a model of a reconfiguration of the distribution system, which is composed of three sections and three connections based on PSCAD/EMTDC S/W, and proposes an evaluation algorithm for the feeder reconfiguration to maximize an adaption of the PV system. In addition, this paper presents the optimal method of the feeder reconfiguration section to evaluate the maximum capacity of the PV system to keep customer voltages within the allowable voltage limits based on various operation scenarios, such as the capacity of a PV system and section of feeder reconfiguration. From the simulation results based on the PSCAD/EMTDC modeling and evaluation algorithm, it was confirmed that they are a useful and practical tool to enhance hosting the capacity of a PV system in a distribution system.

An Automated Code Generation for Dynamic reconfiguration based on Goal-Scenario (목표 시나리오 기반의 동적 재구성을 위한 코드 자동 생성 기법)

  • Baek, Su-Jin;Sim, Sung-Ho;Song, Young-Jae
    • Journal of Digital Convergence
    • /
    • v.10 no.1
    • /
    • pp.349-355
    • /
    • 2012
  • Today, the computing environments is very complex, so researches that endow a system with the self-healing's ability that recognizes problem arising in a target system are being an important issues. However, the existing methodology, the goal for the new requirements for self-healing system developers to model and analyze the constraints that must be greater efforts. Therefore, in this paper are aware of problems detected by the system to solve the problem is the analysis of goal-based scenarios. In addition, there is a pre and post applying a strategy to be dynamically reconfigured to show you how to self-healing. These proposed new requirements for methodology, self-healing reduces the load on the developer's analysis.

Dynamic Cell Reconfiguration Framework for Energy Conservation in Cellular Wireless Networks

  • Son, Kyuho;Guruprasad, Ranjini;Nagaraj, Santosh;Sarkar, Mahasweta;Dey, Sujit
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.567-579
    • /
    • 2016
  • Several energy saving techniques in cellular wireless networks such as active base station (BS) selection, transmit power budget adaptation and user association have been studied independently or only part of these aspects have been considered together in literature. In this paper, we jointly tackle these three problems and propose an integrated framework, called dynamic cell reconfiguration (DCR). It manages three techniques operating on different time scales for ultimate energy conservation while guaranteeing the quality of service (QoS) level of users. Extensive simulations under various configurations, including the real dataset of BS topology and utilization, demonstrate that the proposed DCR can achieve the performance close to an optimal exhaustive search. Compared to the conventional static scheme where all BSs are always turned on with their maximum transmit powers, DCR can significantly reduce energy consumption, e.g., more than 30% and 50% savings in uniform and non-uniform traffic distribution, respectively.

Effects of REBT Program Application for the Changes in Maladaptive Thoughts among Female Junior Tennis Players (청소년 여자테니스 선수의 부적응적 사고 변화를 위한 합리적 인지재구성 프로그램 적용효과)

  • Ha, Jisun;Chang, Duksun
    • Journal of Digital Convergence
    • /
    • v.15 no.12
    • /
    • pp.591-604
    • /
    • 2017
  • The purpose of this study was to develop and evaluate the program for convericient reconfiguration in an attempt to change maladjustmental way of thinking among female junior tennis players. For verification of the program, a qualitative analysis and quantitative analysis were carried out. Through the REBT program for convericient reconfiguration, maladjustmental way of thinking among junior tennis players was drawed and interviews with them were subsequently performed. As a result, REBT counseling technique was applied to understand personal psychological problems and to transform maladjustmental and unreasonable way of thinking into rational belief, confirming positivity toward their situation. After all, their athletic performance as well as holistic development was found to be improved. In quantitative analysis, maladaptive thinking scale sports psychology questionnaire and survey for Korean sports performance strategy were both increased post treatment, suggesting that their psychological status became positive as a result of application of psychological prevention. The results of this study showed that athletic performance would be enhanced and growth and development in personality and self-realization would be expected if various psychological problems in adolescent players were progressed in detailed.

A Geographical Study on the Behavior Changes of Telemedicine Participants in Terms of Time and Space (시공간 관점에서 본 원격진료 이용자 행태 변화에 관한 연구)

  • Park, Sookyung;Hanashima, Yuki
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.16 no.2
    • /
    • pp.198-217
    • /
    • 2013
  • This research aims to examine the behavior changes of telemedicine participants with regard to time-space reconfiguration and to address the implications of telemedicine in terms of extensibility and restrictions (ambilaterality). According to the results of this research, telemedicine can lead to behavior changes in telemedicine participants, particularly patients. However, it is difficult to anticipate the time-space reconfiguration of telemedicine participants drastically. In other words, although telemedicine minimizes patients' burden of accessibility to and utilization of medical institutions, it requires the patients to visit medical institutions at least once due to the restricted application of telemedicine related to technological problems, the characteristics of medical practice and mutual stakes among the medical institutions involved in telemedicine. And physicians (telemedicine providers as mediators between medical specialists and patients) and medical specialists (as the ultimate telemedicine providers) do not evidence considerable changes in their behaviors, except for offline meetings for information sharing and medical training. Because the present telemedicine system does not require simultaneity between physicians, patients and medical specialists. Furthermore, present telemedicine operation is absorbed into existing medical activities as a health care delivery method. These phenomena are due to 1) the interests among medical institutions and the limitation or generalization of telemedicine technologies to stimulate regional-based telemedicine operation and 2) the goal of face-to-face interactions between patients and doctors, which is to avoid misdiagnosis and side effects. Finally, medical activities related to telemedicine do not differ from general medical activities. The ambilaterality of telemedicine in terms of extensibility and the restriction of time-space reconfiguration is an unsettled problem in the ICT technologies of medical services.

  • PDF

Large-scale Nonseparabel Convex Optimization:Smooth Case (대규모 비분리 콘벡스 최적화 - 미분가능한 경우)

  • 박구현;신용식
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.1
    • /
    • pp.1-17
    • /
    • 1996
  • There have been considerable researches for solving large-scale separable convex optimization ptoblems. In this paper we present a method for large-scale nonseparable smooth convex optimization problems with block-angular linear constraints. One of them is occurred in reconfiguration of the virtual path network which finds the routing path and assigns the bandwidth of the path for each traffic class in ATM (Asynchronous Transfer Mode) network [1]. The solution is approximated by solving a sequence of the block-angular structured separable quadratic programming problems. Bundle-based decomposition method [10, 11, 12]is applied to each large-scale separable quadratic programming problem. We implement the method and present some computational experiences.

  • PDF