Interactive Search for Compromise Solutions in Multicriteria Graph Problems
Galand, Lucie (2006), Interactive Search for Compromise Solutions in Multicriteria Graph Problems, in Stahre, Johan, 9th Ifac Symposium on Automated Systems Based on Human Skill and Knowledge 2006, Curran Associates Inc., p. 302
TypeCommunication / Conférence
Book title9th Ifac Symposium on Automated Systems Based on Human Skill and Knowledge 2006
Book authorStahre, Johan
MetadataShow full item record
Abstract (EN)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.
Subjects / Keywordsmultiobjective optimisations; path planning; graphs; trees; interactive approaches; decision making
Showing items related by title and author.
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem Belhoul, Lyes; Galand, Lucie; Vanderpooten, Daniel (2014) Article accepté pour publication ou publié
Bidirectional versus Unidirectional Heuristic Search for Multiojective Optimization in State Space Graphs Galand, Lucie; Ismaili, Anisse; Perny, Patrice; Spanjaard, Olivier (2013) Communication / Conférence