Çankaya GCRIS Standart veritabanının içerik oluşturulması ve kurulumu Research Ecosystems (https://www.researchecosystems.com) tarafından devam etmektedir. Bu süreçte gördüğünüz verilerde eksikler olabilir.

Endüstri Mühendisliği Bölümü Yayın Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/279

Browse

Browsing Endüstri Mühendisliği Bölümü Yayın Koleksiyonu by Author "2634"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Citation Count: Karasakal, O., Kandiller, L., Özdemirel, N.E. (2011). A branch and bound algorithm for sector allocation of a naval task group. Naval Research Logistics, 58(7), 655-669. http://dx.doi.org/10.1002/nav.20474
    A branch and bound algorithm for sector allocation of a naval task group
    (Wiley-Blackwell, 2011) Karasakal, Orhan; Kandiller, Levent; Özdemirel, Nur Evin; 5706; 2634
    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
  • Thumbnail Image
    Article
    Citation Count: Karasakal, O., Özdemirel, N.E., Kandiller, L. (2011). Anti-ship missile defense for a naval task group. Naval Research Logistics, 58(3), 305-322. http://dx.doi.org/10.1002/nav.20457
    Anti-ship missile defense for a naval task group
    (Wiley-Blackwell, 2011) Karasakal, Orhan; Özdemirel, Nur Evin; Kandiller, Levent; 2634; 5706
    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 the ASM threat, and new technology that enables a fully coordinated and collective defense. In addition to allocating SAMs to ASMs, MAP also schedules launching of SAM rounds according to shoot-look-shoot engagement policy or its variations, considering multiple SAM systems and ASM types. MAP can be used for air defense planning under a given scenario. As thorough scenario analysis would require repetitive use of MAP, we propose efficient heuristic procedures for solving the problem