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

doi:10.1016/j.cor.2014.02.009

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

2014-08-01

34

PRE

AI

DOI：10.1016/j.cor.2014.02.009

原文链接

原文求助

摘要

En 中文

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 epsilon-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 epsilon-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. (C) 2014 Elsevier Ltd. All rights reserved.

Keyword:

Multi-objective optimisation

Network optimisation

Integer programming

epsilon-Constraint method

Bi-objective network flow problem

Representation

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

摘要

AI总结

期刊

机构