EconPapers    
Economics at your fingertips  
 

Automatic Scheduling of Periodic Event Networks by SAT Solving

Peter Großmann ()
Additional contact information
Peter Großmann: Chair of Traffic Flow Science

A chapter in Operations Research Proceedings 2012, 2014, pp 481-486 from Springer

Abstract: 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.

Keywords: Recurrent Events; Automatic Scheduling; Periodic Event Scheduling Problem (PESP); Large Real-world Instances; Satisfiability Problem (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-00795-3_72

Ordering information: This item can be ordered from
http://www.springer.com/9783319007953

DOI: 10.1007/978-3-319-00795-3_72

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-06-06
Handle: RePEc:spr:oprchp:978-3-319-00795-3_72