5 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 5 / 5
Yayın Game-day scheduling problem for sport events(Işık Üniversitesi, 2016-01-04) Bilgesu, Duygu; Çavdaroğlu, Burak; Işık Üniversitesi, Fen Bilimleri Enstitüsü, Endüstri Mühendisliği - Yöneylem Araştırması Yüksek Lisans ProgramıIn this research, we first define such a sport event scheduling problem in which the days of the games has to be decided for a given fixture of a sport organization without violating some given restrictions that aim to preserve the equity among competitors. We then develop a mixed integer programming model for the defined problem that uses combinatorial optimization techniques. In the final step, we test our model with the data set of 2013-2014 season of the Turkish Super League (top-tier men's professional football league in Turkey) organized by Turkish Football Federation (TFF)Yayın Optimization of wastewater treatment systems for growing industrial parks(Elsevier B.V., 2023-12-20) Savun Hekimoğlu, Başak; İşler, Zülal; Hekimoğlu, Mustafa; Burak, Selmin; Karlı, Deniz; Yücekaya, Ahmet; Akpınar, Ersin; Ediger, Volkan Ş.Wastewater treatment is one of the crucial functions of industrial parks as wastewater from industrial facilities usually contains toxic compounds that can cause damage to the environment. To control their environmental loads, industrial parks make investment decisions for wastewater treatment plants. For this, they need to consider technical and economic factors as well as future growth projections as substantial construction and operational costs of wastewater treatment plants have to be shared by all companies in an industrial park. In this paper, we consider the long-term capacity planning problem for wastewater treatment facilities of a stochastically growing industrial park. By explicitly modeling randomness in the arrival of new tenants and their random wastewater discharges, our model calculates the future mean and variance of wastewater flow in the industrial park. Mean and variance are used in a Mixed Integer Programming Model to optimize wastewater treatment plant selection over a long planning horizon (30 years). By fitting our first model to empirical data from an industrial park in Turkey, we find that considering the variance of wastewater load is critical for long-term planning. Also, we quantify the economic significance of lowering wastewater discharges which can be achieved by water recycling or interplant water exchange.Yayın Minimization of rest mismatches in round robin tournaments(Pergamon-Elsevier Science Ltd, 2018-11-01) Atan, Sabri Tankut; Çavdaroğlu, BurakIn sports tournaments, an occurrence of a difference in the rest periods of opponent teams in a game, which we refer to as a rest mismatch, will disadvantage the less rested team. Thus, it is only fair to expect opposing teams to have rested equally before their game. In this work, we introduce and study the Rest Mismatch Problem where the goal is to minimize the number of rest mismatches in a round robin tournament. Two integer linear formulations and a constraint programming formulation are provided, and their computational performances are compared for several problem instances. Moreover, a heuristic algorithm is developed which finds a single round robin schedule with zero mismatches when the number of teams in the tournament is a multiple of 8, and four mismatches when it is a multiple of 4 but not 8.Yayın Simultaneous scheduling of football games and referees using Turkish league data(Blackwell Publishing Ltd, 2017-05) Atan, Sabri Tankut; Hüseyinoğlu, Olgu PelinAssignment decisions of referees to football (soccer) games are highly debated in sports media. Referee assignments are typically done on a weekly basis as the league progresses. However, this practice ignores important workload constraints on referees. Moreover, referees' skill levels should also be considered in determining their assignments. In this article, we first give a mixed integer linear program formulation for the problem of simultaneously generating a game schedule and assigning main referees to games by incorporating specific rules in the Turkish league. We also approach this problem using a genetic algorithm (GA) because of the computational difficulties in solving the problem. In the GA solution pool, we suggest using templates for referee assignments that follow several referee-related workload constraints. We explain how these templates can be obtained by solving a mixed integer linear model prior to running the GA. The usage of these templates for referee assignments is conceptually similar to using a basic match schedule for game scheduling such as the one used in the Turkish Football League. We use the Turkish Football League fixtures for 2010–2013 as a case study. Experiments with the GA using real-world data show a rather modest performance in terms of computation time and objective function value. Our numerical results indicate that the problem is extremely hard to solve.Yayın Optimal project duration for resource leveling(Elsevier Science BV, 2018-04-16) Atan, Sabri Tankut; Eren, ElifResource leveling is important in project management as resource fluctuations are costly and undesired. Typically, schedules with better resource profiles are obtained by shifting the activities within their float times using the schedule of fixed duration found by Critical Path Method. However, if the project duration can be extended, it is plausible to find a schedule with enhanced resource leveling since a longer duration allows for more float time for all activities. In this work, we relax the assumption of fixed durations in resource leveling formulations and investigate what the minimal project duration for the best leveled schedule should be. We provide mixed-integer linear models for several leveling objectives including the Release and Rehire metric. We show that not all metrics used for leveling under fixed durations may be appropriate when the project duration becomes a decision variable. Optimal solutions from smaller problems are used to find the magnitude of the extension needed and benefits obtained thereby. Since the problem is a NP-hard problem for which exact solutions cannot be obtained for large networks in reasonable time, we provide a greedy heuristic to be used with the Release and Rehire metric. Using an iterative framework, we also test the performance of a state-of-the-art heuristic algorithm from the literature on our problem. Computational experiments indicate that the more the number of resources is increased, the less leveling benefits are gained from extending the project. The optimal project durations and extension benefits can also be significantly different for different metrics.
