Hybrid of Hill Climbing and SAT Solving for Air Traffic Controller Shift Scheduling
نویسندگان
چکیده
منابع مشابه
Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and SAT-Related Problems
1 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, thr...
متن کاملThe Enigma of SAT Hill-climbing Procedures
In this paper, we investigate a family of hill-climbing procedures related to GSAT, a greedy random hill-climbing procedure for satissability. These procedures are able to solve large and diicult satissability problems beyond the range of conventional procedures like Davis-Putnam. We explore the r^ ole of greediness, randomness and hill-climbing in the eeectiveness of these procedures. We show ...
متن کاملTowards an Understanding of Hill-Climbing Procedures for SAT
Recently several local hill climbing procedures for propositional satis ability have been proposed which are able to solve large and di cult problems beyond the reach of conventional algorithms like Davis Putnam By the introduction of some new variants of these procedures we provide strong experimental evidence to support the conjecture that neither greed iness nor randomness is important in th...
متن کاملA Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملClimbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks
This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The problem even in its simplest form is NP-hard in the strong sense. The great deal of interest for this problem, besides its theoretical complexity, is animated by needs of various manufacturing and computing systems. We propose a new approach based on limited discrepancy search to solve the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JITA - Journal of Information Technology and Applications (Banja Luka) - APEIRON
سال: 2016
ISSN: 2233-0194,2232-9625
DOI: 10.7251/jit1502081s