Please use this identifier to cite or link to this item:
|Title:||Branch and bound method for multiobjective pairing selection||Authors:||Kariwala, Vinay
|Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering||Issue Date:||2010||Source:||Kariwala, V., & Cao, Y. (2010). Branch and bound method for multiobjective pairing selection. Automatica, 46(5), 932-936.||Series/Report no.:||Automatica||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 µ-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.||URI:||https://hdl.handle.net/10356/91468
|Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCBE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.