• 제목/요약/키워드: Operational Scheduling

검색결과 117건 처리시간 0.022초

전력저장장치를 고려한 일간 최적 기동정지계획 수립연구 (Daily Unit Commitment Scheduling of Power System with Energy Storage System)

  • 송하나;장세환;김형중;노재형;박종배
    • 전기학회논문지
    • /
    • 제60권4호
    • /
    • pp.717-725
    • /
    • 2011
  • In the power system with an electric storage system that can increase utilization rate of the source of such new renewable energy, this paper introduces the approach on the daily unit commitment scheduling that determines simultaneously optimum operational condition and output of thermal generators and electric storage device. The unit commitment is one of the most important issues in economic operation and security of short-term operational plan of the power system. It is to determine on/off status of generator to minimize operational cost during the given period. The committed generator should satisfy various operational limitation such as estimated demand by system, spinning reserve condition within minimum operational cost. In order to determine on/off or charge/discharge/idle condition and output level of units and electric storage system, the MILP(Mixed Integer Linear Programming) is suggested. The proposed approach is the mixed method between LP(Linear Programming) and IP(integer programming) which seeks the value of real number and integer that maximize or minimize function objective within given condition. The daily unit commitment problem with the electric storage system is applied to MILP algorithm through linearization and formulation process. The proposed approach is applied to the test system.

Combining Vehicle Routing with Forwarding : Extension of the Vehicle Routing Problem by Different Types of Sub-contraction

  • Kopfer, Herbert;Wang, Xin
    • 대한산업공학회지
    • /
    • 제35권1호
    • /
    • pp.1-14
    • /
    • 2009
  • The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the integrated operational planning and report on experiments for extending the plain Vehicle Routing Problem to a corresponding problem combining vehicle routing and request forwarding by means of different sub-contraction types. The extended problem is formalized as a mixed integer linear programming model and solved by a commercial mathematical programming solver. The computational results show tremendous costs savings even for small problem instances by allowing subcontracting. Additionally, the performed experiments for the operational transportation planning are used for an analysis of the decision on the optimal fleet size for own vehicles and regularly hired vehicles.

제지공장용 열병합발전시스템의 운용비용절감을 위한 합리적 운전기법 수립 (A Rational Operation Scheduling for Operational Cost Saving in Cogeneration System for Paper Mill)

  • 최광범;이종범
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1276-1278
    • /
    • 1999
  • This paper proposed the optimal operational scheduling of cogeneration system for paper mill connected with several auxiliary devices. Auxiliary devices that include auxiliary boiler, waste boiler and sludge incinerator operate with multi-cogeneration system. Especially environment element was considered in objective function to solve environment problem. Electricity can be purchased through power system from utility. The proposed operational strategy on cogeneration system for paper mill to increase energy efficiency can be applied to the similar cogeneration system in industrial field.

  • PDF

제지공장용 열병합발전시스템에서 유전알고리즘을 이용한 합리적 운전계획 수립에 관한 연구 (A Rational Operation Scheduling Using Genetic Algorithms on Cogeneration System for Paper Mill)

  • 최광범;이종범;정지훈
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 추계학술대회 논문집 학회본부 A
    • /
    • pp.291-293
    • /
    • 1999
  • This paper proposed the optimal operational scheduling of cogeneration system for paper mill connected with several auxiliary devices. Auxiliary devices that include auxiliary boilers, waste heat boilers and sludge incinerators operate with multi-cogeneration systems. Especially environment element was considered in objective function to solve the environment problem. And GAs(Genetic Algorithms) was applied to optimize and to analyse nonlinear operational property of cogeneration system of paper mill connected with several auxiliary devices. C-language was used to GAs computation. Electricity can be purchased through power system from utility. The proposed operational strategy on cogeneration system for paper mill to increase energy efficiency can be applied to the similar cogeneration system of industrial field.

  • PDF

Non-periodic Subway Scheduling that Minimizes Operational Cost and Passenger Waiting Time

  • Hong, YunWoo;Chung, Yerim;Min, YunHong
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권8호
    • /
    • pp.133-142
    • /
    • 2018
  • Subway metro scheduling is one of the most important problems impacting passenger convenience today. To operate efficiently, the Seoul metro uses regular, periodic schedules for all lanes, both north and southbound. However, many past studies suggest that non-periodic scheduling would better optimize costs. Since the Seoul metro is continuously facing a deficit, adopting a non-periodic schedule may be necessary. Two objectives are presented; the first, to minimize the average passengers' waiting time, and the second, to minimize total costs, the sum of the passenger waiting time, and the operational costs. In this paper, we use passenger smart card data and a precise estimation of transfer times. To find the optimal time-table, a genetic algorithm is used to find the best solution for both objectives. Using Python 3.5 for the analysis, for the first objective, we are able to reduce the average waiting time, even when there are fewer trains. For the second objective, we are able to save about 4.5 thousand USD with six fewer trains.

