Combining local search and elicitation for multi-objective combinatorial optimization

DOI10.1007/978-3-030-31489-7_1MaRDI QIDQ2290362zbMATH OpenOpenAlexFDO

Authors Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny

Publication date 27 January 2020

Full work available at URL https://hal.sorbonne-universite.fr/hal-02170910/file/ADT.pdf

zbMATH Keywords

local searchminimax regretmulti-objective combinatorial optimizationpreference elicitationtraveling salesman problem

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Individual preferences (91B08)

Recommendations

• An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information
• Multiobjective combinatorial optimization: some approaches
• Preference modelling by estimating local utility functions for multiobjective optimization
• scientific article; zbMATH DE number 2159075
• On local optima in multiobjective combinatorial optimization problems

Cites work

• A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid
• A method for solving traveling-salesman problems
• Approximation algorithms for the traveling salesman problem
• Constraint-based optimization and utility elicitation using the minimax decision criterion
• Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
• Generating a representative subset of the nondominated frontier in multiple criteria decision making
• Generating random vectors uniformly distributed inside and on the surface of different regions
• Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems
• Learning monotone nonlinear models using the Choquet integral
• LP solvable models for multiagent fair allocation problems
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• On possibly optimal tradeoffs in multicriteria spanning tree problems
• On solving linear programs with the ordered weighted averaging objective.
• On spanning tree problems with multiple objectives
• Preference learning: An introduction
• Solving multi-agent knapsack problems using incremental approval voting
• Theory of capacities
• Weighted sum model with partial preference information: application to multi-objective optimization

Cited in

(3)

• Combining the scalability of local search with the pruning techniques of systematic search
• A decomposition based minimax regret approach for inverse multiple criteria sorting problem
• An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information

This page was built for publication: Combining local search and elicitation for multi-objective combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290362)