Show simple item record

dc.contributor.authorGaland, Lucie
dc.date.accessioned2011-04-28T10:03:15Z
dc.date.available2011-04-28T10:03:15Z
dc.date.issued2006
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/6086
dc.language.isoenen
dc.subjectmultiobjective optimisations
dc.subjectpath planning
dc.subjectgraphs
dc.subjecttrees
dc.subjectinteractive approaches
dc.subjectdecision making
dc.subject.ddc003en
dc.titleInteractive Search for Compromise Solutions in Multicriteria Graph Problems
dc.typeCommunication / Conférence
dc.description.abstractenIn this paper, the purpose is to adapt classical interactive methods to multicriteria combinatorial problems in order to explore the non-dominated solutions set. We propose an interactive procedure alternating a calculation stage determining the current best compromise solution and a dialogue stage allowing decision maker to specify his/her preferences. For the calculation stage, we propose an efficient procedure which relies on algorithms providing k-best solutions of a scalarized version of the problem. Moreover, we show how to exploit previous iterations to speed-up the interactive process. We provide numerical experiments of our method on multicriteria shortest path and spanning tree problems.
dc.identifier.citationpages302
dc.relation.ispartoftitle9th Ifac Symposium on Automated Systems Based on Human Skill and Knowledge 2006
dc.relation.ispartofeditorStahre, Johan
dc.relation.ispartofpublnameCurran Associates Inc.
dc.relation.ispartofdate2006
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn1605607339
dc.relation.confcountryFRANCE
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2016-09-09T16:25:09Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record