• Title/Summary/Keyword: Demand scheduling

Search Result 238, Processing Time 0.02 seconds

Based on the Demand, A Scheduling Method for the Seoul-Busan High Speed Rail (수요기반의 경부고속철도 열차운행계획 수립기법에 관한 연구)

  • Park, Jin-Yong;Chang, Justin S.
    • Proceedings of the KSR Conference
    • /
    • 2010.06a
    • /
    • pp.380-388
    • /
    • 2010
  • This paper explored an effective scheduling method for the Seoul-Busan High Speed Rail. It is important to decide train frequency influencing on scheduling method. Main factors to decide train frequency are location of station, social economic index, land use of station area and travel demand. In this paper, we focused on travel demand which is critical factor to decide train frequency. And we studied on standardized scheduling method. Simulation method is used to analyze the performance of explored method.

  • PDF

A combination of periodic and on-demand scheduling for data broadcasting in mobile convergence networks (모바일 융합망에서 주기적방법과 on-demand 방법을 결합한 데이터 방송 스케줄링 기법)

  • Kang, Sang-Hyuk;Ahn, Hee-June
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.189-196
    • /
    • 2009
  • We propose a hybrid broadcast scheduling based on a combination of periodic and on-demand data scheduling methods for mobile data broadcasting in convergence networks from communication and broadcasting. We consider an environment in which the forward channel is for data broadcasting and the reverse channel is for sending data requests via cellular phones, WLAN, WiBro, etc. Collecting statistics of requests from clients, the server partitions the data items into hot-item and cold-item sets. Hot items are sent based on a push-based scheduling. An on-demand scheduling method is applied to cold items. Performance evaluation from simulations shows that our proposed scheduling algorithm yields small response time with high successful response ratio.

Real Time Sudden Demand Negotiation Framework based Smart Grid System considering Characteristics of Electric device type and Customer' Delay Discomfort (전력기기 특성 및 가동 지연 불편도를 고려한 실시간 급작 수요 협상 프레임웍 기반 스마트 그리드 시스템)

  • Yoo, Daesun;Lee, Hyunsoo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.3
    • /
    • pp.405-415
    • /
    • 2019
  • The considerations of the electrical device' characteristics and the customers' satisfaction have been important criteria for efficient smart grid systems. In general, an electrical device is classified into a non-interruptible device or an interruptible device. The consideration of the type is an essential information for the efficient smart grid scheduling. In addition, customers' scheduling preferences or satisfactions have to be considered simultaneously. However, the existing research studies failed to consider both criteria. This paper proposes a new and efficient smart grid scheduling framework considering both criteria. The framework consists of two modules - 1) A day-head smart grid scheduling algorithm and 2) Real-time sudden demand negotiation framework. The first method generates the smart grid schedule efficiently using an embedded genetic algorithm with the consideration of the device's characteristics. Then, in case of sudden electrical demands, the second method generates the more efficient real-time smart grid schedules considering both criteria. In order to show the effectiveness of the proposed framework, comparisons with the existing relevant research studies are provided under various electricity demand scenarios.

Group Building Based Power Consumption Scheduling for the Electricity Cost Minimization with Peak Load Reduction

  • Oh, Eunsung;Park, Jong-Bae;Son, Sung-Yong
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.6
    • /
    • pp.1843-1850
    • /
    • 2014
  • In this paper, we investigate a group building based power consumption scheduling to minimize the electricity cost. We consider the demand shift to reduce the peak load and suggest the compensation function reflecting the relationship between the change of the building demand and the occupants' comfort. Using that, the electricity cost minimization problem satisfied the convexity is formulated, and the optimal power consumption scheduling algorithm is proposed based on the iterative method. Extensive simulations show that the proposed algorithm achieves the group management gain compared to the individual building operation by increasing the degree of freedom for the operation.

Optimization of Home Loads scheduling in Demand Response (수요 반응에서 가정용 전력기계의 최적화된 스케쥴링 기법)

  • Kim, Tae-Wan;Lee, Sung-Jin;Lee, Sang-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1407-1415
    • /
    • 2010
  • In recent years, the smart grid technique for maximizing the energy efficiency of power networks has received a great deal of attentions. In particular, the Demand Response is a core technology differentiated from the present power network under the smart grid paradigm. To minimize the electric cost and maximize users' satisfaction, this paper proposes a unique scheduling algorithm derived by using optimization where the characteristics of various home appliances are taken into account. For this goal, we represent mathematical consumption patterns of the electric loads and propose the optimal scheduling scheme based on the importance factor of each device during one day. In the simulation results, we demonstrate the effectiveness of the proposed algorithm in the viewpoint of the minimal electric costs utilizing real statistical figures.

