International Conference on Principles and Practice of Constraint Programming

CP 2014: Principles and Practice of Constraint Programming pp 886-902

Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and SAT-Related Problems

  • Mirko Stojadinović
Conference paper

DOI: 10.1007/978-3-319-10428-7_63

Volume 8656 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Stojadinović M. (2014) Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and SAT-Related Problems. In: O’Sullivan B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham

Abstract

In this paper we present our experience in solving Air Traffic Controller Shift Scheduling Problem. We give a formal definition of this optimization problem and introduce three encodings. The encodings make possible to formulate a very wide set of different scheduling requirements. The problem is solved by using SAT, MaxSAT, PB, SMT, CSP and ILP solvers. In combination with these solvers, three different optimization techniques are presented, a basic technique and its two modifications. The modifications use local search to modify some parts of the initial solution. Results indicate that SAT-related approaches outperform other solving methods used and that one of the introduced techniques which uses local search can significantly outperform the basic technique. We have successfully used these approaches to make shift schedules for one air traffic control center.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Mirko Stojadinović
    • 1
  1. 1.Faculty of MathematicsUniversity of BelgradeSerbia