Date of Award
Nathan R. Sturtevant, Ph.D.
CSP, Communicating sequential processes, MAX-SAT, Maximum satisfiability, Optimization, SAT, Boolean satisfiability
Most of the companies in Iraq spend significant amounts of time and money when transferring employees between home and work. In this thesis, we model the problem of the Dhi Qar Oil company (DQOC) transportations using three modeling languages from AI: Constraint Programing (CP), Boolean Satisfiability (SAT), and Maximum Satisfiability (MAX-SAT). We then use solvers to find optimal solutions to this problem.
We show which of these solvers is more efficient when finding optimal solutions. For this purpose, we create a test suite of 360 problems to test these solvers. All solvers are applied to these problems and the final efficiency is shown.
Copyright is held by the author. User is responsible for all copyright compliance.
Al Rammahi, Raheem T., "Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT" (2016). Electronic Theses and Dissertations. 1110.
Received from ProQuest
Raheem T. Al Rammahi