• Title/Summary/Keyword: Short-term Scheduling

Search Result 68, Processing Time 0.024 seconds

Evaluation of Ramping Capability for Day-ahead Unit Commitment considering Wind Power Variability (풍력발전의 변동성을 고려한 기동정지계획에서의 적정 Ramping 용량 산정)

  • Lyu, Jae-Kun;Heo, Jae-Haeng;Park, Jong-Keun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.4
    • /
    • pp.457-466
    • /
    • 2013
  • Wind energy is rapidly becoming significant generating technologies in electricity markets. As probabilistic nature of wind energy creates many uncertainties in the short-term scheduling, additional actions for reliable market operation should be taken. This paper presents a novel approach to evaluate ramping capability requirement for changes in imbalance energy between day-ahead market and real-time market due to uncertainty of wind generation as well as system load. Dynamic ramp rate model has been applied for realistic solution in unit commitment problem, which is implemented in day-ahead market. Probabilistic optimal power flow has been used to verify ramping capability determined by the proposed method is reasonable in economic and reliable aspects. This approach was tested on six-bus system and IEEE 118-bus system with a wind farm. The results show that the proposed approach provides ramping capability information to meet both forecasted variability and desired confidence level of anticipated uncertainty.

Hybrid CSA optimization with seasonal RVR in traffic flow forecasting

  • Shen, Zhangguo;Wang, Wanliang;Shen, Qing;Li, Zechao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4887-4907
    • /
    • 2017
  • Accurate traffic flow forecasting is critical to the development and implementation of city intelligent transportation systems. Therefore, it is one of the most important components in the research of urban traffic scheduling. However, traffic flow forecasting involves a rather complex nonlinear data pattern, particularly during workday peak periods, and a lot of research has shown that traffic flow data reveals a seasonal trend. This paper proposes a new traffic flow forecasting model that combines seasonal relevance vector regression with the hybrid chaotic simulated annealing method (SRVRCSA). Additionally, a numerical example of traffic flow data from The Transportation Data Research Laboratory is used to elucidate the forecasting performance of the proposed SRVRCSA model. The forecasting results indicate that the proposed model yields more accurate forecasting results than the seasonal auto regressive integrated moving average (SARIMA), the double seasonal Holt-Winters exponential smoothing (DSHWES), and the relevance vector regression with hybrid Chaotic Simulated Annealing method (RVRCSA) models. The forecasting performance of RVRCSA with different kernel functions is also studied.

Developing a dynamic programming model for aircraft-engine maintenance scheduling (항공기 엔진 정비 일정 수립을 위한 동적 계획 모델 개발)

  • 주성종;신상헌
    • Korean Management Science Review
    • /
    • v.13 no.3
    • /
    • pp.163-172
    • /
    • 1996
  • According to flying hours, aircraft engines require regular overhaul for preventive maintenance. Because of hostile defense environment of Republic of Korea, the aircraft of republic of Korea Air Force(ROKAF) have been operated at the maximum level of availability and have similar overhaul schedule in several months. The concentration of overhaul schedule in a short period demands additional spare engines far exceeding the spare engines for corrective maintenance. If ROKAF decides to purchase extra engines for the preventive maintenance, the extra engines will be used only for the preventive maintenance and will be excess inventory for the most of aircraft life ccle. Also, the procurement of extra engines is significant investment for ROKAF. To help ROKAF schedule the preventive maintenance without significant spending, this study develops a dynamic programming model that is solvable using an integer programming algorithm. The model provides the number of engines that should be overhauled for a month for multiple periods under given constraints. ROKAF actually used this model to solve a T-59 engine overhaul problem and saved about three billion won at one time. ROKAF plans to use this model continuously for T-59 and other weapon systems. Thus, saving for long term will be significant to ROKAF. Finally, with minor modification, this model can be applied to deciding the minimum number of spare engines for preventive maintenance.

  • PDF

A LSTM Based Method for Photovoltaic Power Prediction in Peak Times Without Future Meteorological Information (미래 기상정보를 사용하지 않는 LSTM 기반의 피크시간 태양광 발전량 예측 기법)

  • Lee, Donghun;Kim, Kwanho
    • The Journal of Society for e-Business Studies
    • /
    • v.24 no.4
    • /
    • pp.119-133
    • /
    • 2019
  • Recently, the importance prediction of photovoltaic power (PV) is considered as an essential function for scheduling adjustments, deciding on storage size, and overall planning for stable operation of PV facility systems. In particular, since most of PV power is generated in peak time, PV power prediction in a peak time is required for the PV system operators that enable to maximize revenue and sustainable electricity quantity. Moreover, Prediction of the PV power output in peak time without meteorological information such as solar radiation, cloudiness, the temperature is considered a challenging problem because it has limitations that the PV power was predicted by using predicted uncertain meteorological information in a wide range of areas in previous studies. Therefore, this paper proposes the LSTM (Long-Short Term Memory) based the PV power prediction model only using the meteorological, seasonal, and the before the obtained PV power before peak time. In this paper, the experiment results based on the proposed model using the real-world data shows the superior performance, which showed a positive impact on improving the PV power in a peak time forecast performance targeted in this study.

