Publications with Fulltext
Permanent URI for this collectionhttps://hdl.handle.net/20.500.14288/6
Browse
8 results
Search Results
Publication Open Access The state-dependent M/G/1 queue with orbit(Springer, 2018) Baron, Opher; Economou, Antonis; Department of Industrial Engineering; Manou, Athanasia; Faculty Member; Department of Industrial Engineering; College of EngineeringWe consider a state-dependent single-server queue with orbit. This is a versatile model for the study of service systems, where the server needs a non-negligible time to retrieve waiting customers every time he completes a service. This situation arises typically when the customers are not physically present at a system, but they have a remote access to it, as in a call center station, a communication node, etc. We introduce a probabilistic approach for the performance evaluation of this queueing system, that we refer to as the queueing and Markov chain decomposition approach. Moreover, we discuss the applicability of this approach for the performance evaluation of other non-Markovian service systems with state dependencies.Publication Open Access A hierarchical solution approach for a multicommodity distribution problem under a special cost structure(Elsevier, 2012) Koca, Esra; Department of Industrial Engineering; Yıldırım, Emre Alper; Faculty Member; Department of Industrial Engineering; College of EngineeringMotivated by the spare parts distribution system of a major automotive manufacturer in Turkey, we consider a multicommodity distribution problem from a central depot to a number of geographically dispersed demand points. The distribution of the items is carried out by a set of identical vehicles. The demand of each demand point can be satisfied by several vehicles and a single vehicle is allowed to serve multiple demand points. For a given vehicle, the cost structure is dictated by the farthest demand point from the depot among all demand points served by that vehicle. The objective is to satisfy the demand of each demand point with the minimum total distribution cost. We present a novel integer linear programming formulation of the problem as a variant of the network design problem. The resulting optimization problem becomes computationally infeasible for real-life problems due to the large number of integer variables. In an attempt to circumvent this disadvantage of using the direct formulation especially for larger problems, we propose a Hierarchical Approach that is aimed at solving the problem in two stages using partial demand aggregation followed by a disaggregation scheme. We study the properties of the solution returned by the Hierarchical Approach. We perform computational studies on a data set adapted from a major automotive manufacturer in Turkey. Our results reveal that the Hierarchical Approach significantly outperforms the direct formulation approach in terms of both the running time and the quality of the resulting solution especially on large instances.Publication Open Access AUC maximization in Bayesian hierarchical models(IOS Press, 2016) Department of Industrial Engineering; Gönen, Mehmet; Faculty Member; Department of Industrial Engineering; College of Engineering; 237468The area under the curve (AUC) measures such as the area under the receiver operating characteristics curve (AUROC) and the area under the precision-recall curve (AUPR) are known to be more appropriate than the error rate, especially, for imbalanced data sets. There are several algorithms to optimize AUC measures instead of minimizing the error rate. However, this idea has not been fully exploited in Bayesian hierarchical models owing to the difficulties in inference. Here, we formulate a general Bayesian inference framework, called Bayesian AUC Maximization (BAM), to integrate AUC maximization into Bayesian hierarchical models by borrowing the pairwise and listwise ranking ideas from the information retrieval literature. To showcase our BAM framework, we develop two Bayesian linear classifier variants for two ranking approaches and derive their variational inference procedures. We perform validation experiments on four biomedical data sets to demonstrate the better predictive performance of our framework over its error-minimizing counterpart in terms of average AUROC and AUPR values.Publication Open Access Branch-and-price approaches for the network design problem with relays(Elsevier, 2018) Karasan, Oya Ekin; Yaman, Hande; Department of Industrial Engineering; Yıldız, Barış; Faculty Member; Department of Industrial Engineering; College of Engineering; 258791With different names and characteristics, relays play a crucial role in the design of transportation and telecommunication networks. In transportation networks, relays are strategic locations where exchange of drivers, trucks or mode of transportation takes place. In green transportation, relays become the refuelling/recharging stations extending the reach of alternative fuel vehicles. In telecommunication networks, relays are regenerators extending the reach of optical signals. We study the network design problem with relays and present a multi-commodity flow formulation and a branch-and-price algorithm to solve it. Motivated by the practical applications, we investigate the special case where each demand has a common designated source. In this special case, we can show that there exists an optimal design that is a tree. Using this fact, we replace the multi-commodity flow formulation with a tree formulation enhanced with Steiner cuts. Employing a branch-and-price-and-cut schema on this formulation, we are able to further extend computational efficiency to solve large problem instances.Publication Open Access Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks(Elsevier, 2017) Gökbayrak, Kağan; Department of Industrial Engineering; Yıldırım, Emre Alper; Faculty Member; Department of Industrial Engineering; College of EngineeringWireless mesh networks (WMNs) provide cost-effective alternatives for extending wireless communication over larger geographical areas. In this paper, given a WMN with its nodes and possible wireless links, we consider the problem of gateway node selection for connecting the network to the Internet along with operational problems such as routing, wireless transmission capacity allocation, and transmission power control for efficient use of wired and wireless resources. Under the assumption that each node of the WMN has a fixed traffic rate, our goal is to allocate capacities to the nodes in proportion to their traffic rates so as to maximize the minimum capacity-to-demand ratio, referred to as the service level. We adopt a time division multiple access (TDMA) scheme, in which a time frame on the same frequency channel is divided into several time slots and each node can transmit in one or more time slots. We propose two mixed integer linear programming formulations. The first formulation, which is based on individual transmissions in each time slot, is a straightforward extension of a previous formulation developed by the authors for a related problem under a different set of assumptions. The alternative formulation, on the other hand, is based on sets of noninterfering wireless transmissions. In contrast with the first formulation, the size of the alternative formulation is independent of the number of time slots in a frame. We identify simple necessary and sufficient conditions for simultaneous transmissions on different links of the network in the same time slot without any significant interference. Our characterization, as a byproduct, prescribes a power level for each of the transmitting nodes. Motivated by this characterization, we propose a simple scheme to enumerate all sets of noninterfering transmissions, which is used as an input for the alternative formulation. We also introduce a set of valid inequalities for both formulations. For large instances, we propose a three-stage heuristic approach. In the first stage, we solve a partial relaxation of our alternative optimization model and determine the gateway locations. This stage also provides an upper bound on the optimal service level. In the second stage, a routing tree is constructed for each gateway node computed in the first stage. Finally, in the third stage, the alternative optimization model is solved by fixing the resulting gateway locations and the routing trees from the previous two stages. For even larger networks, we propose a heuristic approach for solving the partial relaxation in the first stage using a neighborhood search on gateway locations. Our computational results demonstrate the promising performance of our exact and heuristic approaches and the valid inequalitiesPublication Open Access Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks(Elsevier, 2013) Gökbayrak, Kağan; Department of Industrial Engineering; Yıldırım, Emre Alper; Faculty Member; Department of Industrial Engineering; College of EngineeringWireless mesh networks (WMNs) provide cost effective solutions for setting up a communications network over a certain geographic area. In this paper, we study strategic problems of WMNs such as selecting the gateway nodes along with several operational problems such as routing, power control, and transmission slot assignment. Under the assumptions of the physical interference model and the tree-based routing restriction for traffic flow, a mixed integer linear programming (MILP) formulation is presented, in which the objective is to maximize the minimum service level provided at the nodes. A set of valid inequalities is derived and added to the model in an attempt to improve the solution quality. Since the MILP formulation becomes computationally infeasible for larger instances, we propose a heuristic method that is aimed at solving the problem in two stages. In the first stage, we devise a simple MILP problem that is concerned only with the selection of gateway nodes. In the second stage, the MILP problem in the original formulation is solved by fixing the gateway nodes from the first stage. Computational experiments are provided to evaluate the proposed models and the heuristic method.Publication Open Access Spatial prediction of COVID-19 pandemic dynamics in the United States(Multidisciplinary Digital Publishing Institute (MDPI), 2022) Ak, Çiğdem; Chitsazan, Alex D.; Etzioni, Ruth; Grossberg, Aaron J.; Department of Industrial Engineering; Gönen, Mehmet; Faculty Member; Department of Industrial Engineering; School of Medicine; College of Engineering; 237468The impact of COVID-19 across the United States (US) has been heterogeneous, with rapid spread and greater mortality in some areas compared with others. We used geographically-linked data to test the hypothesis that the risk for COVID-19 was defined by location and sought to define which demographic features were most closely associated with elevated COVID-19 spread and mortality. We leveraged geographically-restricted social, economic, political, and demographic information from US counties to develop a computational framework using structured Gaussian process to predict county-level case and death counts during the pandemic's initial and nationwide phases. After identifying the most predictive information sources by location, we applied an unsupervised clustering algorithm and topic modeling to identify groups of features most closely associated with COVID-19 spread. Our model successfully predicted COVID-19 case counts of unseen locations after examining case counts and demographic information of neighboring locations, with overall Pearson's correlation coefficient and the proportion of variance explained as 0.96 and 0.84 during the initial phase and 0.95 and 0.87 during the nationwide phase, respectively. Aside from population metrics, presidential vote margin was the most consistently selected spatial feature in our COVID-19 prediction models. Urbanicity and 2020 presidential vote margins were more predictive than other demographic features. Models trained using death counts showed similar performance metrics. Topic modeling showed that counties with similar socioeconomic and demographic features tended to group together, and some of these feature sets were associated with COVID-19 dynamics. Clustering of counties based on these feature groups found by topic modeling revealed groups of counties that experienced markedly different COVID-19 spread. We conclude that topic modeling can be used to group similar features and identify counties with similar features in epidemiologic research.Publication Open Access On the accuracy of uniform polyhedral approximations of the copositive cone(Taylor _ Francis, 2012) Department of Industrial Engineering; Yıldırım, Emre Alper; Faculty Member; Department of Industrial Engineering; College of EngineeringWe consider linear optimization problems over the cone of copositive matrices. Such conic optimization problems, called copositive programs, arise from the reformulation of a wide variety of difficult optimization problems. We propose a hierarchy of increasingly better outer polyhedral approximations to the copositive cone. We establish that the sequence of approximations is exact in the limit. By combining our outer polyhedral approximations with the inner polyhedral approximations due to de Klerk and Pasechnik [SIAM J. Optim. 12 (2002), pp. 875-892], we obtain a sequence of increasingly sharper lower and upper bounds on the optimal value of a copositive program. Under primal and dual regularity assumptions, we establish that both sequences converge to the optimal value. For standard quadratic optimization problems, we derive tight bounds on the gap between the upper and lower bounds. We provide closed-form expressions of the bounds for the maximum stable set problem. Our computational results shed light on the quality of the bounds on randomly generated instances.