Publication:
A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems

dc.contributor.coauthorN/A
dc.contributor.departmentDepartment of Business Administration
dc.contributor.departmentGraduate School of Sciences and Engineering
dc.contributor.kuauthorKirlik, Gökhan
dc.contributor.kuauthorSayın, Serpil
dc.contributor.schoolcollegeinstituteCollege of Administrative Sciences and Economics
dc.contributor.schoolcollegeinstituteGRADUATE SCHOOL OF SCIENCES AND ENGINEERING
dc.date.accessioned2024-11-10T00:09:27Z
dc.date.issued2014
dc.description.abstractMost real-life decision-making activities require more than one objective to be considered. Therefore, several studies have been presented in the literature that use multiple objectives in decision models. In a mathematical programming context, the majority of these studies deal with two objective functions known as bicriteria optimization, while few of them consider more than two objective functions. In this study, a new algorithm is proposed to generate all nondominated solutions for multiobjective discrete optimization problems with any number of objective functions. In this algorithm, the search is managed over (p - 1)-dimensional rectangles where p represents the number of objectives in the problem and for each rectangle two-stage optimization problems are solved. The algorithm is motivated by the well-known epsilon-constraint scalarization and its contribution lies in the way rectangles are defined and tracked. The algorithm is compared with former studies on multiobjective knapsack and multiobjective assignment problem instances. The method is highly competitive in terms of solution time and the number of optimization models solved.
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.issue3
dc.description.openaccessNO
dc.description.sponsoredbyTubitakEuN/A
dc.description.sponsorshipTUBITAK (Scientific & Technical Research Council of Turkey) [112M21] This work is partially supported by TUBITAK (Scientific & Technical Research Council of Turkey), Project No. 112M21.
dc.description.volume232
dc.identifier.doi10.1016/j.ejor.2013.08.001
dc.identifier.eissn1872-6860
dc.identifier.issn0377-2217
dc.identifier.scopus2-s2.0-84884587855
dc.identifier.urihttps://doi.org/10.1016/j.ejor.2013.08.001
dc.identifier.urihttps://hdl.handle.net/20.500.14288/17134
dc.identifier.wos325598800006
dc.keywordsMultiple objective programming
dc.keywordsInteger programming
dc.keywordsEfficient set
dc.keywordsEpsilon-constraint method
dc.keywordsEpsilon-constraint method
dc.keywordsCombinatorial optimization
dc.keywordsSolve
dc.language.isoeng
dc.publisherElsevier Science Bv
dc.relation.ispartofEuropean Journal Of Operational Research
dc.subjectManagement
dc.subjectOperations research
dc.subjectManagement science
dc.titleA new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorKirlik, Gökhan
local.contributor.kuauthorSayın, Serpil
local.publication.orgunit1GRADUATE SCHOOL OF SCIENCES AND ENGINEERING
local.publication.orgunit1College of Administrative Sciences and Economics
local.publication.orgunit2Department of Business Administration
local.publication.orgunit2Graduate School of Sciences and Engineering
relation.isOrgUnitOfPublicationca286af4-45fd-463c-a264-5b47d5caf520
relation.isOrgUnitOfPublication3fc31c89-e803-4eb1-af6b-6258bc42c3d8
relation.isOrgUnitOfPublication.latestForDiscoveryca286af4-45fd-463c-a264-5b47d5caf520
relation.isParentOrgUnitOfPublication972aa199-81e2-499f-908e-6fa3deca434a
relation.isParentOrgUnitOfPublication434c9663-2b11-4e66-9399-c863e2ebae43
relation.isParentOrgUnitOfPublication.latestForDiscovery972aa199-81e2-499f-908e-6fa3deca434a

Files