Publication:
Algorithm robust for the bicriteria discrete optimization problem - Heuristic variations and computational evidence

dc.contributor.coauthorKouvelis, Panos
dc.contributor.departmentDepartment of Business Administration
dc.contributor.kuauthorSayın, Serpil
dc.contributor.schoolcollegeinstituteCollege of Administrative Sciences and Economics
dc.date.accessioned2024-11-09T22:57:59Z
dc.date.issued2006
dc.description.abstractWe apply Algorithm Robust to various problems in multiple objective discrete optimization. Algorithm Robust is a general procedure that is designed to solve bicriteria optimization problems. The algorithm performs a weight space search in which the weights are utilized in min-max type subproblems. In this paper, we experiment with Algorithm Robust on the bicriteria knapsack problem, the bicriteria assignment problem, and the bicriteria minimum cost network flow problem. We look at a heuristic variation that is based on controlling the weight space search and has an indirect control on the sample of efficient solutions generated. We then study another heuristic variation which generates samples of the efficient set with quality guarantees. We report results of computational experiments.
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.issue1
dc.description.openaccessNO
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.volume147
dc.identifier.doi10.1007/s10479-006-0062-3
dc.identifier.eissn1572-9338
dc.identifier.issn0254-5330
dc.identifier.quartileQ2
dc.identifier.scopus2-s2.0-33749328712
dc.identifier.urihttps://doi.org/10.1007/s10479-006-0062-3
dc.identifier.urihttps://hdl.handle.net/20.500.14288/7649
dc.identifier.wos240895100005
dc.keywordsMultiple objective
dc.keywordsOptimization
dc.keywordsRobust optimization
dc.keywordsEfficient set
dc.keywordsBicriteria discrete optimization
dc.keywordsProgramming problem
dc.keywordsInterval data
dc.keywordsInteger
dc.keywordsAssignment
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofAnnals of Operations Research
dc.subjectOperations research and management science
dc.titleAlgorithm robust for the bicriteria discrete optimization problem - Heuristic variations and computational evidence
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorSayın, Serpil
local.publication.orgunit1College of Administrative Sciences and Economics
local.publication.orgunit2Department of Business Administration
relation.isOrgUnitOfPublicationca286af4-45fd-463c-a264-5b47d5caf520
relation.isOrgUnitOfPublication.latestForDiscoveryca286af4-45fd-463c-a264-5b47d5caf520
relation.isParentOrgUnitOfPublication972aa199-81e2-499f-908e-6fa3deca434a
relation.isParentOrgUnitOfPublication.latestForDiscovery972aa199-81e2-499f-908e-6fa3deca434a

Files