1547-5905/asset/AIC_left.gif?v=1&s=43a3d567c64d3d5d712c0af6c2cacb1e1bcc1a2b)
1547-5905/asset/AIC_right.gif?v=1&s=518efadeedca9ceeef271499f690fdebd2ed9164)
Process Systems Engineering
New efficient breadth-first/level traversal tree search method for the design and upgrade of sensor networks
Article first published online: 21 JUN 2010
DOI: 10.1002/aic.12332
Copyright © 2010 American Institute of Chemical Engineers (AIChE)
1547-5905/asset/cover.gif?v=1&s=3d1276953963f4e484c1215cd7884fd5fbdaf6ee "AIChE Journal")
Additional Information
How to Cite
Nguyen, D. Q. and Bagajewicz, M. J. (2011), New efficient breadth-first/level traversal tree search method for the design and upgrade of sensor networks. AIChE J., 57: 1302–1309. doi: 10.1002/aic.12332
Publication History
- Issue published online: 12 APR 2011
- Article first published online: 21 JUN 2010
- Accepted manuscript online: 21 JUN 2010 12:00AM EST
- Manuscript Revised: 2 MAY 2010
- Manuscript Received: 24 OCT 2009
- Abstract
- Article
- References
- Cited By
Keywords:
- instrumentation design;
- instrumentation upgrade
Abstract
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