Endüstri Mühendisliği Bölümü Yayın Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/279
Browse
3 results
Search Results
Article A Partial Coverage Hierarchical Location Allocation Model for Health Services(inderscience Enterprises Ltd, 2023) Karasakal, Esra; Toreyen, Ozgun; Karasakal, OrhanWe consider a hierarchical maximal covering location problem (HMCLP) to locate health centres and hospitals so that the maximum demand is covered by two levels of services in a successively inclusive hierarchy. We extend the HMCLP by introducing the partial coverage and a new definition of the referral. The proposed model may enable an informed decision on the healthcare system when dynamic adaptation is required, such as a COVID-19 pandemic. We define the referral as coverage of health centres by hospitals. A hospital may also cover demand through referral. The proposed model is solved optimally for small problems. For large problems, we propose a customised genetic algorithm. Computational study shows that the GA performs well, and the partial coverage substantially affects the optimal solutions. [Submitted: 20 January 2021; Accepted: 15 January 2022]Article Citation - WoS: 7Citation - Scopus: 7Solution Approaches To the Blood Distribution Problem of the Turkish Red Crescent(inderscience Enterprises Ltd, 2018) Cetinkaya, Ferda Can; Kurt, Atil; Azizoglu, MeralThis paper considers the blood distribution problem that includes irradiation centres, urgent demands, and product availability in Turkey, Central Anatolian Regional Blood Center of the Turkish Red Crescent. To address the problem, we develop a mixed integer linear program with two objectives: maximising the demand satisfaction and minimising total time travelled by the vehicles. We propose two decomposition-based heuristic solution approaches. The results of our experiments have revealed that the model cannot solve even small sized instances in reasonable times; however, the heuristic solution approaches are appropriate for solving complex real life problems.Article Citation - WoS: 5Citation - Scopus: 8Lp Relaxation-Based Solution Algorithms for the Multi-Mode Project Scheduling With a Non-Renewable Resource(inderscience Enterprises Ltd, 2015) Cetinkaya, Ferda Can; Pamir, Selin Kirbiyik; Azizoglu, MeralIn this study, we consider a multi-mode resource allocation problem with a single non-renewable resource. We assume the resource is released at defined time points and at defined quantities. We also assume that the activity costs are charged once they are completed. Our aim is to minimise the project completion time. We formulate the problem as a pure integer programming model and show that it is strongly NP-hard. We find lower bounds by pure and mixed integer linear programming relaxations of the model and develop three heuristic procedures based on those relaxations. The results of our computational study have revealed the satisfactory performances of our lower bounds and heuristic procedures.