Branch-and-price decomposition to design a surveillance system for port and waterway security

IEEE Transactions on Automation Science and Engineering

Volumn 7, Issue 2, 2010, Pages 316-325

  Wilhelm, Wilbert E ^a   Gokce, Elif I ^a  

^a Texas A and M University   (United States)

Author keywords

Branch and price; Homeland security; Integer programming; Port and waterway surveillance

Indexed keywords

BRANCH AND PRICE; COMMERCIAL SOLVERS; DECOMPOSITION APPROACH; HOME LAND SECURITY; HOUSTON; IMPLEMENTATION TECHNIQUES; INTEGER PROGRAM; RUNTIMES; SHIP CHANNELS; SURVEILLANCE SYSTEMS; SYSTEM COSTS; TOTAL COSTS;

COSTS; DYNAMIC PROGRAMMING; EQUIPMENT TESTING; LINEAR PROGRAMMING; MONITORING; SECURITY SYSTEMS; SENSORS;

INTEGER PROGRAMMING;

EID: 77950858917     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2008.2011563     Document Type: Article

References (41)

1. J. Berry,W. E. Hart, C. A. Phillips, and J. Uber, "A general integer-programming- based framework for sensor placement in municipal water networks," in Proc. 6th Annu. Symp. Water Distribution Syst. Anal., 2004, pp. 1-10.
2. I. F. Akyildiz, W. Su, Y. Sankarsubramaniam, and E. Cayirci, "Wireless sensor networks: A survey," Comput. Netw., vol.38, pp. 393-422, 2002.
3. Y. Zou and K. Chakrabarty, "A distributed coverage and connectivity centric technique for selecting active nodes in wireless sensor networks," IEEE Trans. Comput., vol.54, no.8, pp. 978-991, Aug. 2005.
4. D. P. Morton, F. Pan, and K. J. Saeger, "Models for nuclear smuggling interdiction," IIE Transactions, vol.39, no.1, pp. 3-14, 2007.
5. V. Kharchenko and V. Vasylyev, "Application of the intellectual decision making system for vessel traffic control," in Proc. 14th Int. Conf. Microwav., Radar, Wireless Commun., 2002, vol.2, pp. 639-642.
6. T. Ben-Zvi and J. Nickerson, "Sensor placement learning automata," in Proc. INFORMS Int. Conf., Puerto Rico, 2007, p. 67.
7. A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson, "Wireless sensor networks for habitat monitoring," in Proc. 1st ACM Int. Workshop Wireless Sens. Netw. Applicat., 2002, pp. 88-97.
8. D. Clark, "Low-Cost Device for Monitoring is Set for Market," Wall Street Journal, Sep. 20, 2004, .
9. A. M. Fernandes, A. B. Utkin, and A. V. Lavrov, "Optimisation of location and number of lidar apparatuses for early forest fire detection in hilly terrain," Fire Safety J., vol.41, no.2, pp. 144-154, 2006.
10. R. Pandit and P. M. Ferreira, "Determination of minimum number of sensors and their locations for an automated facility-An algorithmic approach," Eur. J. Oper. Res., vol.63, no.2, pp. 231-239, 1992.
11. A. Bottino and A. Laurentini, A. Sanfeliu, Ed. et al., "Optimal positioning of sensors in 2-D," in Proc. CIARP'04 LNCS 3287, 2004, pp. 53-58.
12. A. Bottino and A. Laurentini, M. Lazo and A. Sanfeliu, Eds., "Optimal positioning of sensors in 3-D," in Proc. CIARP'05 LNCS 3773, 2005, pp. 804-812.
13. K. Chakrabarty, S. S. Iyengar, H. Qi, and H. E. Cho, "Grid coverage for surveillance and target location in distributed sensor networks," IEEE Trans. Comput., vol.51, no.12, pp. 1448-1453, Dec. 2002.
14. F. Y. S. Lin and P. L. Chiu, "A near-optimal sensor placement algorithm to achieve complete coverage/discrimination in sensor networks," IEEE Commun. Lett., vol.9, no.1, pp. 43-45, Jan. 2005.
15. H. S. Kim and S. Park, "An optimal algorithm for the sensor location problem to cover sensor networks," in Proc. KIIE/KORMS 2006 Spring Combined Conf., KAIST, Daejeon, Korea, May 19-20, 2006, pp. 1-8.
16. J. H. Park, G. Friedman, and M. Jones, "Geographical feature sensitive sensor placement," J. Parallel Distrib. Comput., vol.64, pp. 815-825, 2004.
17. J. Wang and N. Zhong, "Efficient point coverage in wireless sensor networks," J. Combinatorial Optim., vol.11, no.3, pp. 291-304, 2006. (Pubitemid 43724063)
18. T. Cavalier,W. Conner, E. del Castillo, and S. Brown, "Heuristic algorithm for minimax sensor location in the plane," Eur. J. Operat. Res., vol.183, no.1, pp. 42-55, 2006.
19. B. Stefan, Y. Nicola, F. Arnaud, and A. Rumen, "A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem," Eur. J. Operat. Res., vol.186, no.1, pp. 63-76, 2008.
20. W. Shih, "Branch and bound method for the multi-constraint zero-one knapsack problem," J. Operat. Res. Soc., vol.30, no.4, pp. 369-378, 1979.
21. M. A. Osorio, F. Glover, and P. Hammer, "Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions," Ann. Operat. Res., vol.117, pp. 71-93, 2002. (Pubitemid 38117768)
22. Y. Toyoda, "A simplified algorithm for obtaining approximate solution to zero-one programming problems," Manage. Sci., vol.21, pp. 1417-1427, 1975.
23. P. Chardaire, G. P. McKeown, and J. A. Maki, "Application of GRASP to the multiconstraint knapsack problem," Proc. Lecture Notes In Computer Science, vol.2037, pp. 30-39, 2001. (Pubitemid 33261152)
24. V. C. Li, G. L. Curry, and E. A. Boyd, "Towards the real time solution of strike force asset allocation problems," Comput. Operat. Res., vol.31, no.2, pp. 273-291, 2004.
25. V. C. Li and G. L. Curry, "Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search," Comput. Operat. Res., vol.32, no.4, pp. 825-848, 2005.
26. V. C. Li, "Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints," Comput. Operat. Res., vol.32, no.11, pp. 2843-2852, 2005.
27. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Berlin, Germany: Springer, 2004.
28. M. Moser, D. P. Jokanovic, and D. N. Shiratori, "An algorithm for the multidimensional multiple-choice knapsack problem," IEECE Trans Fundament Electron., vol.80, no.3, pp. 582-589, 1997.
29. R. Parra-Hernandez, "A newheuristic for solving the multi-choice multidimensional knapsack problem," IEEE Trans. Syst., Man, Cybern.- A: Syst. Humans, vol.35, no.5, pp. 708-717, Sep. 2005. (Pubitemid 41488616)
30. M. Hifi, M. Michrafy, and A. Sbihi, "A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem," Comput. Optimizat. Applicat., vol.33, pp. 271-285, 2006.
31. W. E. Wilhelm, "A technical review of column generation in integer programming," Optimizat. Eng., vol.2, pp. 159-200, 2001.
32. M. Guignard and S. Kim, "Lagrangean decomposition: A model yielding stronger Lagrangean bounds," Math. Program., vol.39, pp. 215-228, 1987. (Pubitemid 18531076)
33. T. A. Feo and M. G. C. Resende, "Greedy randomized adaptive search procedures," J. Global Optimizat., vol.6, no.2, pp. 109-133, 1995.
34. M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows. New York: Wiley-Interscience, 1990.
35. D. Pisinger, "A minimal algorithm for the multiple-choice knapsack problem," Eur. J. Operat. Res., vol.83, pp. 394-410, 1995.
36. Port of Houston, [Online]. Available: http://www.portofhouston.com
37. "Terrorist Attack on USS Cole: Congressional Research Service Report," [Online]. Available: www.fas.org/irp/crs/RL32058.pdf
38. "Esri," [Online]. Available: http://www.esri.com
39. Infrared Camera, [Online]. Available: http://en.wikipedia.org/wiki/ Infrared- camera.
40. Night Vision Camera, [Online]. Available: http://www.nightvision. com.
41. CCTV, [Online]. Available: http://en.wikipedia.org/wiki/Closed-circuit- television.