Adapting Polyhedral Dominance Cones to Ordinal Preference Structures
Kathrin Klamroth, Michael Stiglmayr, Julia Sudhoff Santos

TL;DR
This paper introduces a method to incorporate partial preference information into ordinal optimization by enlarging the dominance cone, resulting in more relevant solutions for problems like safest path routing.
Contribution
It extends the ordinal dominance cone using preference weights, making the problem suitable for standard multi-objective optimization techniques.
Findings
Weighted ordinal ordering cone is polyhedral.
Linear transformation links to multi-objective optimization.
Application to safest path problem demonstrates practical relevance.
Abstract
In combinatorial optimization, ordinal costs can be used to model the quality of elements whenever numerical values are not available. When considering, for example, routing problems for cyclists, the safety of a street can be ranked in ordered categories like safe (separate bike lane), medium safe (street with a bike lane) and unsafe (street without a bike lane). However, ordinal optimization may suggest unrealistic solutions with huge detours to avoid unsafe street segments. In this paper, we investigate how partial preference information regarding the relative quality of the ordinal categories can be used to improve the relevance of the computed solutions. By introducing preference weights which describe how much better a category is at least or at most, compared to the subsequent category, we enlarge the ordinal dominance cone. This leads to a smaller set of alternatives, i. e., of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Vehicle Routing Optimization Methods · Advanced Multi-Objective Optimization Algorithms
