Using ℓp-norms for fairness in combinatorial optimisation

Bektas, Tolga and Letchford, Adam (2020) Using ℓp-norms for fairness in combinatorial optimisation. Computers and Operations Research, 120. ISSN 0305-0548

[img]
Text (fairness)
fairness.pdf - Accepted Version
Restricted to Repository staff only until 22 October 2021.
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (373kB)

Abstract

The issue of fairness has received attention from researchers in many fields, including combinatorial optimisation. One way to drive the solution toward fairness is to use a modified objective function that involves so-called ℓp-norms. If done in a naive way, this approach leads to large and symmetric mixed-integer nonlinear programs (MINLPs), that may be difficult to solve. We show that, for some problems, one can obtain alternative MINLP formulations that are much smaller, do not suffer from symmetry, and have a reasonably tight continuous relaxation. We give encouraging computational results for certain vehicle routing, facility location and network design problems.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Additional Information:
This is the author’s version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 120, 2020 DOI: 10.1016/j.cor.2020.104975
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700
Subjects:
ID Code:
143385
Deposited By:
Deposited On:
20 Apr 2020 12:15
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Aug 2020 07:24