Endüstri Mühendisliği Bölümü Yayın Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/279
Browse
8 results
Search Results
Conference Object PROMETHEE Yöntemini Beklenti Teorisi ile Uyumlandıran Bütünleşik bir Yaklaşım(2018) Karasakal, Orhan; Karasakal, EsraArticle Minisum and maximin aerial surveillance over disjoint rectangles(2016) Karasakal, OrhanThe aerial surveillance problem (ASP) is finding the shortest path for an aerial surveillance platform that has to visit each rectangular area once and conduct a search in strips to cover the area at an acceptable level of efficiency and turn back to the base from which it starts. In this study, we propose a new formulation for ASP with salient features. The proposed formulation that is based on the travelling salesman problem enables more efficient use of search platforms and solutions to realistic problems in reasonable time. We also present a max–min version of ASP that maximizes the minimum probability of target detection given the maximum flight distance of an aerial platform. We provide computational results that demonstrate features of the proposed models.Article An approach for extending PROMETHEE to reflect choice behaviour of the decision maker(2019) Karasakal, Esra; Karasakal, Orhan; Bozkurt, AhmetIn this study, an approach based on PROMETHEE is developed to correctly reflect the choice behavior of the decision maker that is not explained by the utility theory. The prospect theory argues that losses have higher impact than gains. We integrate the prospect theory into PROMETHEE through defining new preference functions. The proposed approach is behaviorally realistic and tolerates some degree of intransitivities in the preferences of the decision maker. For determining the criteria weights, we utilize pairwise comparison method of Analytic Hierarchy Process. Performance of the approach is demonstrated on a university ranking problem.Conference Object Multiple Criteria Target Classification Using Heterogeneous Sensor Data(2019) Karasakal, Orhan; Atıcı, Bengü; Karasakal, EsraConference Object Otomatik Hedef Sınıflandırma Sistemleri İçin Çok Kriterli Hedef Sınıflandırma(2019) Atıcı, Bengü; Karasakal, Esra; Karasakal, OrhanArticle Citation - WoS: 7Citation - Scopus: 10Bi-Objective Missile Rescheduling for a Naval Task Group With Dynamic Disruptions(Wiley, 2019) Karasakal, Orhan; Karasakal, Esra; Silav, AhmetThis paper considers the rescheduling of surface-to-air missiles (SAMs) for a naval task group (TG), where a set of SAMs have already been scheduled to intercept a set of anti-ship missiles (ASMs). In missile defense, the initial engagement schedule is developed according to the initial state of the defensive and attacking units. However, unforeseen events may arise during the engagement, creating a dynamic environment to be handled, and making the initial schedule infeasible or inefficient. In this study, the initial engagement schedule of a TG is assumed to be disrupted by the occurrence of a destroyed ASM, the breakdown of a SAM system, or an incoming new target ASM. To produce an updated schedule, a new biobjective mathematical model is formulated that maximizes the no-leaker probability value for the TG and minimizes the total deviation from the initial schedule. With the problem shown to be NP-hard, some special cases are presented that can be solved in polynomial time. We solve small size problems by the augmented epsilon-constraint method and propose heuristic procedures to generate a set of nondominated solutions for larger problems. The results are presented for different size problems and the total effectiveness of the model is evaluated.Article Citation - WoS: 7Citation - Scopus: 16A Branch and Bound Algorithm for Sector Allocation of a Naval Task Group(Wiley-blackwell, 2011) Ozdemirel, Nur Evin; Karasakal, Orhan; Kandiller, LeventA 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, 2011Article Citation - WoS: 27Citation - Scopus: 37Anti-Ship Missile Defense for a Naval Task Group(Wiley-blackwell, 2011) Kandiller, Levent; Karasakal, Orhan; Ozdemirel, Nur EvinIn 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. (C) 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 305-322, 2011