TY - JOUR

T1 - On finding representative non-dominated points for bi-objective integer network flow problems

AU - Eusébio, Augusto

AU - Figueira, José Rui

AU - Ehrgott, Matthias

PY - 2014/8/1

Y1 - 2014/8/1

N2 - This paper proposes a new algorithm to find a representation of the set of all non-dominated points of the bi-objective integer network flow problem. The algorithm solves a sequence of ε-constraint problems with a branch-and-bound algorithm to find a subset of non-dominated points that represents the set of all non-dominated points well in the sense of coverage or uniformity. At each iteration of the algorithm, one non-dominated point, determined by solving one ε-constraint problem, is added to the representation until it is guaranteed that the representation has the desired quality. Computational experiments on different problem types show the efficacy of the algorithm.

AB - This paper proposes a new algorithm to find a representation of the set of all non-dominated points of the bi-objective integer network flow problem. The algorithm solves a sequence of ε-constraint problems with a branch-and-bound algorithm to find a subset of non-dominated points that represents the set of all non-dominated points well in the sense of coverage or uniformity. At each iteration of the algorithm, one non-dominated point, determined by solving one ε-constraint problem, is added to the representation until it is guaranteed that the representation has the desired quality. Computational experiments on different problem types show the efficacy of the algorithm.

KW - Multi-objective optimisation

KW - Network optimisation

KW - Integer programming

KW - ε-Constraint method

KW - Bi-objective network flow problem

KW - Representation

U2 - 10.1016/j.cor.2014.02.009

DO - 10.1016/j.cor.2014.02.009

M3 - Journal article

VL - 48

SP - 1

EP - 10

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -