Browsing Industrial Engineering by Author "Özyeğin University"
Now showing items 21-40 of 215
-
A branch-and-cut algorithm for the Steiner tree problem with delays
Leggieri, V.; Haouari, Mohamed; Triki, C. (Springer Science+Business Media, 2012-12)In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present ... -
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
Yanıkoğlu, İhsan; Yavuz, Tonguç (Elsevier, 2022-09-16)This paper studies a machine scheduling problem that minimizes the worst-case total tardiness for unrelated parallel machines with sequence-dependent setup and uncertain processing times. We propose a robust optimization ... -
A branch-and-price-and-cut method for computing an optimal bramble
Sonuç, Sibel Bilge; Smith, J. C.; Hicks, I. V. (Elsevier, 2015)Given an undirected graph, a bramble is a set of connected subgraphs (called bramble elements) such that every pair of subgraphs either contains a common node, or such that an edge ( i , j ) exists with node i belonging ... -
A branch‐and‐cut approach for the least cost influence problem on social networks
Danış, Dilek Günneç; Raghavan, S.; Zhang, R. (Wiley, 2020-07)This paper studies a problem in the online targeted marketing setting called the least cost influence problem (LCIP) that is known to be NP-hard. The goal is to find the minimum total amount of inducements (individuals to ... -
Broadband high power amplifier design using GaN HEMT technology
Turt, Doğancan; Akgiray, Ahmed Halid (IEEE, 2021)This paper presents the design and measurements of a broadband GaN HEMT power amplifier intended for point-to-point radios, electronic warfare systems, and test and measurement applications. The proposed power amplifier ... -
Calibrating artificial neural networks by global optimization
Pinter, Janos D. (Elsevier, 2012-01)Artificial neural networks (ANNs) are used extensively to model unknown or unspecified functional relationships between the input and output of a “black box” system. In order to apply the generic ANN concept to actual ... -
Calibrating artificial neural networks by global optimization
Pinter, Janos D. (2010-07)An artificial neural network (ANN) is a computational model − implemented as a computer program − that is aimed at emulating the key features and operations of biological neural networks. ANNs are extensively used to model ... -
A capacitated mobile facility location problem with mobile demand: Recurrent service provision to en route refugees
Pashapour, A.; Danış, Dilek Günneç; Salman, F. S.; Yücel, E. (OpenProceedings.org, 2022)In this paper, we help humanitarian organizations provide service via mobile facilities (MFs) to migrating refugees, who attempt to cross international borders. Over a planning horizon, we aim to optimize number and routes ... -
Capacitated stochastic lot-sizing and production planning problem under demand uncertainty
Seyfishishavan, Seyed Amin; Yılmaz, Görkem; Yanıkoğlu, İhsan (Elsevier, 2022)This paper proposes two multi-period, multi-item capacitated stochastic lot-sizing problems under demand uncertainty. We model uncertainty via a scenario tree. The first model considers production, inventory, backlogging, ... -
Capacity planning for effective cohorting of hemodialysis patients during the coronavirus pandemic: A case study
Bozkır, Cem Deniz Çağlar; Özmemiş, Çağrı; Kurbanzade, Ali Kaan; Koyuncu, Burcu Balçık; Gunes, E. D.; Tuglular, S. (Elsevier, 2023-01-01)Planning treatments of different types of patients have become challenging in hemodialysis clinics during the COVID-19 pandemic due to increased demands and uncertainties. In this study, we address capacity planning decisions ... -
A CART-based genetic algorithm for constructing higher accuracy decision trees
Ersoy, Elif; Albey, Erinç; Kayış, Enis (SciTePress, 2020)Decision trees are among the most popular classification methods due to ease of implementation and simple interpretation. In traditional methods like CART (classification and regression tree), ID4, C4.5; trees are constructed ... -
A chance constraint based multi-item production planning model using simulation optimization
Albey, Erinç; Uzsoy, R.; Kempf, K. G. (IEEE, 2016)We consider a single stage multi-item production-inventory system under stochastic demand. We had previously proposed a production planning model integrating ideas from forecast evolution and inventory theory to plan work ... -
Churn prediction for mobile prepaid subscribers
Can, Zehra; Albey, Erinç (Institute for Systems and Technologies of Information, Control and Communicatio, 2017)In telecommunication, mobile operators prefer to acquire postpaid subscribers and increase their incoming revenue based on the usage of postpaid lines. However, subscribers tend to buy and use prepaid mobile lines because ... -
Classification of hundreds of classes: A case study in a bank internal control department
Duman, Ekrem (IOS Press, 2023)The main function of the internal control department of a bank is to inspect the banking operations to see if they are performed in accordance with the regulations and bank policies. To accomplish this, they pick up a ... -
Collaborative prepositioning network design for regional disaster response
Koyuncu, Burcu Balçık; Silvestri, S.; Rancourt, M.‐È.; Laporte, G. (Wiley, 2019-10)We present a collaborative prepositioning strategy to strengthen the disaster preparedness of the Caribbean countries, which are frequently hit by hurricanes. Since different subsets of countries are affected in each ... -
A column generation-based approach for the adaptive stochastic blood donation tailoring problem
Elyasi, Milad; Özener, Okan Örsan; Yanıkoğlu, İhsan; Ekici, Ali; Dolgui, A. (Taylor & Francis, 2023)Managing blood donations is a challenging problem due to the perishability of blood, limited donor pool, deferral time restrictions, and demand uncertainty. The problem addressed here combines two important aspects of blood ... -
Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly
Alkaya, A. F.; Duman, Ekrem (Elsevier, 2015-09-10)In this study we undertake the optimization of chip shooter component placement machines which became popular in assembling printed circuit boards (PCB) in recent years. A PCB is usually a rectangular plastic board on which ... -
Comparison of computational intelligence models on forecasting automated teller machine cash demands
Alkaya, A. F.; Gultekin, O. G.; Danaci, E.; Duman, Ekrem (Old City Publishing, 2020)We take up the problem of forecasting the amount of money to be withdrawn from automated teller machines (ATM). We compare the performances of eleven different algorithms from four different research areas on two different ... -
A computational study of lower bounds for the two dimensional bin packing problem
Serairi, M.; Haouari, Mohamed (Elsevier, 2010-08-01)We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al. between their lower bounds and those of Boschetti ... -
A continuous approximation approach for assessment routing in disaster relief
Huang, M.; Smilowitz, K. R.; Koyuncu, Burcu Balçık (Elsevier, 2013-04)In this paper, we focus on the assessment routing problem which routes teams to different communities to assess damage and relief needs following a disaster. To address time-sensitivity, the routing problem is modeled with ...
Share this page
