A Branch and Bound Algorithm for Sector Allocation of a Naval Task Group

Orhan Karasakal; Levent Kandiller; Nur Evin Ozdemirel

首页> 外文期刊>Naval Research Logistics >A Branch and Bound Algorithm for Sector Allocation of a Naval Task Group

【24h】

A Branch and Bound Algorithm for Sector Allocation of a Naval Task Group

机译：海军任务群部门分配的分支定界算法

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

A naval task group (TG) is a collection of naval combatants and auxiliaries that are grouped together for the accomplishment of one or more missions. Ships forming a TG are located in predefined sectors. We define determination of ship sector locations to provide a robust air defense formation as the sector allocation problem (SAP). A robust formation is one that is very effective against a variety of attack scenarios but not necessarily the most effective against any scenario. We propose a 0-1 integer linear programming formulation for SAP. The model takes the size and the direction of threat into account as well as the defensive weapons of the naval TG. We develop tight lower and upper bounds by incorporating some valid inequalities and use a branch and bound algorithm to exactly solve SAP. We report computational results that demonstrate the effectiveness of the proposed solution approach.

机译：海军任务组（TG）是海军战斗人员和辅助人员的集合，它们被组合在一起以完成一个或多个任务。形成TG的船只位于预定义的扇区中。我们定义确定船舶部门的位置，以提供强大的防空阵型作为部门分配问题（SAP）。稳健的阵型是对各种攻击情况都非常有效的，但不一定对任何情况都最有效。我们为SAP提出0-1整数线性规划公式。该模型将威胁的大小和方向以及海军TG的防御武器考虑在内。我们通过合并一些有效的不等式来建立严格的上下限，并使用分支定界算法精确求解SAP。我们报告的计算结果证明了所提出的解决方案方法的有效性。

著录项

来源
《Naval Research Logistics》 |2011年第7期|p.655-669|共15页
作者
Orhan Karasakal; Levent Kandiller; Nur Evin Ozdemirel;
展开▼
作者单位

Industrial Engineering Department, Middle East Technical University, 06531 Ankara, Turkey;

Industrial Engineering Department, Cankaya University, Balgat 06530, Ankara, Turkey;

Industrial Engineering Department, Middle East Technical University, 06531 Ankara, Turkey;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
discrete location; branch-and-bound; military tactics; formation;

机译：离散的位置;分支定界军事战术;编队;

相似文献

外文文献
中文文献
专利

1. Branch-and-bound task allocation with task clustering-based pruning [J] . Ma YC, Chen TF, Chung CP Journal of Parallel and Distributed Computing . 2004,第11期

机译：基于任务聚类的修剪的分支定界任务分配
2. Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem [J] . M. Hakan Akyuez, I. Kuban Altinel, Temel OEncan Annals of Operations Research . 2014,第nova期

机译：容量化多设施Weber问题的基于位置和分配的分支定界算法
3. A branch and bound algorithm for dynamic resource allocation in population disease management [J] . Ho Ting-Yu, Liu Shan, Zabinsky Zelda B. Operations Research Letters: A Journal of the Operations Research Society of America . 2019,第6期

机译：人口疾病管理中动态资源分配分支与绑定算法
4. Branch-and-Bound algorithms to minimize total weighted and total completion time for the dedicated two-processor task scheduling problems P2ixj∑wjCj and P2ixj∑Cj [C] . Adel MANAA, Chengbin CHU, Alice YALAOUI 工业工程与系统管理2007年国际会议（International Conference on Industrial Engineering and Systems Management）（IESM 2007）论文集 . 2007

机译：分支定界算法可最大程度地减少专用两处理器任务调度问题P2 fixj ∑wjCj和P2 fixj ∑Cj的总加权和总完成时间
5. DCABB: A framework for the development of distributed branch and bound algorithms. [D] . Kudva, Gautham K. 1994

机译：DCABB：用于开发分布式分支定界算法的框架。
6. An Efficient Sampling-Based Algorithms Using Active Learning and Manifold Learning for Multiple Unmanned Aerial Vehicle Task Allocation under Uncertainty [O] . Xiaowei Fu, Hui Wang, Bin Li, 2018

机译：不确定性下基于主动学习和流形学习的高效采样算法用于多种无人机任务分配
7. Um algoritmo branch-and-bound para o problema de programação de projetos com custo de disponibilidade de recursos e múltiplos modos A branch-and-bound algorithm for the resource constrained project scheduling problem with resource availability cost and multiple modes [O] . Denise Sato Yamashita, Reinaldo Morabito 2007

机译：Um algoritmo branch-and-bound para o problemadeprogramaçãodeprojetos com custo de disponibilidade de recursosemúltiplosmodos资源可用性成本和多种模式的资源约束项目调度问题的分支定界算法
8. Tight Upper Bound for the Speed-Up of Parallel Best-First Branch-and-Bound Algorithms [R] . Huang, S. R., Davis, L. S. 1987

机译：用于加速并行最佳分支定界算法的紧上界

A Branch and Bound Algorithm for Sector Allocation of a Naval Task Group

摘要

著录项

相似文献

相关主题

期刊订阅