| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 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. | 538.71 KB | Adobe PDF |
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
Multi-objective optimisation Network optimisation Integer programming ε-Constraint method Bi-objective network flow problem Representation
Contexto Educativo
Citação
A. Eusébio, J.R. Figueira, M. Ehrgott, On finding representative non-dominated points for bi-objective integer network flow problems, Computers & Operations Research, Volume 48, 2014, Pages 1-10, ISSN 0305-0548, https://doi.org/10.1016/j.cor.2014.02.009.
Editora
Elsevier
