检索结果-内蒙古大学图书馆

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

COMPUTERS & OPERATIONS RESEARCH 2014年第Jan.期41卷 231-239页

作者： Hoai An Le Thi Duc Manh Nguyen Tao Pham Dinh Univ Lorraine UFR MIM Lab Theoret & Appl Comp Sci F-57045 Metz France Natl Inst Appl Sci Rouen Math Lab F-76801 St Etienne France

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. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Search theory Hierarchical optimization Combinatorial optimization DC programming and DCA nonlinear mixed 0-1 programming Exact penalty

来源：评论

学校读者我要写书评

暂无评论

A Based-DC programming Approach for Planning a Multisensor Multizone Search for a Moving Target 3rd

A Based-DC Programming Approach for Planning a Multisensor M...

引用

3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO)

作者： Hoai An Le Thi Duc Manh Nguyen Tao Pham Dinh Univ Lorraine UFR MIM Lab Theoret & Appl Comp Sci F-57045 Metz France Hanoi Natl Univ Educ Dept Math & Informat Hanoi Vietnam Natl Inst Appl Sci Rouen Math Lab F-76801 St Etienne France

ISBN: (纸本)9783319181615;9783319181608

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 minimize the probability of non-detection of a moving target under a given resource effort to be shared. The solution method is based on a combination of the forward-backward split technique and DC programming. Numerical experiments demonstrate the efficiency of the proposed algorithm in comparison with the existing method.

关键词： Search theory Hierarchical optimization Combinatorial optimization DC programming and DCA nonlinear mixed 0-1 programming Exact penalty

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：