• Title/Summary/Keyword: optimal placement

Search Result 368, Processing Time 0.023 seconds

Optimal Placement of Distributed Generators in Radial Distribution System for Reducing the Effect of Islanding

  • K, Narayanan.;Siddiqui, Shahbaz A.;Fozdar, Manoj
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.3
    • /
    • pp.551-559
    • /
    • 2016
  • The present trend of increasing the penetration levels of Distributed Generator (DG) in the distribution network has made the issue of Islanding crucial for the reliable operation of the network. The islanding, if not detected early may lead to the collapse of the system as it can drive the distribution system to the cascaded failure. In this paper, an extensive study of the effect of DG placement and sizing is performed by dividing the system into different zones to obtain a reduced effect of islanding. The siting and sizing of DG is carried out to improve the overall voltage profile or/and reduction in active power loss using two stage Genetic Algorithm (GA). In the first stage a basic knockout selection is considered and the best population is taken for next stage, where roulette selection for crossover and mutation is performed for optimal placement and sizing of DGs. The effect of the islanding, due to load variations is reduced by optimal siting and sizing of DG. The effectiveness of the proposed scheme is tested on the IEEE 33 and 69 radial bus systems and the results obtained are promising.

Joint disturbance torque analysis for independent joint controlled robots and its application in optimal path placement (독립관절제어 로봇의 관절외란해석과 최적경로위치 문제의 해법)

  • Choi, Myung-Hwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.3
    • /
    • pp.342-348
    • /
    • 1998
  • A majority of industrial robots are controlled by a simple joint servo control of joint actuators. In this type of control, the performance of control is greatly influenced by the joint interaction torques including Coriolis and centrifugal forces, which act as disturbance torques to the control system. As the speed of the robot increases, the effect of this disturbance torque increases, and hence makes the high speed - high precision control more difficult to achieve. In this paper, the joint disturbance torque of robots is analyzed. The joint disturbance torque is defined using the coefficients of dynamic equation of motion, and for the case of a 2 DOF planar robot, the conditions for the minimum and maximum joint disturbance torques are identified, and the effect of link parameters and joint variables on the joint disturbance torque are examined. Then, a solution to the optimal path placement problem is propose that minimizes the joint disturbance torque during a straight line motion. The proposed method is illustrated using computer simulation. The proposed solution method can be applied to a class of robots that are controlled by independent joint servo control, which includes the vast majority of industrial robots.

  • PDF

Multi-dimensional sensor placement optimization for Canton Tower focusing on application demands

  • Yi, Ting-Hua;Li, Hong-Nan;Wang, Xiang
    • Smart Structures and Systems
    • /
    • v.12 no.3_4
    • /
    • pp.235-250
    • /
    • 2013
  • Optimal sensor placement (OSP) technique plays a key role in the structural health monitoring (SHM) of large-scale structures. According to the mathematical background and implicit assumptions made in the triaxial effective independence (EfI) method, this paper presents a novel multi-dimensional OSP method for the Canton Tower focusing on application demands. In contrast to existing methods, the presented method renders the corresponding target mode shape partitions as linearly independent as possible and, at the same time, maintains the stability of the modal matrix in the iteration process. The modal assurance criterion (MAC), determinant of the Fisher Information Matrix (FIM) and condition number of the FIM have been taken as the optimal criteria, respectively, to demonstrate the feasibility and effectiveness of the proposed method. Numerical investigations suggest that the proposed method outperforms the original EfI method in all instances as expected, which is looked forward to be even more pronounced should it be used for other multi-dimensional optimization problems.

Optimal DG Placement in a Smart Distribution Grid Considering Economic Aspects

  • Buaklee, Wirote;Hongesombut, Komsan
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.4
    • /
    • pp.1240-1247
    • /
    • 2014
  • The applications of Distributed Generation (DG) in a smart distribution grid environment are widely employed especially for power balancing and supporting demand responses. Using these applications can have both positive and negative impacts on the distribution system. The sizing and location of their installations are the issues that should be taken into consideration to gain the maximum benefit from them when considering the economic aspects. This paper presents an application of the Bat Algorithm (BA) for the optimal sizing and siting of DG in a smart distribution power system in order to maximize the Benefit to Cost Ratio (BCR), subjected to system constraints including real and reactive power generation, line and transformer loading, voltage profile, energy losses, fault level as well as DG operating limits. To demonstrate the effectiveness of the proposed methodology and the impact of considering economic issues on DG placement, a simplify 9-bus radial distribution system of the Provincial Electricity Authority of Thailand (PEA) is selected for the computer simulation to explore the benefit of the optimal DG placement and the performance of the proposed approach.

