• Title/Summary/Keyword: optimal operation planning

Search Result 201, Processing Time 0.022 seconds

Optimization of Pumped-Storage Energy in Operation Aspect Using the Analytic Cost Function (전선차용계면에서의 아수발전성 최적화를 위한 해석적 앨고리즘에 관한 연구)

  • 박영문;서보혁
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.32 no.5
    • /
    • pp.176-182
    • /
    • 1983
  • This paper derives a newly neveloped analytic optimal condition to minimize the operating cost of a generation system in the aspect of Power System Planning, When the system includes pumped-storage units. The analytic optimal condition is derived by defferentiating the analytic cost function, Which were obtained by assuming the load and generating as Gaussian random variables, with respect to the variations of pumping energy. The condition is resulted in very simple form and various optimization techniques can be used. The simulation results of a case study were compared with the results of the conventional methods to prove the usefulness of the algorithm.

Conduits for Coronary Bypass: Strategies

  • Barner, Hendrick B.
    • Journal of Chest Surgery
    • /
    • v.46 no.5
    • /
    • pp.319-327
    • /
    • 2013
  • Strategic planning is integral to any operation but complexity varies immensely and therefore the effort necessary to create the optimal plan. The previous three reports have discussed individual conduits and herein is an attempt to present approaches to common situations which the author favors. Although much has been learned over 45 years about use and subsequent behavior of venous and arterial grafts we continue to learn and, as a result, evolve new strategies or modify those now popular. Thus the reader must recognize that in spite of trying to be balanced and inclusive all surgeons have personal opinions and also prejudices which influence the approach taken and which may not be the optimal one for others or for the patient.

A Heuristic Approach to Disassembly Scheduling with Assembly Product Structure (조립구조 형태 제품의 분해 일정계획 문제에 대한 발견적 기법)

  • Lee Dong-Ho;Xirouchakis Paul
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.686-692
    • /
    • 2002
  • Disassembly scheduling is the problem of determining the ordering and disassembly schedules of used products while satisfying the demand of their parts of components over a certain planning horizon. The objective is to minimize the sum of purchase, setup, disassembly operation and inventory holding costs. This paper considers products with assembly structure, i.e. products without parts commonality, and suggests a heuristic in which an initial solution is obtained in the form of the minimal latest disassembly schedule, and then improved considering trade-offs among different cost factors. To show the performance of the heuristic suggested in this paper, computational experiments were done on the modified existing examples and the results show that the heuristic can give optimal of very near optimal solutions within very short computation times.

  • PDF

Adaptive Firefly Algorithm based OPF for AC/DC Systems

  • Babu, B. Suresh;Palaniswami, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.791-800
    • /
    • 2016
  • Optimal Power Flow (OPF) is an important operational and planning problem in minimizing the chosen objective functions of the power systems. The recent developments in power electronics have enabled introduction of dc links in the AC power systems with a view of making the operation more flexible, secure and economical. This paper formulates a new OPF to embrace dc link equations and presents a heuristic optimization technique, inspired by the behavior of fireflies, for solving the problem. The solution process involves AC/DC power flow and uses a self adaptive technique so as to avoid landing at the suboptimal solutions. It presents simulation results of IEEE test systems with a view of demonstrating its effectiveness.

A Modified Particle Swarm Optimization for Optimal Power Flow

  • Kim, Jong-Yul;Lee, Hwa-Seok;Park, June-Ho
    • Journal of Electrical Engineering and Technology
    • /
    • v.2 no.4
    • /
    • pp.413-419
    • /
    • 2007
  • The optimal power flow (OPF) problem was introduced by Carpentier in 1962 as a network constrained economic dispatch problem. Since then, it has been intensively studied and widely used in power system operation and planning. In the past few decades, many stochastic optimization methods such as Genetic Algorithm (GA), Evolutionary Programming (EP), and Particle Swarm Optimization (PSO) have been applied to solve the OPF problem. In particular, PSO is a newly proposed population based stochastic optimization algorithm. The main idea behind it is based on the food-searching behavior of birds and fish. Compared with other stochastic optimization methods, PSO has comparable or even superior search performance for some hard optimization problems in real power systems. Nowadays, some modifications such as breeding and selection operators are considered to make the PSO superior and robust. In this paper, we propose the Modified PSO (MPSO), in which the mutation operator of GA is incorporated into the conventional PSO to improve the search performance. To verify the optimal solution searching ability, the proposed approach has been evaluated on an IEEE 3D-bus test system. The results showed that performance of the proposed approach is better than that of the standard PSO.

