期刊名称：International Journal of Distributed Sensor Networks
印刷版ISSN：1550-1329
电子版ISSN：1550-1477
出版年度：2014
卷号：2014
DOI：10.1155/2014/837692
出版社：Hindawi Publishing Corporation
摘要：This paper proposes a new separable model for the sensor locational decision problem covering a line (SLDPCL). By decomposing a multivariate function into several univariate functions, a separable outer approximation methodology that can be used to improve the outer approximation of classical convex programming technique is presented. A novel outer approximation method (OAM) for this proposed separable model is proposed. The algorithm alternates between solving a mixed integer linear program and a convex nonlinear program (NLP). An improved interior point method based on optimal centering parameter is employed to solve the NLP subproblem. The simulation results for test instances that range in size from 10 to 20000 sensors show that the proposed method is fast and robust, and the method is very promising for large-scale SLDPCL problems due to its excellent scalability.