The Designing of Production Planning Module for Advanced Planning System with Respect to Supply Chain of the Shipbuilding Industry (조선산업의 공급망을 고려한 APS 생산계획 모듈 설계)

  • Nam, Seunghoon;Ju, Su Heon;Ryu, Cheolho;Shin, Jong-Gye
    • Korean Journal of Computational Design and Engineering
    • /
    • v.21 no.3
    • /
    • pp.353-362
    • /
    • 2016
  • As ships become larger and construction of offshore plants increases recently, the amount of outsourcing has increased accordingly in the shipyard. Consequently, the system integration in terms of SCM (Supply Chain Management) of information and material flows has become much more important. Especially, since the SCM in the shipbuilding industry is operated in accordance with the production planning in connection with design, purchasing and production process which are the main components of the supply chain, the best production plan has to be established over the whole scheduling activities from the long-term planning to the short-term planning. The paper analyzes the characteristics of the SCM and the production planning system and suggests the need and the direction of APS (Advanced Planning System) development specialized in the supply chain management only for shipbuilding industry. Furthermore, propose a new SCP-Matrix (Supply Chain Planning Matrix), which is the basis of the APS development, appropriate for the shipbuilding industry and draw the core function of the APS module for the practical production plan.

A Neighbor Prefetching Scheme for a Hybrid Storage System (SSD 캐시를 위한 이웃 프리페칭 기법)

  • Baek, Sung Hoon
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.14 no.5
    • /
    • pp.40-52
    • /
    • 2018
  • Solid state drive (SSD) cache technologies that are used as a second-tier cache between the main memory and hard disk drive (HDD) have been widely studied. The SSD cache requires a new prefetching scheme as well as cache replacement algorithms. This paper presents a prefetching scheme for a storage-class cache using SSD. This prefetching scheme is designed for the storage-class cache and based on a long-term scheduling in contrast to the short-term prefetching in the main memory. Traditional prefetching algorithms just consider only read, but the presented prefetching scheme considers both read and write. An experimental evaluation shows 2.3% to 17.8% of hit rate with a 64GB of SSD and the 4GiB of prefetching size using an I/O trace of 14 days. The proposed prefetching scheme showed significant improvement of cache hit rate and can be easily implemented in storage-class cache systems.

Long-Term Arrival Time Estimation Model Based on Service Time (버스의 정차시간을 고려한 장기 도착시간 예측 모델)

  • Park, Chul Young;Kim, Hong Geun;Shin, Chang Sun;Cho, Yong Yun;Park, Jang Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.7
    • /
    • pp.297-306
    • /
    • 2017
  • Citizens want more accurate forecast information using Bus Information System. However, most bus information systems that use an average based short-term prediction algorithm include many errors because they do not consider the effects of the traffic flow, signal period, and halting time. In this paper, we try to improve the precision of forecast information by analyzing the influencing factors of the error, thereby making the convenience of the citizens. We analyzed the influence factors of the error using BIS data. It is shown in the analyzed data that the effects of the time characteristics and geographical conditions are mixed, and that effects on halting time and passes speed is different. Therefore, the halt time is constructed using Generalized Additive Model with explanatory variable such as hour, GPS coordinate and number of routes, and we used Hidden Markov Model to construct a pattern considering the influence of traffic flow on the unit section. As a result of the pattern construction, accurate real-time forecasting and long-term prediction of route travel time were possible. Finally, it is shown that this model is suitable for travel time prediction through statistical test between observed data and predicted data. As a result of this paper, we can provide more precise forecast information to the citizens, and we think that long-term forecasting can play an important role in decision making such as route scheduling.

Assessment of Water Control Model for Tomato and Paprika in the Greenhouse Using the Penman-Monteith Model (Penman-Monteith을 이용한 토마토와 파프리카의 증발산 모델 평가)

  • Somnuek, Siriluk;Hong, Youngsin;Kim, Minyoung;Lee, Sanggyu;Baek, Jeonghyun;Kwak, Kangsu;Lee, Hyondong;Lee, Jaesu
    • Journal of Bio-Environment Control
    • /
    • v.29 no.3
    • /
    • pp.209-218
    • /
    • 2020
  • This paper investigated actual crop evapotranspiration (ETc) of tomato and paprika planted in test beds of the greenhouse. Crop water requirement (CWR) is the amount of water required to compensate ETc loss from the crop. The main objectives of the study are to assess whether the actual crop watering (ACW) was adequate CWR of tomato and paprika and which amount of ACW should be irrigated to each crop. ETc was estimated using the Penman-Monteith model (P-M) for each crop. ACW was calculated from the difference of amount of nutrient supply water and amount of nutrient drainage water. ACW and CWR of each crop were determined, compared and assessed. Results indicated CWR-tomato was around 100 to 1,200 ml/day, while CWR-paprika ranged from 100 to 500 ml/day. Comparison of ACW and CWR of each crop found that the difference of ACW and CWR are fluctuated following day of planting (DAP). However, the differences could divide into two phases, first the amount of ACWs of each crop are less than CWR in the initial phase (60 DAP) around 500 ml/day and 91 ml/day, respectively. Then, ACWs of each crop are greater than the CWR after 60 DAP until the end of cultivation approximately 400 ml/day in tomato and 178 ml/day in paprika. ETc assessment is necessary to correctly quantify crop irrigation water needs and it is an accurate short-term estimation of CWR in greenhouse for optimal irrigation scheduling. Thus, reducing ACW of tomato and paprika in the greenhouse is a recommendation. The amount of ACW of tomato should be applied from 100 to 1,200 ml/day and paprika is 100 to 500 ml/day depend on DAP.