A Study on the Infra-Capacity Analysis for Optimal Operating Environments of Supercomputer Center (슈퍼컴퓨터센터의 최적 운영환경을 위한 기반시설 용량 산정에 관한 연구)

  • Ryu, Young-Hee;Sung, Jin-Woo;Kim, Duk-Su;Kil, Seong-Ho
    • KIEAE Journal
    • /
    • v.10 no.2
    • /
    • pp.19-24
    • /
    • 2010
  • According to the increasing demands of supercomputer, an exclusive supercomputer building is requested to install a supercomputer for promoting high-end R&D as well as creating the public service infrastructure in the national level. KISTI, as a public supercomputer center with the 4th supercomputer (capacity of 360Tflops), is experiencing shortage of infrastructure systems, caused by increased capacity. Thus, it is anticipated that the situation will be growing serious when the 5th and 6th supercomputers will be installed. On this study, analyzed on the 5th supercomputer system through projecting performance level and optimal operating environments by assessing infra-capacity. Explored way to construct optimal operating environments through infrastructure-capacity analysis of supercomputer center. This study can be of use for reviewing KISTI's conditions as the only supercomputer center in Korea. In addition, it provides reference data for planning the new exclusive supercomputer center in terms of feasibility, while analyzing infrastructure systems.

Optimal production cost evaluation model of cogeneration system for buildings including maintenanace scheduling (보수계획을 고려한 건물용 열병합 발전의 최적 운전비용 산출 모델)

  • Kim, Y.S.;Park, J.S.;Yu, J.S.;Kim, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.559-561
    • /
    • 1995
  • The cogeneration system has a strong merit in providing thermal and electrical energy simultaneously. Nowadays, cogeneration system is widely used in the point of efficient use of the energy resources And the installation of the system is expected to be greatly increased in each year. So, we need to develop an optimal operation planning for those systems. In this paper, we are used to result what studed at the my power system of room because it is in order to solve maintenance scheduling problem. Also we added a constraints to the proposed maintenance model for optimal maintenance rate. In the case study, we construct an multi-machine generated example system which operated in topping cycle, and calculate the yearly optimal production cost, marginal maintenance cost, and maintenance scheduling of the example system respectively.

  • PDF

MILP model for short-term scheduling of multi-purpose batch plants with batch distillation process

  • Ha, Jin-Juk;Lee, Euy-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1826-1829
    • /
    • 2003
  • Fine chemical production must assure high-standard product quality as well as characterized as multi-product production in small volumes. Installing high-precision batch distillation is one of the common elements in the successful manufacturing of fine chemicals, and the importance of the process operation strategy with quality assurance cannot be overemphasized. In this study, we investigate the optimal operation strategy and production planning of a sequential multi-purpose plants consisting of batch processes and batch distillation with unlimited intermediate storage. We formulated this problem as an MILP model. A mixed-integer linear programming model is developed based on the time slot, which is used to determine the production sequence and the production path of each batch. Illustrative examples show the effectiveness of the approach.

  • PDF

Optimal Soft-combine Zone Configuration in a Multicast CDMA Network (멀티캐스트 CDMA 네트워크에서의 Soft-combine을 지원할 기지국의 선정)

  • Kim Jae-Hoon;Myung Young-Soo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.3
    • /
    • pp.1-10
    • /
    • 2006
  • In this paper we deal with a cell planning issue arisen in a CDMA based multicast network. In a CDMA based wireless network, a terminal can significantly reduce the bit error rate via the cohesion of data streams from multiple base stations. In this case, multiple base stations have to be operated according to a common time line. The cells whose base stations are operated as such are called soft-combined cells. Therefore, a terminal can take advantage of error rate reduction, if the terminal is in a soft-combined cell and at least one neighboring cell is also soft-combined. However, as soft-combining operation gives heavy burden to the network controller, the limited number of cells can be soft-combined. Our problem us to find a limited number of soft-combined cells such that the benefit of the soft-combining operation is maximized.

Setup and Operation Sequence Generation from Manufacturability Evaluation for Prismatic Parts (제조성 평가를 기반으로 한 비회전형상 부품의 작업준비 및 작업순서 생성)

  • Choi, Hoo Gon;Han, Jung Hyun;Kang, Mujin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.4
    • /
    • pp.316-333
    • /
    • 2005
  • Although some successful recognition algorithms have been developed, most of them did emphasize on extracting accurate interpretations without considerations of manufacturability. Evaluating the manufacturability for multiple features leads to produce the machining sequences. In this paper, the A* algorithm guarantees the optimal setup sequences with minimizing the machining cost. Also, tolerances including surface roughness are converted to STEP formats to be utilized for more reliable process plans. Finally, decision tables are used to create the detailed operational sequences based on geometric tolerances and surface roughness. Machining parameters such as feed, depth of cut, and cutting speed for each operation are added to the routing sheet. Windows are presented to show how the entire system works for a sample part.