Publication: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
dc.contributor.coauthor | N/A | |
dc.contributor.department | Department of Business Administration | |
dc.contributor.department | Graduate School of Sciences and Engineering | |
dc.contributor.kuauthor | Kirlik, Gökhan | |
dc.contributor.kuauthor | Sayın, Serpil | |
dc.contributor.schoolcollegeinstitute | College of Administrative Sciences and Economics | |
dc.contributor.schoolcollegeinstitute | GRADUATE SCHOOL OF SCIENCES AND ENGINEERING | |
dc.date.accessioned | 2024-11-10T00:09:27Z | |
dc.date.issued | 2014 | |
dc.description.abstract | Most 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.indexedby | WOS | |
dc.description.indexedby | Scopus | |
dc.description.issue | 3 | |
dc.description.openaccess | NO | |
dc.description.sponsoredbyTubitakEu | N/A | |
dc.description.sponsorship | TUBITAK (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.volume | 232 | |
dc.identifier.doi | 10.1016/j.ejor.2013.08.001 | |
dc.identifier.eissn | 1872-6860 | |
dc.identifier.issn | 0377-2217 | |
dc.identifier.scopus | 2-s2.0-84884587855 | |
dc.identifier.uri | https://doi.org/10.1016/j.ejor.2013.08.001 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14288/17134 | |
dc.identifier.wos | 325598800006 | |
dc.keywords | Multiple objective programming | |
dc.keywords | Integer programming | |
dc.keywords | Efficient set | |
dc.keywords | Epsilon-constraint method | |
dc.keywords | Epsilon-constraint method | |
dc.keywords | Combinatorial optimization | |
dc.keywords | Solve | |
dc.language.iso | eng | |
dc.publisher | Elsevier Science Bv | |
dc.relation.ispartof | European Journal Of Operational Research | |
dc.subject | Management | |
dc.subject | Operations research | |
dc.subject | Management science | |
dc.title | A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems | |
dc.type | Journal Article | |
dspace.entity.type | Publication | |
local.contributor.kuauthor | Kirlik, Gökhan | |
local.contributor.kuauthor | Sayın, Serpil | |
local.publication.orgunit1 | GRADUATE SCHOOL OF SCIENCES AND ENGINEERING | |
local.publication.orgunit1 | College of Administrative Sciences and Economics | |
local.publication.orgunit2 | Department of Business Administration | |
local.publication.orgunit2 | Graduate School of Sciences and Engineering | |
relation.isOrgUnitOfPublication | ca286af4-45fd-463c-a264-5b47d5caf520 | |
relation.isOrgUnitOfPublication | 3fc31c89-e803-4eb1-af6b-6258bc42c3d8 | |
relation.isOrgUnitOfPublication.latestForDiscovery | ca286af4-45fd-463c-a264-5b47d5caf520 | |
relation.isParentOrgUnitOfPublication | 972aa199-81e2-499f-908e-6fa3deca434a | |
relation.isParentOrgUnitOfPublication | 434c9663-2b11-4e66-9399-c863e2ebae43 | |
relation.isParentOrgUnitOfPublication.latestForDiscovery | 972aa199-81e2-499f-908e-6fa3deca434a |