Date of Award

1-1-2016

Document Type

Thesis

Degree Name

M.S.

Department

Computer Science

First Advisor

Nathan R. Sturtevant, Ph.D.

Second Advisor

Ronald DeLyser

Third Advisor

Anneliese Andrews

Keywords

CSP, Communicating sequential processes, MAX-SAT, Maximum satisfiability, Optimization, SAT, Boolean satisfiability

Abstract

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.

Publication Statement

Copyright is held by the author. User is responsible for all copyright compliance.

Provenance

Received from ProQuest

Rights holder

Raheem T. Al Rammahi

File size

85 p.

File format

application/pdf

Language

en

Discipline

Computer Science



Share

COinS