Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6896227 | European Journal of Operational Research | 2016 | 4 Pages |
Abstract
This note finds and resolves a compounding problem in the interactive multi-objective optimization method developed by Park and Shin (2012). The compounding problem means that the algorithm generates a solution unexpected by the decision maker. A concrete example of the compounding problem is demonstrated and, to remove the problem, an improved algorithm is then developed. We also show that the improved algorithm converges to the known optimal solutions faster than the earlier algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
K. Sam Park, Pyoungsoo Lee,