Show simple item record

dc.contributor.authorBelhoul, Lyes*
dc.contributor.authorGaland, Lucie*
dc.contributor.authorVanderpooten, Daniel*
dc.date.accessioned2015-04-14T17:15:44Z
dc.date.available2015-04-14T17:15:44Z
dc.date.issued2014
dc.identifier.issn0305-0548
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/14932
dc.language.isoenen
dc.subjectBranch and bound
dc.subjectMulti-objective assignment problem
dc.subjectk-best algorithm
dc.subjectCompromise solutions
dc.subject.ddc003en
dc.titleAn efficient procedure for finding best compromise solutions to the multi-objective assignment problem
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn this paper, we consider the problem of determining a best compromise solution for the multi-objective assignment problem. Such a solution minimizes a scalarizing function, such as the weighted Tchebychev norm or reference point achievement functions. To solve this problem, we resort to a ranking (or k-best) algorithm which enumerates feasible solutions according to an appropriate weighted sum until a condition, ensuring that an optimal solution has been found, is met. The ranking algorithm is based on a branch and bound scheme. We study how to implement efficiently this procedure by considering different algorithmic variants within the procedure: choice of the weighted sum, branching and bounding schemes. We present an experimental analysis that enables us to point out the best variants, and we provide experimental results showing the remarkable efficiency of the procedure, even for large size instances.
dc.relation.isversionofjnlnameComputers and Operations Research
dc.relation.isversionofjnlvol49
dc.relation.isversionofjnldate2014
dc.relation.isversionofjnlpages97-106
dc.relation.isversionofdoi10.1016/j.cor.2014.03.016
dc.relation.isversionofjnlpublisherElsevier
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewedoui
dc.date.updated2016-09-09T16:20:30Z
hal.person.labIds989*
hal.person.labIds989*
hal.person.labIds989*
hal.identifierhal-01504861*


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record