Kidd, Martin Philip

Larsen, Jesper

Lusby, Richard Martin

The nondominated frontier of a multiobjective optimization problem can be overwhelming to a decision maker, as it is often either very large or infinite in size. Instead, a discrete representation of this set in the form of a small sample of points is often preferred. In this paper we consider the Discrete Representation Problem (DRP), which is itself a triobjective optimization problem. The three objectives comprise three standard quality measures for discrete representations, namely coverage, uniformity and the cardinality of the set. We introduce the notion of complete equidistant representations, and prove that such a representation provides a nondominated solution to the DRP. In addition, we show through the help of complete equidistant representations that coverage and uniformity can be seen as dual problems given a fixed cardinality, and therefore that optimality gaps for coverage and uniformity can be obtained given any representation. Moreover, even though the definition of the coverage error requires the full nondominated set, we show how the coverage error for a given representation can be calculated by generating a much smaller set. Finally, we present a new method for finding discreterepresentations of a desired cardinality that outperforms existing methods w.r.t. coverage and uniformity on a set of mixed-integer programming benchmark instances

Online Research Database In Technology

  General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.   Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal  If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.         Downloaded from orbit.dtu.dk on: Mar 30, 2019Equidistant representations: connecting coverage and uniformity in biobjectiveoptimizationKidd, Martin Philip; Lusby, Richard Martin ; Larsen, JesperPublication date:2018Document VersionPeer reviewed versionLink back to DTU OrbitCitation (APA):Kidd, M. P., Lusby, R. M., & Larsen, J. (2018). Equidistant representations: connecting coverage and uniformityin biobjective optimization. Paper presented at Recent Advanced in Multiobjective Optimization, workshop 2018,Nantes, France.Equidistant representations: connecting coverage and uniformityin biobjective optimizationMartin P. Kidd, Richard M. Lusby & Jesper LarsenDivison of Management Science, Technical University of DenmarkThe nondominated frontier of a multiobjective optimization problem can be overwhelmingto a decision maker, as it is often either very large or infinite in size. Instead, a discrete repre-sentation of this set in the form of a small sample of points is often preferred. In this paper weconsider the Discrete Representation Problem (DRP), which is itself a triobjective optimizationproblem. The three objectives comprise three standard quality measures for discrete represen-tations, namely coverage, uniformity and the cardinality of the set. We introduce the notionof complete equidistant representations, and prove that such a representation provides a non-dominated solution to the DRP. In addition, we show through the help of complete equidistantrepresentations that coverage and uniformity can be seen as dual problems given a fixed car-dinality, and therefore that optimality gaps for coverage and uniformity can be obtained givenany representation. Moreover, even though the definition of the coverage error requires the fullnondominated set, we show how the coverage error for a given representation can be calcu-lated by generating a much smaller set. Finally, we present a new method for finding discreterepresentations of a desired cardinality that outperforms existing methods w.r.t. coverage anduniformity on a set of mixed-integer programming benchmark instances.1

Equidistant representations: connecting coverage and uniformity in biobjective optimization

http://orbit.dtu.dk/ws/files/163230729/ramoo_abstract_kidd.pdf

Equidistant representations: connecting coverage and uniformity in biobjective optimization

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology