A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences

Nawal Benabbou
Thibaut Lust

Abstract

We consider multi-objective combinatorial optimization problems where preferences can be represented by a parameterized scalarizing function that is linear in its parameters. Assuming that the parameters are initially not known, we iteratively collect preference information from the decision maker until being able to identify her preferred solution. To obtain informative preference information, we ask the decision maker to compare two promising solutions generated using the extreme points of the polyhedron representing the admissible parameters. Moreover, our stopping criterion guarantees that the returned solution is optimal (or near-optimal) according to the decision maker's preferences. Finally, we provide numerical results to demonstrate the practical efficiency of our approach.
Fichier principal
Vignette du fichier
SOCS2019__extended_abstract_.pdf (162.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02163751 , version 1 (24-06-2019)

Identifiers

  • HAL Id : hal-02163751 , version 1

Cite

Nawal Benabbou, Thibaut Lust. A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences. The International Symposium on Combinatorial Search (SoCS'19), Jul 2019, Napa, United States. ⟨hal-02163751⟩
77 View
43 Download

Share

Gmail Facebook X LinkedIn More