Skip to Main content Skip to Navigation
Conference papers

Interactive search for compromise solutions in multicriteria graph problems

Lucie Galand 1
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Lip6 Publications <>
Submitted on : Tuesday, June 28, 2016 - 10:07:59 AM
Last modification on : Thursday, January 21, 2021 - 11:38:02 AM

Links full text



Lucie Galand. Interactive search for compromise solutions in multicriteria graph problems. 9th IFAC Symposium on Automated Systems Based on Human Skill And Knowledge 22-25 mai, May 2006, Nancy, France. pp.129-134, ⟨10.3182/20060522-3-FR-2904.00021⟩. ⟨hal-01338195⟩



Record views