mirage

Bidirectional branch and bound for controlled variable selection Part I : principles and minimum singular value criterion.

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Bidirectional branch and bound for controlled variable selection Part I : principles and minimum singular value criterion.

Show simple item record

dc.contributor.author Cao, Yi.
dc.contributor.author Kariwala, Vinay.
dc.date.accessioned 2009-03-09T06:47:33Z
dc.date.available 2009-03-09T06:47:33Z
dc.date.copyright 2008
dc.date.issued 2009-03-09T06:47:33Z
dc.identifier.citation 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.
dc.identifier.issn 0098-1354
dc.identifier.uri http://hdl.handle.net/10220/4513
dc.description.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.
dc.format.extent 31 p.
dc.language.iso en
dc.relation.ispartofseries Computers and chemical engineering
dc.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
dc.subject DRNTU::Engineering::Chemical engineering.
dc.subject DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering.
dc.subject DRNTU::Science::Mathematics::Applied mathematics::Optimization.
dc.title Bidirectional branch and bound for controlled variable selection Part I : principles and minimum singular value criterion.
dc.type Journal Article
dc.contributor.school School of Chemical and Biomedical Engineering
dc.identifier.doi http://dx.doi.org/10.1016/j.compchemeng.2007.11.011
dc.description.version Accepted version

Files in this item

Files Size Format View Description
BB SOC P1.pdf 351.0Kb PDF View/Open Submitted version

This item appears in the following Collection(s)

Show simple item record

Statistics

Total views

All Items Views
Bidirectional branch and bound for controlled variable selection Part I : principles and minimum singular value criterion. 561

Total downloads

All Bitstreams Views
BB SOC P1.pdf 307

Top country downloads

Country Code Views
United States of America 119
China 43
Singapore 40
Russian Federation 16
Ukraine 9

Top city downloads

city Views
Mountain View 56
Singapore 40
Beijing 17
Bellevue 7
Redmond 7

Downloads / month

  2014-05 2014-06 2014-07 total
BB SOC P1.pdf 0 0 11 11