Finding non-dominated solutions in bi-objective integer network flow problems
Eusebio, Augusto; Figueira, José (2009), Finding non-dominated solutions in bi-objective integer network flow problems, Computers and Operations Research, 36, 9, p. 2554–2564. http://dx.doi.org/10.1016/j.cor.2008.11.001
TypeArticle accepté pour publication ou publié
Journal nameComputers and Operations Research
MetadataShow full item record
Abstract (EN)This paper deals with an algorithm for finding all the non-dominated solutions and corresponding efficient solutions for bi-objective integer network flow problems. The algorithm solves a sequence of ɛɛ-constraint problems and computes all the non-dominated solutions by decreasing order of one of the objective functions. The optimal integer solutions for the ɛɛ-constraint problems are determined by exploring a branch-and-bound tree. The algorithm makes use of the network structure to perform the computations, i.e., the network structure of the problem is not destroyed with the inclusion of an ɛɛ-constraint. This paper presents the main features of the algorithm, the theoretical bases of the proposed approach and some computational issues. Experiments were done and the results are also reported in the paper.
Subjects / KeywordsBi-objective integer network flows; Network simplex algorithm; Efficient solutions; Non-dominated solutions
Showing items related by title and author.
Figueira, José; Paquete, Luis; Simoes, Marco; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels Bazgan, Cristina; Jamain, Florian; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié