A branch and bound algorithm for sector allocation of a naval task group

A branch and bound algorithm for sector allocation of a naval task group

0.00 Avg rating0 Votes
Article ID: iaor201112774
Volume: 58
Issue: 7
Start Page Number: 655
End Page Number: 669
Publication Date: Oct 2011
Journal: Naval Research Logistics (NRL)
Authors: , ,
Keywords: simulation: applications, programming: integer, combinatorial optimization
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.