• Title/Summary/Keyword: Additional Constraints

Search Result 241, Processing Time 0.021 seconds

An Approach to Optimal Dispatch Scheduling Incorporating Transmission Security Constraints

  • Chung, Koo-Hyung;Kang, Dong-Joo;Kim, Balho H.;Kim, Tai-Hoon;Oh, Tae-Kyoo
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.2
    • /
    • pp.199-206
    • /
    • 2008
  • The introduction of competition in electricity markets emphasizes the importance of sufficient transmission capacities to guarantee effective power transactions. Therefore, for the economic and stable electric power system operation, transmission security constrains should be incorporated into the dispatch scheduling problem. With the intent to solve this problem, we decompose a dispatch scheduling problem into a master problem(MP) and several subproblems(SPs) using Benders decomposition. The MP solves a general optimal power flow(OPF) problem while the SPs inspect the feasibility of OPF solution under respective transmission line contingencies. If a dispatch scheduling solution given by the MP violates transmission security constraints, then additional constraints corresponding to the violations are imposed to the MP. Through this iterative process between the MP and SPs, we derive an optimal dispatch schedule incorporating the post-contingency corrective rescheduling. In addition, we consider interruptible loads as active control variables since the interruptible loads can participate as generators in competitive electricity markets. Numerical examples demonstrate the efficiency of the proposed algorithm.

Gradient Optimized Gradient-Echo Gradient Moment Nulling Sequences for Flow Compensation of Brain Images

  • Jahng, Geon-Ho;Stephen Pickup
    • Investigative Magnetic Resonance Imaging
    • /
    • v.4 no.1
    • /
    • pp.20-26
    • /
    • 2000
  • Gradient moment nulling techniques require the introduction of an additional gradient on each axis for each order of motion correction to be applied. The additional gradients introduce new constraints on the sequence design and increase the demands on the gradient system. The purpose of this paper is to demonstrate techniques for optimization of gradient echo gradient moment nulling sequences within the constraints of the gradient hardware. Flow compensated pulse sequences were designed and implemented on a clinical magnetic resonance imaging system. The design of the gradient moment nulling sequences requires the solution of a linear system of equations. A Mathematica package was developed that interactively solves the gradient moment nulling problem. The package allows the physicist to specify the desired order of motion compensation and the duration of the gradients in the sequence with different gradient envelopes. The gradient echo sequences with first, second, and third order motion compensation were implemented with minimum echo time. The sequences were optimized to take full advantage of the capabilities of the gradient hardware. The sequences were used to generate images of phantoms and human brains. The optimized sequences were found to have better motion compensation than comparable standard sequences.

  • PDF

First-Come First-Served Airport Surface Movement Scheduling (항공기 지상 이동 선입 선처리 스케줄링)

  • Kang, Seon-Young;Park, Bae-Seon;Lee, Hak-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.1
    • /
    • pp.36-42
    • /
    • 2017
  • An airport surface movement scheduler using first-come first-served (FCFS) algorithm is developed to efficiently manage surface traffic in an airport. It is based on the previously developed traffic flow management scheduler. Link directionality and intersection processing, which are additional constraints for ground movement, are added to the scheduler. To verify each of additional constraints, several simulations were performed by making simple scenarios, and the results show that all constraints were satisfied. Also, a simulation was performed by making a scenario based on flight operation information system (FOIS) data which is real departure and arrival flight data of Jeju airport. To determine the practicality of the developed scheduler, we compare the actual average delay time with the average delay time calculated by the scheduler.

FUZZY TRANSPORTATION PROBLEM WITH ADDITIONAL CONSTRAINT IN DIFFERENT ENVIRONMENTS

  • BUVANESHWARI, T.K.;ANURADHA, D.
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.5_6
    • /
    • pp.933-947
    • /
    • 2022
  • In this research, we presented the type 2 fuzzy transportation problem with additional constraints and solved by our proposed genetic algorithm model, and the results are verified using the softwares, genetic algorithm tool in Matlab and Lingo. The goal of our approach is to minimize the cost in solving a transportation problem with an additional constraint (TPAC) using the genetic algorithm (GA) based type 2 fuzzy parameter. We reduced the type 2 fuzzy set (T2FS) into a type 1 fuzzy set (T1FS) using a critical value-based reduction method (CVRM). Also, we use the centroid method (CM) to obtain the corresponding crisp value for this reduced fuzzy set. To achieve the best solution, GA is applied to TPAC in type 2 fuzzy parameters. A real-life situation is considered to illustrate the method.

