IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-55753-8_52.html

Computer Aided Scheduling of Switching Engines

In: Mathematics — Key Technology for the Future

Author

Listed:
  • Uwe T. Zimmermann

    (Braunschweig University of Technology, Department of Mathematical Optimization)

  • Marco E. Lübbecke

    (Braunschweig University of Technology, Department of Mathematical Optimization)

Abstract

Scheduling the switching engines of an industrial railroad is a formidable and responsible task, closely related to the well-studied pickup and delivery problem with time windows. Aiming at an efficient usage of resources the need arose for a computer aided scheduling tool as support for the human dispatcher. We sketch a set partitioning formulation of this problem to be solved via column generation. The pricing subproblem is hard in the theoretical sense but can be solved by means of a combination of heuristics and exact algorithms. A trade-off between mathematical rigor and practicability becomes apparent and is extensively discussed. Our computational experience with an academic prototype implementation is encouraging. We succeed in obtaining practically acceptable solutions for instances of more than forty customers and six vehicles.

Suggested Citation

  • Uwe T. Zimmermann & Marco E. Lübbecke, 2003. "Computer Aided Scheduling of Switching Engines," Springer Books, in: Willi Jäger & Hans-Joachim Krebs (ed.), Mathematics — Key Technology for the Future, pages 690-702, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-55753-8_52
    DOI: 10.1007/978-3-642-55753-8_52
    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-642-55753-8_52. 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.