{"id":{"repo_id":"denver","oai_identifier":"oai:digitalcommons.du.edu:etd-2110"},"canonical_url":"https://search.ndltd.org/etd/denver/oai:digitalcommons.du.edu:etd-2110","repository":{"repo_id":"denver","name":"University of Denver","base_url":"https://digitalcommons.du.edu/do/oai/"},"display":{"title":"Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Al Rammahi, Raheem T."],"institution":null,"degree_name":"M.S.","degree_level":"Masters Thesis","degree_discipline":null,"degree_department":null,"school":null,"contributors":["Nathan R. Sturtevant, Ph.D.","Ronald DeLyser","Anneliese Andrews"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:54:02Z","subjects":["CSP","Communicating sequential processes","MAX-SAT","Maximum satisfiability","Optimization","SAT","Boolean satisfiability","Computer Sciences"],"languages":["en"],"rights":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>","Raheem T. Al Rammahi"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.du.edu/etd/1110","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.du.edu/etd/1110","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.du.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.du.edu%3Aetd-2110","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nathan R. Sturtevant, Ph.D.","Ronald DeLyser","Anneliese Andrews"]},{"key":"dc:creator","label":"Author","values":["Al Rammahi, Raheem T."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2017-02-14T08:00:00Z"]},{"key":"dc:date.copyright","label":"Dc Date Copyright","values":["2016-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2016-01-01T08:00:00Z"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["CSP","Communicating sequential processes","MAX-SAT","Maximum satisfiability","Optimization","SAT","Boolean satisfiability","Computer Sciences"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>"]},{"key":"dc:rights.holder","label":"Dc Rights Holder","values":["Raheem T. Al Rammahi"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.du.edu/etd/1110"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.provenance","label":"Dc Description Provenance","values":["Received from ProQuest"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:format.extent","label":"Dc Format Extent","values":["85 p."]},{"key":"dc:title","label":"Title","values":["Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT"]}]}],"canonical_facts":{"dc:contributor":["Nathan R. Sturtevant, Ph.D.","Ronald DeLyser","Anneliese Andrews"],"dc:creator":["Al Rammahi, Raheem T."],"dc:date.available":["2017-02-14T08:00:00Z"],"dc:date.copyright":["2016-01-01T08:00:00Z"],"dc:date.created":["2016-01-01T08:00:00Z"],"dc:description.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."],"dc:description.provenance":["Received from ProQuest"],"dc:format":["application/pdf"],"dc:format.extent":["85 p."],"dc:identifier":["https://digitalcommons.du.edu/etd/1110"],"dc:language":["en"],"dc:rights":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>"],"dc:rights.holder":["Raheem T. Al Rammahi"],"dc:subject":["CSP","Communicating sequential processes","MAX-SAT","Maximum satisfiability","Optimization","SAT","Boolean satisfiability","Computer Sciences"],"dc:title":["Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT"],"thesis:degree_level":["Masters Thesis"],"thesis:degree_name":["M.S."]},"updated_at":"2026-11-19T07:54:02Z"}