The Efficient Sensitivity Analysis on Statistical Moments and Probability Constraints in Robust Optimal Design (강건 최적설계에서 통계적 모멘트와 확률 제한조건에 대한 효율적인 민감도 해석)

  • Huh, Jae-Sung;Kwak, Byung-Man
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.32 no.1
    • /
    • pp.29-34
    • /
    • 2008
  • The efforts of reflecting the system's uncertainties in design step have been made and robust optimization or reliability-based design optimization are examples of the most famous methodologies. In their formulation, the mean and standard deviation of a performance function and constraints expressed by probability conditions are involved. Therefore, it is essential to effectively and accurately calculate them and, in addition, the sensitivity results are required to obtain when the nonlinear programming is utilized during optimization process. We aim to obtain the new and efficient sensitivity formulation, which is based on integral form, on statistical moments such as the mean and standard deviation, and probability constraints. It does not require the additional functional calculation when statistical moments and failure or satisfaction probabilities are already obtained at a design point. Moreover, some numerical examples have been calculated and compared with the exact solution or the results of Monte Carlo Simulation method. The results seem to be very satisfactory.

Combined time bound optimization of control, communication, and data processing for FSO-based 6G UAV aerial networks

  • Seo, Seungwoo;Ko, Da-Eun;Chung, Jong-Moon
    • ETRI Journal
    • /
    • v.42 no.5
    • /
    • pp.700-711
    • /
    • 2020
  • Because of the rapid increase of mobile traffic, flexible broadband supportive unmanned aerial vehicle (UAV)-based 6G mobile networks using free space optical (FSO) links have been recently proposed. Considering the advancements made in UAVs, big data processing, and artificial intelligence precision control technologies, the formation of an additional wireless network based on UAV aerial platforms to assist the existing fixed base stations of the mobile radio access network is considered a highly viable option in the near future. In this paper, a combined time bound optimization scheme is proposed that can adaptively satisfy the control and communication time constraints as well as the processing time constraints in FSO-based 6G UAV aerial networks. The proposed scheme controls the relation between the number of data flows, input data rate, number of worker nodes considering the time bounds, and the errors that occur during communication and data processing. The simulation results show that the proposed scheme is very effective in satisfying the time constraints for UAV control and radio access network services, even when errors in communication and data processing may occur.

Dynamic Survivable Routing for Shared Segment Protection

  • Tapolcai, Janos;Ho, Pin-Han
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.198-209
    • /
    • 2007
  • This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

A Mechanism of Finding QoS Satisfied Multi-Path in Wireless Sensor Networks

  • Kang, Yong-Hyeog
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.2
    • /
    • pp.37-44
    • /
    • 2017
  • Wireless sensor networks are composed of many wireless sensor nodes that are sensing the environments. These networks have many constraints that are resource constraints, wireless communication, self-construction, etc. But they have many applications that are monitoring environment, tracking the object, etc. In this paper, a mechanism of finding QoS Satisfied multi-path is proposed in wireless sensor networks. In order to satisfy the QoS requirement, the proposed mechanism extends the AODV protocol to find multiple paths from a source node to a destination node by using the additional AODV message types that are proposed. This mechanism will be used to support many QoS applications such as minimum delay time, the better reliability and the better throughput by using the QoS satisfied multi-path. Overheads of the proposed mechanism are evaluated using simulation, and it is showed that QoS satisfied multiple paths are found with a little more overhead than the AODV mechanism.

Control Method for State Constrained Control Systems: Dynamic Anti-Widup Based Approach (동적 와인드엎 방지법에 기초한 상태 제한이 존재하는 시스템의 제어 방법)

  • Park, Jong-Koo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.8
    • /
    • pp.672-681
    • /
    • 2000
  • Based on the dynamic anti-windup strategy a novel control methodology for state constrained control systems is presented. First a linear controller is designed for an open-loop stable plant to show a desirable nominal performance by ignoring state constraints. And then an additional dynamic compensator is introduced to preserve the nominal performance as closely as possible int he face of state constraints. This paper focuses on the second step under the assumption that a linear controller has already been designed appropriately by using an effective controller design method. By minimizing a reasonable performance index the dynamic compensator is derived explicitly which is expressed int he plant and controller parameters. the proposed method not only guarantees the total stability of the overall resulting systems but also provides desirable output performance because it solves the state-positioning problem completely.

  • PDF

A Study on the Shape Finding of Cable-Net Structures Introducing General Inverse Matrix (일반역행열(一般逆行列)을 이용(利用)한 케이블네트 구조물(構造物)의 형상결정에 관한 연구)

  • Sur, Sam-Uel;Lee, Jang-Bok
    • Journal of Korean Association for Spatial Structures
    • /
    • v.2 no.1 s.3
    • /
    • pp.75-84
    • /
    • 2002
  • In this study, the 'force density method' for shape finding of cable net structures is presented. This concept is based on the force-length ratios or force densities which are defined for each branch of the net structures. This method renders a simple linear 'analytical form finding' possible. If the free choice of the force densities is restricted by further condition, the linear method is extended to a nonlinear one. The nonlinear one can be applied to the detailed computation of networks. In this paper, the general inverse matrix is introduced to solve the nonlinear equilibrium equation including Jacobian matrix which is rectangular matrix. Several examples for linear and nonlinear analysis applied additional constraints are presented. It is shown that the force density method is suitable for form finding of cable net and the general inverse matrix can be applied to solve the nonlinear equation without Lagrangian factors.

  • PDF