Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6894445 | European Journal of Operational Research | 2018 | 27 Pages |
Abstract
In this paper we present the modified augmented weighted Tchebychev norm, which can be used to generate a complete efficient set of solutions to a discrete multi-objective optimization problem. We contribute a generating algorithm that will, without supervision, generate the entire non-dominated set for any number of objectives. To our knowledge, this is the first generating method for general discrete multi-objective problems that uses a variant of the Tchebychev norm. In a computational study, our algorithm's running times are comparable to previously proposed algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Tim Holzmann, J.C. Smith,