Premium
New efficient breadth‐first/level traversal tree search method for the design and upgrade of sensor networks
Author(s) -
Nguyen Duy Quang,
Bagajewicz Miguel J.
Publication year - 2011
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.12332
Subject(s) - tree traversal , upgrade , breadth first search , tree (set theory) , mathematical optimization , exploit , computer science , integer programming , search tree , integer (computer science) , search algorithm , algorithm , mathematics , mathematical analysis , computer security , programming language , operating system
This work studies the problem of optimally locating sensors for monitoring chemical processes, formally known as the sensor network design and upgrade problem. This problem is an integer programming problem and has been solved to global optimality only using tree search methods using depth‐first strategy. In this article, we exploit certain cost properties of the different nodes in the tree to efficiently prune nonoptimal nodes using a breadth‐first/level traversal tree search method to obtain the global optimum. We show that this strategy allows cutting considerably the computational time for problems that the depth‐first strategy was inefficient. © 2010 American Institute of Chemical Engineers AIChE J, 2010