IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-04331-8_17.html
   My bibliography  Save this book chapter

Optimal Control of Distributed Systems with Break Points

In: Online Optimization of Large Scale Systems

Author

Listed:
  • Michael Liepelt

    (Universität Bayreuth, Fachbereich Mathematik)

  • Klaus Schittkowski

    (Universität Bayreuth, Fachbereich Mathematik)

Abstract

We consider optimal control of distributed parameter systems, that are frequently used in chemical engineering to model for example tubular reactors. Break points are introduced to take also cleaning operations into account, where a reactor is shut down for a while and then restarted again. The goal is to minimize a cost function over a fixed time horizon, where the number of cleaning operations, the length of reactor operation between successive cleanings, and the reactor feed rates for each time interval are to be computed. We assume that product prices and consumer demands are time-dependent. It must be guaranteed that the decrease of the free cross-sectional area of the tube caused by coke deposition never exceeds a certain limit. Moreover, there are time and position dependent constraints for the state and control variables such as a maximum bound for the temperature. The general mathematical model and the applied discretization schemes are outlined in detail. We present two different approaches, one based on the method of lines, the other on full discretization where discretized state variables are treated as additional optimization variables. Numerical results are presented for a case study, where optimal input feeds and maintenance times of an acetylene reactor are computed.

Suggested Citation

  • Michael Liepelt & Klaus Schittkowski, 2001. "Optimal Control of Distributed Systems with Break Points," Springer Books, in: Martin Grötschel & Sven O. Krumke & Jörg Rambau (ed.), Online Optimization of Large Scale Systems, pages 271-291, Springer.
  • Handle: RePEc:spr:sprchp:978-3-662-04331-8_17
    DOI: 10.1007/978-3-662-04331-8_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-662-04331-8_17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.