Power System Enhanced Monitoring through Strategic PMU Placement Considering Degree of Criticality of Buses

  • Singh, Ajeet Kumar;Fozdar, Manoj
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.5
    • /
    • pp.1769-1777
    • /
    • 2018
  • This paper proposes a method for optimal placement of Phasor Measurement Units (PMUs) considering system configuration and its attributes during the planning phase of PMU deployment. Each bus of the system is assessed on four diverse attributes; namely, redundancy of measurements, rotor angle and frequency monitoring of generator buses, reactive power deficiency, and maximum loading limit under transmission line outage contingency, and a consolidated 'degree of criticality' is determined using Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). The major contribution of the proposed work is the development of modified objective function which incorporates values of the degree of criticality of buses. The problem is formulated as maximization of the aggregate degree of criticality of the system. The resultant PMU configuration extends complete observability of the system and majority of the PMUs are located on critical buses. As budgetary restrictions on utilities may not allow installation PMUs even at optimal locations in a single phase, multi-horizon deployment of PMUs is also addressed. The proposed approach is tested on IEEE 14-bus, IEEE 30-bus, New England (NE) 39-bus, IEEE 57-bus and IEEE 118-bus systems and compared with some existing methods.

A Study on the Automatic Placement and Routing System for Standard Cell (스텐다드 셀의 자동배치 배선시스템에 관한 연구)

  • 엄낙웅;강길순;박송배
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.6
    • /
    • pp.1049-1055
    • /
    • 1987
  • This paper describes a near-optimal standard cell layout strategy which consists of three consecutives steps` partition, placement, and routing. In the partition step, a given network is torn apart into many subnetworks such that each subnetworks contains as many cells as possible with minimum interocnnections between subnetwork. In the placement step, the conventional string placement algorithm was modified. Also, bonding pads were placed such that their connections to the related cells are shortest. As a result for the tested example, the placement time was saved by 60% and the total routing lengths were saved by more than 20% and substantial improvements in the number of feed-through cell and the track density were obtained. The layout program is coded in PASCAL and implemented on a VAX 11-750/UNIX computer.

  • PDF

Sensor Placement in Structural Vibration Control For the Performance of Modal Filter (모달필터 성능을 고려한 센서의 최적위치)

  • 황재혁;김준수;백승호
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1997.04a
    • /
    • pp.308-315
    • /
    • 1997
  • In this study, the effect of modal filter error on the vibration control characteristics of flexible structures is analyzed for IMSC(Independent Modal Space Control), and optimal sensor placement in the structural vibration control with consideration of performance of modal filter has been studied. An Lyapunov asymptotic stability condition has been derived, which depends on the magnitude of the modal filter errors. The extent of the response deviation of the closed-loop system is also derived and evaluated using operator techniques. A sensor placement technique has also been suggested to maximize the performance of the modal filter. It has been found by a series of simulation that the suggested sensor placement technique is very effective on the determination of the number and placement of sensors of modal filter in the structural vibration control.

  • PDF

Design and Implementation of a Genetic Algorithm for Optimal Placement (최적 배치를 위한 유전자 알고리즘의 설계와 구현)

  • 송호정;이범근
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.3
    • /
    • pp.42-48
    • /
    • 2002
  • Placement is an important step in the physical design of VLSI circuits. It is the problem of placing a set of circuit modules on a chip to optimize the circuit performance. The most popular algorithms for placement include the cluster growth, simulated annealing and integer linear programming. In this paper we propose a genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing by analyzing the results of each implementation.

  • PDF

Design and Implementation of a Adapted Genetic Algorithm for Circuit Placement (어댑티드 회로 배치 유전자 알고리즘의 설계와 구현)

  • Song, Ho-Jeong;Kim, Hyun-Gi
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.17 no.2
    • /
    • pp.13-20
    • /
    • 2021
  • Placement is a very important step in the VLSI physical design process. It is the problem of placing circuit modules to optimize the circuit performance and reliability of the circuit. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for circuit placement include the cluster growth, simulated annealing, integer linear programming and genetic algorithm. In this paper we propose a adapted genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of each implementation. As a result, it was found that the adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

Optimal sensor placement under uncertainties using a nondirective movement glowworm swarm optimization algorithm

  • Zhou, Guang-Dong;Yi, Ting-Hua;Zhang, Huan;Li, Hong-Nan
    • Smart Structures and Systems
    • /
    • v.16 no.2
    • /
    • pp.243-262
    • /
    • 2015
  • Optimal sensor placement (OSP) is a critical issue in construction and implementation of a sophisticated structural health monitoring (SHM) system. The uncertainties in the identified structural parameters based on the measured data may dramatically reduce the reliability of the condition evaluation results. In this paper, the information entropy, which provides an uncertainty metric for the identified structural parameters, is adopted as the performance measure for a sensor configuration, and the OSP problem is formulated as the multi-objective optimization problem of extracting the Pareto optimal sensor configurations that simultaneously minimize the appropriately defined information entropy indices. The nondirective movement glowworm swarm optimization (NMGSO) algorithm (based on the basic glowworm swarm optimization (GSO) algorithm) is proposed for identifying the effective Pareto optimal sensor configurations. The one-dimensional binary coding system is introduced to code the glowworms instead of the real vector coding method. The Hamming distance is employed to describe the divergence of different glowworms. The luciferin level of the glowworm is defined as a function of the rank value (RV) and the crowding distance (CD), which are deduced by non-dominated sorting. In addition, nondirective movement is developed to relocate the glowworms. A numerical simulation of a long-span suspension bridge is performed to demonstrate the effectiveness of the NMGSO algorithm. The results indicate that the NMGSO algorithm is capable of capturing the Pareto optimal sensor configurations with high accuracy and efficiency.