A DECOMPOSITION-COORDINATION METHOD FOR COMPLEX MULTI-OBJECTIVE SYSTEMS

摘要

The generation of Pareto optimal solutions for complex systems with multiple conflicting objectives can be easier if the problem can be decomposed and solved as a set of smaller coordinated subproblems. In this paper, a new decomposition-coordination method is proposed, where the global problem is partitioned into subsystems on the basis of the connection structure of the mathematical model, assigning a relative importance to each of them. In order to obtain Pareto optimal solutions for the global system, the aforementioned subproblems are coordinated taking into account their relative importance. The scheme that has been developed is an iterative one, and the global efficient solutions are found through a continuous information exchange process between the coordination level (upper level) and the subsystem level (lower level). Computational experiments on several randomly generated problem instances show that the suggested algorithm produces efficient solutions within reasonable computational times.