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

Date

2011-10-01

Author

Karasakal, Orhan
KANDİLLER, LEVENT
Özdemirel, Nur Evin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

134
views

0
downloads

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. (C) 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 655-669, 2011

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, Ocean Engineering

URI

https://hdl.handle.net/11511/49304

Journal

NAVAL RESEARCH LOGISTICS

DOI

https://doi.org/10.1002/nav.20474

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An Ontology for a Naval Wargame Conceptual Model Kars, Serhan; Oğuztüzün, Mehmet Halit S. (2011-01-01) Naval wargames play an important role for both training of naval cadets and trying out tactics for naval warfare. Constructing an ontology can be regarded as a way to formalize the mission space component of a simulation conceptual model. An ontology has been developed to capture the entities involved in a naval wargame and the relationships among them. The ontology is defined in OWL (Web Ontology Language), using the Protege ontology editor and knowledge-base framework. This paper presents the ontology dev...
Anti-Ship Missile Defense for a Naval Task Group Karasakal, Orhan; Özdemirel, Nur Evin; KANDİLLER, LEVENT (Wiley, 2011-04-01) In this study, we present a new formulation for the air defense problem of warships in a naval task group and propose a solution method. We define the missile allocation problem (MAP) as the optimal allocation of a set of surface-to-air missiles (SAMs) of a naval task group to a set of attacking air targets. MAP is a new treatment of an emerging problem fostered by the rapid increase in the capabilities of anti-ship missiles (ASMs), the different levels of air defense capabilities of the warships against th...
ANALYSIS OF AIR DEFENSE EFFECTIVENESS OF A NAVAL TASK GROUP UNDER PARTIAL AND FULL COORDINATION Köse, Bala İlkim; Karasakal, Esra; Karasakal, Orhan; Department of Industrial Engineering (2022-5-10) The purpose of this thesis is to analyze the air defense effectiveness of a naval task group (TG) under different coordination levels. Event Graphs methodology, and component-based discrete-event simulation modeling techniques are used. The simulation model is built using Simkit, an open-source java package, which enables the use of component-based modeling. TG is analyzed under different coordination policies consisting of no-coordination, partial coordination, and full coordination within TG, then these c...
AN ALGORITHMIC FRAMEWORK FOR ROUTEING LTL SHIPMENTS Akyılmaz, M. Özdemir (JSTOR, 1994-05-01) One way of reducing the unit cost of shipment by a motor carrier is to consolidate many LTL (less-than-truck-load) shipments. Explicit information on the route structure is a prerequisite to the understanding of the costs of the services provided and to the planning of the allocation of the equipment and personnel among the terminals. In this paper, an approach for routeing the LTL shipments is presented and is applied to a hypothetical network. Solution results of this example show that the algorithm offer...
A flexible reference point-based multi-objective evolutionary algorithm: An application to the UAV route planning problem DAŞDEMİR, ERDİ; Köksalan, Mustafa Murat; TEZCANER ÖZTÜRK, DİCLEHAN (Elsevier BV, 2020-02-01) We study the multi-objective route planning problem of an unmanned air vehicle (UAV) moving in a continuous terrain. In this problem, the UAV starts from a base, visits all targets and returns to the base in a continuous terrain that is monitored by radars. We consider two objectives: minimizing total distance and minimizing radar detection threat. This problem has infinitely many Pareto-optimal points and generating all those points is not possible. We develop a general preference-based multi-objective evo...

Citation Formats

O. Karasakal, L. KANDİLLER, and N. E. Özdemirel, “A Branch and Bound Algorithm for Sector Allocation of a Naval Task Group,” NAVAL RESEARCH LOGISTICS, pp. 655–669, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/49304.