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

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942

Browse

Now showing 1 - 10 of 10

Citation - WoS: 18
Citation - Scopus: 22
A Capacitated Lot Sizing Problem With Stochastic Setup Times and Overtime
(2019) Jabali, Ola; Gendreau, Michel; Jans, Raf; Taş, Duygu; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times and Overtime (CLSPSSTO). We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SSTO is formulated as a two-stage stochastic programming problem. A procedure is proposed to exactly compute the expected overtime for a given setup and production plan when the setup times follow a Gamma distribution. A sample average approximation procedure is applied to obtain upper bounds and a statistical lower bound. This is then used to benchmark the performance of two additional heuristics. A first heuristic is based on changing the capacity in the deterministic counterpart, while the second heuristic artificially modifies the setup time. We conduct our computational experiments on well-known problem instances and provide comprehensive analyses to evaluate the performance of each heuristic. (C) 2018 Elsevier B.V. All rights reserved.
Citation - WoS: 25
Citation - Scopus: 25
An Efficient Linear Programming Based Method for the Influence Maximization Problem in Social Networks
(Elsevier, 2019) Güney, Evren; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
The influence maximization problem (IMP) aims to determine the most influential individuals within a social network. In this study first we develop a binary integer program that approximates the original problem by Monte Carlo sampling. Next, to solve IMP efficiently, we propose a linear programming relaxation based method with a provable worst case bound that converges to the current state-of-the-art 1-1/e bound asymptotically. Experimental analysis indicate that the new method is superior to the state-of-the-art in terms of solution quality and this is one of the few studies that provides approximate optimal solutions for certain real life social networks.
An Efficient Linear Programming Based Method for the Influence Maximization Problem in Social Networks (vol 503, Pg 589, 2019)
(Elsevier, 2020) Güney, Evren; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
The influence maximization problem (IMP) aims to determine the most influential individuals within a social network. In this study first we develop a binary integer program thatapproximates the original problem by Monte Carlo sampling. Next, to solve IMP efficiently,we propose a linear programming relaxation based method with a provable worst casebound that converges to the current state-of-the-art 1 − 1/e bound asymptotically. Experimental analysis indicate that the new method is superior to the state-of-the-art in termsof solution quality and this is one of the few studies that provides approximate optimalsolutions for certain real life social networks.
Citation - WoS: 46
Citation - Scopus: 53
An Optimization Model for Carbon Capture & Storage/Utilization Vs. Carbon Trading: a Case Study of Fossil-Fired Power Plants in Turkey
(2018) Uctug, Fehmi Görkem; Ağralı, Semra; Türkmen, Burçin Atılgan; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
We consider fossil-fired power plants that operate in an environment where a cap and trade system is in operation. These plants need to choose between carbon capture and storage (CCS), carbon capture and utilization (CCU), or carbon trading in order to obey emissions limits enforced by the government. We develop a mixed-integer programming model that decides on the capacities of carbon capture units, if it is optimal to install them, the transportation network that needs to be built for transporting the carbon captured, and the locations of storage sites, if they are decided to be built. Main restrictions on the system are the minimum and maximum capacities of the different parts of the pipeline network, the amount of carbon that can be sold to companies for utilization, and the capacities on the storage sites. Under these restrictions, the model aims to minimize the net present value of the sum of the costs associated with installation and operation of the carbon capture unit and the transportation of carbon, the storage cost in case of CCS, the cost (or revenue) that results from the emissions trading system, and finally the negative revenue of selling the carbon to other entities for utilization. We implement the model on General Algebraic Modeling System (GAMS) by using data associated with two coal-fired power plants located in different regions of Turkey. We choose enhanced oil recovery (EOR) as the process in which carbon would be utilized. The results show that CCU is preferable to CCS as long as there is sufficient demand in the EOR market. The distance between the location of emission and location of utilization/storage, and the capacity limits on the pipes are an important factor in deciding between carbon capture and carbon trading. At carbon prices over $15/ton, carbon capture becomes preferable to carbon trading. These results show that as far as Turkey is concerned, CCU should be prioritized as a means of reducing nationwide carbon emissions in an environmentally and economically rewarding manner. The model developed in this study is generic, and it can be applied to any industry at any location, as long as the required inputs are available. (C) 2018 Elsevier Ltd. All rights reserved.
Citation - WoS: 44
Citation - Scopus: 40
Branch-And Methods for the Electric Vehicle Routing Problem With Time Windows
(Taylor and Francis, 2021) Çatay, Bülent; Duman, Ece Naz; Taş, Duygu; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
In this paper, we address the electric vehicle routing problem with time windows and propose two branch-and-price-and-cut methods based on a column generation algorithm. One is an exact algorithm whereas the other is a heuristic method. The pricing sub-problem of the column generation method is solved using a label correcting algorithm. The algorithms are strengthened with the state-of-the-art acceleration techniques and a set of valid inequalities. The acceleration techniques include: (i) an intermediate column pool to prevent solving the pricing sub-problem at each iteration, (ii) a label correcting method employing the ng-route algorithm adopted to our problem, (iii) a bidirectional search mechanism in which both forward and backward labels are created, (iv) a procedure for dynamically eliminating arcs that connect customers to remote stations from the network during the path generation, (v) a bounding procedure providing early elimination of sub-optimal routes, and (vi) an integer programming model that generates upper bounds. Numerical experiments are conducted using a benchmark data set to compare the performances of the algorithms. The results favour the heuristic algorithm in terms of both the computational time and the number of instances solved. Moreover, the heuristic algorithm is shown to be specifically effective for larger instances. Both algorithms introduce a number of new solutions to the literature.
Citation - WoS: 10
Citation - Scopus: 11
Coordination of Inbound and Outbound Transportation Schedules With the Production Schedule
(2016) Toptal, Aysegul; Sabuncuoglu, Ihsan; Koç, Utku; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
This paper studies the coordination of production and shipment schedules for a single stage in the supply chain. The production scheduling problem at the facility is modeled as belonging to a single process. Jobs that are located at a distant origin are carried to this facility making use of a finite number of capacitated vehicles. These vehicles, which are initially stationed close to the origin, are also used for the return of the jobs upon completion of their processing. In the paper, a model is developed to find the schedules of the facility and the vehicles jointly, allowing for effective utilization of the vehicles both in the inbound and the outbound. The objective of the proposed model is to minimize the sum of transportation costs and inventory holding costs. Issues related to transportation such as travel times, vehicle capacities, and waiting limits are explicitly accounted for. Inventories of the unprocessed and processed jobs at the facility are penalized. The paper contributes to the literature on supply chain scheduling under transportation considerations by modeling a practically motivated problem, proving that it is strongly NP-Hard, and developing an analytical and a numerical investigation for its solution. In particular, properties of the solution space are explored, lower bounds are developed on the optimal costs of the general and the special cases, and a computationally-efficient heuristic is proposed for solving large-size instances. The qualities of the heuristic and the lower bounds are demonstrated over an extensive numerical analysis. (C) 2016 Elsevier Ltd. All rights reserved.
Citation - WoS: 10
Citation - Scopus: 13
Energy Investment Planning at a Private Company: a Mathematical Programming-Based Model and Its Application in Turkey
(2017) Ağralı, Semra; Canakoglu, Ethem; Arikan, Yildiz; Terzi, Fulya; Adıyeke, Esra; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
We consider a mid-sized private electricity generating company that plans to enter the market that is partially regulated. There is a cap and trade system in operation in the industry. There are nine possible power plant types that the company considers to invest on through a planning horizon. Some of these plants may include a carbon capture and storage technology. We develop a stochastic mixed-integer linear program for this problem where the objective is to maximize the expected net present value of the profit obtained. We include restrictions on the maximum and minimum possible amount of investment for every type of investment option. We also enforce market share conditions such that the percentage of the total investments of the company over the total installed capacity of the country stay between upper and lower bounds. Moreover, in order to distribute the investment risk, the percentage of each type of power plant investment is restricted by some upper bound. We tested the model for a hypothetical company operating in Turkey. The results show that the model is suitable to be used for determining the investment strategy of the company.
Citation - WoS: 30
Citation - Scopus: 31
Large-Scale Influence Maximization Via Maximal Covering Location
(Elsevier, 2020) Güney, Evren; Ruthmair, Mario; Sinnl, Markus; Leitner, Markus; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
Influence maximization aims at identifying a limited set of key individuals in a (social) network which spreads information based on some propagation model and maximizes the number of individuals reached. We show that influence maximization based on the probabilistic independent cascade model can be modeled as a stochastic maximal covering location problem. A reformulation based on Benders decomposition is proposed and a relation between obtained Benders optimality cuts and submodular cuts for correspondingly defined subsets is established. We introduce preprocessing tests, which allow us to remove variables from the model and develop efficient algorithms for the separation of Benders cuts. Both aspects are shown to be crucial ingredients of the developed branch-and-cut algorithm since real-life social network instances may be very large. In a computational study, the considered variants of this branch-and-cut algorithm outperform the state-of-the-art approach for influence maximization by orders of magnitude.
Citation - WoS: 5
Citation - Scopus: 9
Predicting Cash Holdings Using Supervised Machine Learning Algorithms
(Springer, 2022) Özlem, Şirin; Tan, Ömer Faruk; 04. Faculty of Economics, Administrative and Social Sciences; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
This study predicts the cash holdings policy of Turkish firms, given the 20 selected features with machine learning algorithm methods. 211 listed firms in the Borsa Istanbul are analyzed over the period between 2006 and 2019. Multiple linear regression (MLR), k-nearest neighbors (KNN), support vector regression (SVR), decision trees (DT), extreme gradient boosting algorithm (XGBoost) and multi-layer neural networks (MLNN) are used for prediction. Results reveal that MLR, KNN, and SVR provide high root mean square error (RMSE) and low R2 values. Meanwhile, more complex algorithms, such as DT and especially XGBoost, derive higher accuracy with a 0.73 R2 value. Therefore, using advanced machine learning algorithms, we may predict cash holdings considerably.
Citation - WoS: 9
Citation - Scopus: 9
Sequential Testing in Batches
(2017) Ünlüyurt, Tonguc; Shahmoradi, Zahed; Özluk, Özgur; Selcuk, Barış; Daldal, Rebi; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
We study a new extension of the Sequential Testing problem with a modified cost structure that allows performing of some tests in batches. As in the Sequential Testing problem, we assume a certain dependence between the test results and the conclusion. Namely, we stop testing once a positive result is obtained or all tests are negative. Our extension, motivated by health care applications, considers a fixed cost associated with executing a batch of tests, with the general notion that the more tests are performed in batches, the smaller the total contribution of fixed costs to the sequential testing process. The goal is to minimize the expected cost of testing by finding the optimal choice and sequence of the batches available. The resulting NP-hard model is a variation of the set partitioning problem. We propose various heuristic algorithms for the effective solution of the problem and then demonstrate the performances of the algorithms through extensive numerical experiments.

Browse

Browsing Endüstri Mühendisliği Bölümü Koleksiyonu by WoS Q "Q1"