.png){kind=icon}
Return
On finding representative non-dominated points for bi-objective integer network flow problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2014.02.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Multi-objective optimisation
Network optimisation
Integer programming
epsilon-Constraint method
Bi-objective network flow problem
Representation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave no more
no more