Home > Research > Publications & Outputs > On finding representative non-dominated points ...

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to journalJournal article

Published

Standard

On finding representative non-dominated points for bi-objective integer network flow problems. / Eusébio, Augusto; Figueira, José Rui; Ehrgott, Matthias.

In: Computers and Operations Research, Vol. 48, 01.08.2014, p. 1-10.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Eusébio, Augusto ; Figueira, José Rui ; Ehrgott, Matthias. / On finding representative non-dominated points for bi-objective integer network flow problems. In: Computers and Operations Research. 2014 ; Vol. 48. pp. 1-10.

Bibtex

@article{9b624ae574854033b81874f4761445c9,
title = "On finding representative non-dominated points for bi-objective integer network flow problems",
abstract = "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.",
keywords = "Multi-objective optimisation, Network optimisation, Integer programming, ε-Constraint method, Bi-objective network flow problem, Representation",
author = "Augusto Eus{\'e}bio and Figueira, {Jos{\'e} Rui} and Matthias Ehrgott",
year = "2014",
month = aug,
day = "1",
doi = "10.1016/j.cor.2014.02.009",
language = "English",
volume = "48",
pages = "1--10",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",

}

RIS

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 -