Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/90807
Title: Bidirectional branch and bound for controlled variable selection Part I : principles and minimum singular value criterion
Authors: Cao, Yi
Kariwala, Vinay
Keywords: DRNTU::Engineering::Chemical engineering
DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering
DRNTU::Science::Mathematics::Applied mathematics::Optimization
Issue Date: 2008
Source: Cao, Y., & Kariwala, V. (2008). Bidirectional branch and bound for controlled variable selection part I : principles and minimum singular value criterion. Computers and Chemical Engineering, 32(10), 2306-2319.
Series/Report no.: Computers and chemical engineering
Abstract: The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-scale problems is difficult, as all feasible measurement subsets need to be evaluated to find the optimal solution. In this paper, a new and efficient branch and bound (BAB) method for selection of CVs using the MSV rule is proposed by posing the problem as a subset selection problem. In traditional BAB algorithms for subset selection problems, pruning is performed downwards (gradually decreasing subset size). In this work, the branch pruning is considered in both upward (gradually increasing subset size) and downward directions simultaneously so that the total number of subsets evaluated is reduced dramatically. Furthermore, a novel bidirectional branching strategy to dynamically branch solution trees for subset selection problems is also proposed, which maximizes the number of nodes associated with the branches to be pruned. Finally, by replacing time-consuming MSV calculations with novel determinant based conditions, the efficiency of the bidirectional BAB algorithm is increased further. Numerical examples show that with these new approaches, the CV selection problem can be solved incredibly fast.
URI: https://hdl.handle.net/10356/90807
http://hdl.handle.net/10220/4513
ISSN: 0098-1354
DOI: 10.1016/j.compchemeng.2007.11.011
Schools: School of Chemical and Biomedical Engineering 
Rights: Computers & Chemical Engineering Copyright © 2007 Elsevier Ltd. All rights reserved. The Journal's web site is located at http://www.sciencedirect.com/science/journal/00981354
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCBE Journal Articles

Files in This Item:
File Description SizeFormat 
BB SOC P1.pdfSubmitted version342.8 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 5

72
Updated on Mar 15, 2024

Web of ScienceTM
Citations 5

52
Updated on Oct 25, 2023

Page view(s) 1

1,527
Updated on Mar 18, 2024

Download(s) 5

824
Updated on Mar 18, 2024

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.