نتایج جستجو برای: security constraint unit commitment
تعداد نتایج: 676031 فیلتر نتایج به سال:
this paper proposes a novel technique for solving generation scheduling and ramp rate constrained unit commitment. a modified objective function associated with a new start-up cost term is introduced in this paper. the proposed method is used to solve generating scheduling problem satisfying srr, minimum up and down time as well as ramp rate constraints. two case studies are conducted to implem...
Background: This study is aimed to compare organizational commitment and intention to leave among employees in Teheran`s hospitals. Materials and Methods: In this survey 3 hospitals with different ownership`s type were examined included: A public hospital, a hospital owned by Social Security Organization, and a private hospital. The data were collected by distributing 450, questionnaires am...
Dynamic events in a multiagent environment can be a source of conflict. We model the network of inter-agent commitments as a constraint graph. Conflicts arise when an event prevents fulfillment of a commitment, resulting in an infeasible constraint graph. Constraint relaxation directed by a mediating agent is used to reconfigure the commitment graph. We investigate this general approach in the ...
By considering the security flaws in cryptographic hash functions, any commitment scheme designed straight through hash function usage in general terms is insecure. In this paper, we develop a general fuzzy commitment scheme called an ordinary fuzzy commitment scheme (OFCS), in which many fuzzy commitment schemes with variety complexity assumptions is constructed. The scheme is provably statist...
The unit commitment problem (UCP) is a nonlinear mixed-integer optimization problem, encountered as one of the toughest problems in power systems. The problem becomes even more complicated when dynamic power limit based ramp rate constraint is taken into account. Due to the inadequacy of deterministic methods in handling large-size instances of the UCP, various metaheuristics are being consider...
The advent of High Performance Computing (HPC) has provided the computational capacity required for power system operators (SO) to obtain solutions in the least time to highly-complex applications, i.e., Unit Commitment (UC). The UC problem, which attempts to schedule the least-cost combination of generating units to meet the load, is increasing in complexity and problem size due to deployments...
This paper demonstrates how a probabilistic criterion based on the full capacity outage probability distribution (e.g., LOLP) could be integrated into the unit commitment (UC) optimization using simple statistical approximation. While this provides a direct and computationally cheaper means as compared to a recently published approach to locating the globally optimal SR allocation (and associat...
In the deregulated electricity market, secure operation is an enduring concern of the independent system operator (ISO). For a secure and economical hourly generation schedule of the day ahead market, ISO executes the security constrained unit commitment (SCUC) problem. In this paper, a new formulation of SCUC problem, considering more practical constraints are presented. The proposed SCUC form...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید