On finding representative non-dominated points for bi-objective integer network flow problems |
| |
Affiliation: | 1. School of Computer, South China Normal University, 510631, China\n;2. Department of Computer Science, Missouri University of Science and Technology, Rolla, U.S.A.;3. Department of Telematic Engineering, University Carlos III of Madrid, Leganés, Madrid, Spain |
| |
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 Bi-objective network flow problem Representation |
本文献已被 ScienceDirect 等数据库收录! |
|