Modelling diversity of solutions

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

Abstract

For many combinatorial problems, finding a single solution is not enough. This is clearly the case for multi-objective optimization problems, as they have no single “best solution” and, thus, it is useful to find a representation of the non-dominated solutions (the Pareto frontier). However, it also applies to single objective optimization problems, where one may be interested in finding several (close to) optimal solutions that illustrate some form of diversity. The same applies to satisfaction problems. This is because models usually idealize the problem in some way, and a diverse pool of solutions may provide a better choice with respect to considerations that are omitted or simplified in the model. This paper describes a general framework for finding k diverse solutions to a combinatorial problem (be it satisfaction, single-objective or multi-objective), various approaches to solve problems in the framework, their implementations, and an experimental evaluation of their practicality.
Original languageEnglish
Title of host publicationThe Thirty-Fourth AAAI Conference on Artificial Intelligence
EditorsVincent Conitzer, Fei Sha
Place of PublicationPalo Alto CA USA
PublisherAssociation for the Advancement of Artificial Intelligence (AAAI)
Pages1528-1535
Number of pages8
Volume34
Edition2
ISBN (Electronic)9781577358350
DOIs
Publication statusPublished - 2020
EventAAAI Conference on Artificial Intelligence 2020 - New York, United States of America
Duration: 7 Feb 202012 Feb 2020
Conference number: 34th
https://aaai.org/Conferences/AAAI-20/ (Website)

Publication series

NameAAAI Conference on Artificial Intelligence
PublisherAAAI Press
Number2
Volume34
ISSN (Print)2159-5399
ISSN (Electronic)2374-3468

Conference

ConferenceAAAI Conference on Artificial Intelligence 2020
Abbreviated titleAAAI-20
CountryUnited States of America
CityNew York
Period7/02/2012/02/20
Internet address

Cite this