A DC programming approach for planning a multisensor multizone search for a target

详细信息    查看全文

• 作者：Hoai An Le Thi ; Duc Manh Nguyen ; Tao Pham Dinh
• 关键词：Search theory ; Hierarchical optimization ; Combinatorial optimization ; DC programming and DCA ; Nonlinear mixed 0&ndash ; 1 programming ; Exact penalty
• 刊名：Computers and Operations Research
• 出版年：2014
• 出版时间：January, 2014
• 年：2014
• 卷：41
• 期：Complete
• 页码：231-239
• 全文大小：1063 K

文摘

In this paper, we consider a well-known problem in the general area of search theory: planning a multisensor in multizone search so as to maximize the probability of detection of a target under a given resource effort to be shared. We propose a new optimization model that is a nonlinear mixed 0-1 programming problem. This problem is then reformulated as a DC (Difference of Convex) functions program via an exact penalty technique. DC programming and DCA (DC algorithm) have been investigated for solving the resulting DC program. Numerical experiments demonstrate the efficiency and the superiority of the proposed algorithm in comparison with the existing method.