Branch and bound method for multiobjective pairing selection

Show simple item record Kariwala, Vinay - Cao, Yi - 2011-11-13T23:24:07Z 2011-11-13T23:24:07Z 2010-05-31T00:00:00Z -
dc.identifier.issn 0005-1098 -
dc.identifier.uri -
dc.description.abstract Most of the available methods for selection of input-output pairings for decentralized control require evaluation of all alternatives to find the optimal pairings. As the number of alternatives grows rapidly with process dimensions, pairing selection through an exhaustive search can be computationally forbidding for large-scale processes. Furthermore, the different criteria can be conflicting necessitating pairing selection in a multiobjective optimization framework. In this paper, an efficient branch and bound (BAB) method for multiobjective pairing selection is proposed. The proposed BAB method is illustrated through a biobjective pairing problem using selection criteria involving the relative gain array and the mu-interaction measure. The computational efficiency of the proposed method is demonstrated by using randomly generated matrices and the large-scale case study of cross-direction control. (C) 2010 Elsevier Ltd. All rights reserved. en_UK
dc.language.iso en_UK -
dc.publisher Elsevier Science B.V., Amsterdam. en_UK
dc.subject Computer-aided control system design Decentralized control Global optimization Large-scale systems Multiobjective optimizations Relative gain array Structured singular value decentralized control systems optimization algorithms framework en_UK
dc.title Branch and bound method for multiobjective pairing selection en_UK
dc.type Article -

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search CERES


My Account