Header menu link for other important links
X
Branch and bound algorithm for optimal sensor network design
Govind Menon, M. Nabil, Sridharakumar Narasimhan
Published in IFAC Secretariat
2013
Volume: 10
   
Issue: PART 1
Pages: 690 - 695
Abstract
The sensor network design procedure developed by Nabil and Narasimhan (2012), which relates process economics and data reconciliation, involves the formulation of a mixed integer cone program. The solution to this problem yields the globally optimal sensor network. A branch and bound method can be used to find the global optimum; however, for systems with large numbers of variables, this approach may require a large amount of computational effort to find the solution. In this paper, a specialized branch and bound algorithm is proposed for solving the sensor network design problem, which uses certain heuristics to obtain a solution faster. One involves a low rank factorization to reduce the size of the relaxed problem. The other involves an approximation of the global lower bound for the branch and bound solution. The utility of this algorithm is demonstrated on a simple flow network, a small but realistic evaporator system, and a medium sized steam metering network. © IFAC.
About the journal
JournalIFAC Proceedings Volumes (IFAC-PapersOnline)
PublisherIFAC Secretariat
ISSN14746670
Open AccessYes
Concepts (11)
  •  related image
    Algorithms
  •  related image
    Branch and bound method
  •  related image
    Integer programming
  •  related image
    Linear programming
  •  related image
    Sensor networks
  •  related image
    DATA RECONCILIATION
  •  related image
    Global optimum
  •  related image
    MEASUREMENT SELECTIONS
  •  related image
    MIXED INTEGER PROGRAMMING
  •  related image
    OPERATIONAL LOSS
  •  related image
    Process control