Show simple item record

dc.contributor.advisorUlus, Firdevs
dc.contributor.authorDoğan, Saliha Ferda
dc.date.accessioned2019-08-09T07:59:53Z
dc.date.available2019-08-09T07:59:53Z
dc.date.copyright2019-07
dc.date.issued2019-07
dc.date.submitted2019-07-23
dc.identifier.urihttp://hdl.handle.net/11693/52327
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2019.en_US
dc.descriptionIncludes bibliographical references (leaves 47-49).en_US
dc.description.abstractWe propose an exact algorithm to find all nondominated points of biobjective integer programming problems, which arise in various applications of operations research. The algorithm is based on dividing objective space into regions (boxes) and searching them by solving Pascoletti-Serafini scalarizations with fixed direction vector. We develop variants of the algorithm, where the choice of the scalarization model parameters differ; and demonstrate their performance through computational experiments both as exact algorithms and as solution approaches under time restriction. The results of our experiments show the satisfactory behaviour of our algorithm, especially with respect to the number of mixed integer programming problems solved compared to an existing approach. The experiments also demonstrate that different variants have advantages in different aspects: while some variants are quicker in finding the whole set of nondominated solutions, other variants return good-quality solutions in terms of representativeness when run under time restriction.en_US
dc.description.statementofresponsibilityby Saliha Ferda Doğanen_US
dc.format.extentxii, 55 leaves : charts (some color) ; 30 cm.en_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBiobjective integer programmingen_US
dc.subjectPascoletti-Serafini scalarizationen_US
dc.subjectAlgorithmsen_US
dc.titleAn exact algorithm for biobjective integer programming problemsen_US
dc.title.alternativeİki amaçlı tamsayılı programlama problemleri için kesin bir algoritmaen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB149393


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record