Chance-constrained Scheduling of Variable Generation and Energy Storage in a Multi-Timescale Framework

  • Tan, Wen-Shan;Abdullah, Md Pauzi;Shaaban, Mohamed
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.5
    • /
    • pp.1709-1718
    • /
    • 2017
  • This paper presents a hybrid stochastic deterministic multi-timescale scheduling (SDMS) approach for generation scheduling of a power grid. SDMS considers flexible resource options including conventional generation flexibility in a chance-constrained day-ahead scheduling optimization (DASO). The prime objective of the DASO is the minimization of the daily production cost in power systems with high penetration scenarios of variable generation. Furthermore, energy storage is scheduled in an hourly-ahead deterministic real-time scheduling optimization (RTSO). DASO simulation results are used as the base starting-point values in the hour-ahead online rolling RTSO with a 15-minute time interval. RTSO considers energy storage as another source of grid flexibility, to balance out the deviation between predicted and actual net load demand values. Numerical simulations, on the IEEE RTS test system with high wind penetration levels, indicate the effectiveness of the proposed SDMS framework for managing the grid flexibility to meet the net load demand, in both day-ahead and real-time timescales. Results also highlight the adequacy of the framework to adjust the scheduling, in real-time, to cope with large prediction errors of wind forecasting.

Mixed-Integer programming model for scheduling of steelmaking processes (철강 공정의 일정계획을 위한 혼합정수계획 모델)

  • Bok, Jin-Gwang;Lee, Dong-Yeop;Park, Seon-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.6
    • /
    • pp.714-723
    • /
    • 1999
  • This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.

  • PDF

An Optimal Power Scheduling Method Applied in Home Energy Management System Based on Demand Response

  • Zhao, Zhuang;Lee, Won Cheol;Shin, Yoan;Song, Kyung-Bin
    • ETRI Journal
    • /
    • v.35 no.4
    • /
    • pp.677-686
    • /
    • 2013
  • In this paper, we first introduce a general architecture of an energy management system in a home area network based on a smart grid. Then, we propose an efficient scheduling method for home power usage. The home gateway (HG) receives the demand response (DR) information indicating the real-time electricity price, which is transferred to an energy management controller (EMC). Referring to the DR, the EMC achieves an optimal power scheduling scheme, which is delivered to each electric appliance by the HG. Accordingly, all appliances in the home operate automatically in the most cost-effective way possible. In our research, to avoid the high peak-to-average ratio (PAR) of power, we combine the real-time pricing model with the inclining block rate model. By adopting this combined pricing model, our proposed power scheduling method effectively reduces both the electricity cost and the PAR, ultimately strengthening the stability of the entire electricity system.

A Fast Dynamic Broadcasting Scheme For Video-On-Demand Systems (주문형 비디오 시스템을 위한 빠른 동적 방송 기법)

  • Kwon, Hyeok-Min
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.9
    • /
    • pp.433-444
    • /
    • 2005
  • In video-on-demand(VOD) systems, a broadcast-based scheduling mechanism is known to be a very efficient technique for disseminating popular videos to very large client populations. The main motivations of broadcasting scheduling mechanisms are that they scale up extremely well and they have very modest bandwidth requirements. This paper proposes a new dynamic broadcasting scheduling mechanism, named FDBS (fast dynamic broadcasting scheme), and proves its correctness. This paper also evaluates the performance of FDBS on the basis of a simulation approach. The simulation results indicate that FDBS shows a superior performance over UD, CBHD, and NPB in terms of the average response time with very reasonable bandwidth requirements.

Optimization of Generator Maintenance Scheduling with Consideration on the Equivalent Operation Hours

  • Han, Sangheon;Kim, Hyoungtae;Lee, Sungwoo;Kim, Wook
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.338-346
    • /
    • 2016
  • In order for the optimal solution of generators’ annual maintenance scheduling to be applicable to the actual power system it is crucial to incorporate the constraints related to the equivalent operation hours (EOHs) in the optimization model. However, most of the existing researches on the optimal maintenance scheduling are based on the assumption that the maintenances are to be performed periodically regardless of the operation hours. It is mainly because the computation time to calculate EOHs increases exponentially as the number of generators becomes larger. In this paper an efficient algorithm based on demand grouping method is proposed to calculate the approximate EOHs in an acceptable computation time. The method to calculate the approximate EOHs is incorporated into the optimization model for the maintenance scheduling with consideration on the EOHs of generators. The proposed method is successfully applied to the actual Korean power system and shows significant improvement when compared to the result of the maintenance scheduling algorithm without consideration on EOHs.