IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-00795-3_72.html
   My bibliography  Save this book chapter

Automatic Scheduling of Periodic Event Networks by SAT Solving

In: Operations Research Proceedings 2012

Author

Listed:
  • Peter Großmann

    (Chair of Traffic Flow Science)

Abstract

In this paper, periodic event scheduling problems (PESP) are encoded as satisfiability problems (SAT) and solved by a state-of-the-art SAT solver. Both the encoding, based on order encoded domains, and the valid use in terms of a proof are presented. The experimental evaluations suggest that the SAT-based approach outperforms constraint-based PESP solvers, which were considered to be the best solvers for PESP. This opens the possibility to solve more complex and larger real-world instances, such as timetabling for public railway transport networks.

Suggested Citation

  • Peter Großmann, 2014. "Automatic Scheduling of Periodic Event Networks by SAT Solving," Operations Research Proceedings, in: Stefan Helber & Michael Breitner & Daniel Rösch & Cornelia Schön & Johann-Matthias Graf von der Schu (ed.), Operations Research Proceedings 2012, edition 127, pages 481-486, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-00795-3_72
    DOI: 10.1007/978-3-319-00795-3_72
    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 search for a similarly titled item that would be available.

    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:oprchp:978-3-319-00795-3_72. 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.