실시간 제어가 가능한 일정 계획 시스템 개발 (Development of a production scheduling system for the real time controlled manufacturing system)

  • 이철수;배상윤;이강주
    • 경영과학
    • /
    • 제10권2호
    • /
    • pp.61-77
    • /
    • 1993
  • This paper involves a study of developing the production scheduling system in a general job shop type mechanical factory. We consider realistic situations in the job-shop environments, such as alternative machines for operation, the new kinds of processes, the machining center with the plural pallet, the operational situation of each machine during the scheduling period, occurings of urgent orders and machine breakdowns. We also propose the methodology of re-schedule. It is very fast and acceptable for real time production control system. These all functions are implemented on IBM PC and program source is written in PASCAL language.

  • PDF

FMC의 모델링과 지능형 스케쥴링 (Modeling and Intelligent Scheduling for FMC)

  • 서기성;이노성;안인석;우승규;이규호;우광방
    • 전자공학회논문지B
    • /
    • 제30B권3호
    • /
    • pp.31-40
    • /
    • 1993
  • This paper deals with the modeling and scheduling for FMC(Flexible Manufacturing Cells). The FMC system composed of unit or multi cells is capable of improving productivity with flexibility for machine. However, the properties of multiple jobs and various alternatives results in tne dynamic states which make system management very complex. The extended Peti nets are used to represent for complex properties of FMC which performs short-term scheduling and dynamic operational scheduling. The hierarchical control structure and integlligent scheduling through expert module are adopted for efficiency of FMC operations. The computer simulation reveals that intelligent scheduling method is better than heuristics in various performance indices.

  • PDF

Low-power Scheduling Framework for Heterogeneous Architecture under Performance Constraint

  • Li, Junke;Guo, Bing;Shen, Yan;Li, Deguang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권5호
    • /
    • pp.2003-2021
    • /
    • 2020
  • Today's computer systems are widely integrated with CPU and GPU to achieve considerable performance, but energy consumption of such system directly affects operational cost, maintainability and environmental problem, which has been aroused wide concern by researchers, computer architects, and developers. To cope with energy problem, we propose a task-scheduling framework to reduce energy under performance constraint by rationally allocating the tasks across the CPU and GPU. The framework first collects the estimated energy consumption of programs and performance information. Next, we use above information to formalize the scheduling problem as the 0-1 knapsack problem. Then, we elaborate our experiment on typical platform to verify proposed scheduling framework. The experimental results show that our proposed algorithm saves 14.97% energy compared with that of the time-oriented policy and yields 37.23% performance improvement than that of energy-oriented scheme on average.

Effective simulation-based optimization algorithm for the aircraft runway scheduling problem

  • Wided, Ali;Fatima, Bouakkaz
    • Advances in aircraft and spacecraft science
    • /
    • 제9권4호
    • /
    • pp.335-347
    • /
    • 2022
  • Airport operations are well-known as a bottleneck in the air traffic system, putting growing pressure on the world's busiest airports to schedule arrivals and departures as efficiently as possible. Effective planning and control are essential for increasing airport efficiency and reducing aircraft delays. Many algorithms for controlling the arrival/departure queuing area are handled, considering it as first in first out queues, where any available aircraft can take off regardless of its relative sequence with other aircraft. In the suggested system, this problem was compared to the problem of scheduling n tasks (plane takeoffs and landings) on a multiple machine (runways). The proposed technique decreases delays (via efficient runway allocation or allowing aircraft to be expedited to reach a scheduled time) to enhance runway capacity and decrease delays. The aircraft scheduling problem entails arranging aircraft on available runways and scheduling their landings and departures while considering any operational constraints. The topic of this work is the scheduling of aircraft landings and takeoffs on multiple runways. Each aircraft's takeoff and landing schedules have time windows, as well as minimum separation intervals between landings and takeoffs. We present and evaluate a variety of comprehensive concepts and solutions for scheduling aircraft arrival and departure times, intending to reduce delays relative to scheduled times. When compared to First Come First Serve scheduling algorithm, the suggested strategy is usually successful in reducing the average waiting time and average tardiness while optimizing runway use.

Enhanced Particle Swarm Optimization for Short-Term Non-Convex Economic Scheduling of Hydrothermal Energy Systems

  • Jadoun, Vinay Kumar;Gupta, Nikhil;Niazi, K. R.;Swarnkar, Anil
    • Journal of Electrical Engineering and Technology
    • /
    • 제10권5호
    • /
    • pp.1940-1949
    • /
    • 2015
  • This paper presents an Enhanced Particle Swarm Optimization (EPSO) to solve short-term hydrothermal scheduling (STHS) problem with non-convex fuel cost function and a variety of operational constraints related to hydro and thermal units. The operators of the conventional PSO are dynamically controlled using exponential functions for better exploration and exploitation of the search space. The overall methodology efficiently regulates the velocity of particles during their flight and results in substantial improvement in the conventional PSO. The effectiveness of the proposed method has been tested for STHS of two standard test generating systems while considering several operational constraints like system power balance constraints, power generation limit constraints, reservoir storage volume limit constraints, water discharge rate limit constraints, water dynamic balance constraints, initial and end reservoir storage volume limit constraints, valve-point loading effect, etc. The application results show that the proposed EPSO method is capable to solve the hard combinatorial constraint optimization problems very efficiently.