نتایج جستجو برای: unit commitment uc

تعداد نتایج: 442262  

2014
Qipeng P. Zheng Jianhui Wang Andrew L. Liu

Optimization models have been widely used in the power industry to aid the decision-making process of scheduling and dispatching electric power generation resources, a process known as unit commitment (UC). Since UC’s birth, there have been two major waves of revolution on UC research and real life practice. The first wave has made mixed integer programming stand out from the early solution and...

Journal: :journal of artificial intelligence in electrical engineering 2014
vahid mansouri mohammad esmaeil akbari

review and classification of electric load forecasting (lf) techniques based on artificial neuralnetworks (ann) is presented. a basic anns architectures used in lf reviewed. a wide range of annoriented applications for forecasting are given in the literature. these are classified into five groups:(1) anns in short-term lf, (2) anns in mid-term lf, (3) anns in long-term lf, (4) hybrid anns inlf,...

2015
R. Effatnejad H. Hosseini H. Ramezani

This article presents a Harmony Search Algorithm to solve the unit commitment (UC) problem. A micro grid includes various types of smart distributed generators, renewable generators, storage devices and controllable load. A micro grid must satisfy its local needs and should be under the hierarchical control of management system. Due to this combination of conventional and renewable sources, the...

2016
V. Vasudevan P. Aravindhababu

The impact of human activities on the environment as a consequence of the industrialization process, the rising trend of the price of fossil fuels, and the incentives offered by governments in many countries have driven the development and evolution of renewable energy sources such as wind energy. The optimal selection of on-line units and optimal output levels of committed units for convention...

2014
Eiichiro Fujisaki

We present a general framework for constructing non-interactive universally composable (UC) commitment schemes that are secure against adaptive adversaries in the non-erasure model under a re-usable common reference string. Previously, such “fully-equipped” UC commitment schemes have been known only in [CF01,CLOS02], with strict expansion factor O(κ); meaning that to commit λ bits, communicatio...

2013
Ivan Damgård Alessandra Scafuro

We present a constant-round unconditional black-box compiler, that transforms any ideal straightline extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to UC-security [Can01]. We exemplify the usefulness of our compiler providing two (constantround) instantiations of ideal straight-line extractable commitment using (malicious) PUFs [OSVW13] an...

2011
R LAL RAJA SINGH

Unit Commitment Problem (UCP) is a nonlinear mixed integer optimization problem used in the scheduling operation of power system generating units subjected to demand and reserve requirement constraints for achieving minimum operating cost. The task of the UC problem is to determine the on/off state of the generating units at every hour interval of the planning period for optimally transmitting ...

2015
G. M. Casolino G. Liuzzi A. Losi

For Generation Companies (GENCOs) one of the most relevant issue is the commitment of the units, the scheduling of them over a daily (or longer) time frame, with the aim of obtaining the best profit. It strongly depends on the plant operational generation costs, which depend in turn on the choices taken at the design stage; it follows that design technical choices should also aim at determining...

2012
S. Najafi

Large scale power systems Unit Commitment (UC) is a complicated, hard limit, mixed integer combinatorial and nonlinear optimization problem with many constraints. This paper presents an innovative and effective solution based on modification of the Harmony Search (HS) Algorithm to solve the strategic planning of Generating unit's commitment. The proposed algorithm is easy in application compare...

2014
A. Azeezur Rahman

In this paper, BAT Algorithm is proposed to solve thermal unit commitment (UC) problem. The objective of UC is to determine the optimal generation of the committed units to meet the load demand and spinning reserve at each time interval, such that the overall cost of generation is minimized, while satisfying different operational constraints. BAT is a new cooperative agents approach, which is i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->