Industrial Engineering
Permanent URI for this collectionhttps://hdl.handle.net/10679/9127
Browse
Recent Submissions
Conference ObjectPublication Metadata only International roaming traffic optimization with call quality(SciTePress, 2019) Şahin, Ahmet; Demirel, Kenan Cem; Albey, Erinç; Gürsun, Gonca; Industrial Engineering; ALBEY, Erinç; Şahin, Ahmet; Demirel, Kenan Cem; Gürsun, GoncaIn this study we focus on a Steering International Roaming Traffic (SIRT) problem with single service that concerns a telecommunication’s operators’ agreements with other operators in order to enable subscribers access services, without interruption, when they are out of operators’ coverage area. In these agreements, a subscriber’s call from abroad is steered to partner operator. The decision for which each call will be forwarded to the partner is based on the user’s location (country/city), price of the partner operator for that location and the service quality of partner operator. We develop an optimization model that considers agreement constraints and quality requirements while satisfying subscribers demand over a predetermined time interval. We test the performance of the proposed approach using different execution policies such as running the model once and fixing the roaming decisions over the planning interval or dynamically updating the decisions using a rolling horizon approach. We present a rigorous trade off analysis that aims to help the decision maker in assessing the relative importance of cost, quality and ease of implementation. Our results show that steering cost is decreased by approximately 25% and operator mistakes are avoided with the developed optimization model while the quality of the steered calls is kept above the base quality level.Conference ObjectPublication Metadata only Ensemble Learning based on Regressor Chains: A Case on Quality Prediction(SciTePress, 2019) Demirel, Kenan Cem; Şahin, Ahmet; Albey, Erinç; Industrial Engineering; ALBEY, Erinç; Demirel, Kenan Cem; Şahin, AhmetIn this study we construct a prediction model, which utilizes the production process parameters acquired from a textile machine and predicts the quality characteristics of the final yarn. Several machine learning algorithms (decision tree, multivariate adaptive regression splines and random forest) are used for prediction. An ensemble method, using the idea of regressor chains, is developed to further improve the prediction performance. Collected data is first segmented into two parts (labeled as “normal” and “unusual”) using local outlier factor method, and performance of the algorithms are tested for each segment separately. It is seen that ensemble idea proves its competence especially for the cases where the collected data is categorized as unusual. In such cases ensemble algorithm improves the prediction accuracy significantly. Copyright © 2019 by SCITEPRESS – Science and Technology Publications, Lda. All rights reservedBook PartPublication Metadata only A decomposition-based heuristic for a waste cooking oil collection problem(Springer, 2020-01-01) Gültekin, Ceren; Ölmez, Ömer Berk; Koyuncu, Burcu Balçık; Ekici, Ali; Özener, Okan Örsan; Industrial Engineering; KOYUNCU, Burcu Balçık; EKİCİ, Ali; ÖZENER, Okan Örsan; Gültekin, Ceren; Ölmez, Ömer BerkEvery year, a tremendous amount of waste cooking oil (WCO) is produced by households and commercial organizations, which poses a serious threat to the environment if disposed improperly. While businesses such as hotels and restaurants usually need to have a contract for their WCO being collected and used as a raw material for biodiesel production, such an obligation may not exist for households. In this study, we focus on designing a WCO collection network, which involves a biodiesel facility, a set of collection centers (CCs), and source points (SPs) each of whom represents a group of households. The proposed locationrouting problem (LRP) determines: (i) the CCs to be opened, (ii) the number of bins to place at each CC, (iii) the assignment of each SP to one of the accessible CCs, and (iv) the vehicle routes to collect the accumulated oil from the CCs. We formulate the problem as a mixed-integer mathematical model and solve it by using commercial solvers by setting a 1-h time limit. We also propose a decompositionbased heuristic and conduct a computational study. Our decomposition algorithm obtains the same or better solutions in 95% of all the test instances compared to the proposed mathematical model.ArticlePublication Open Access A predictive multistage postdisaster damage assessment framework for drone routing(Wiley, 2024-01) Adsanver, Birce; Göktürk, Elvin Çoban; Koyuncu, Burcu Balçık; Industrial Engineering; GÖKTÜRK, Elvin Çoban; Adsanver, BirceThis study focuses on postdisaster damage assessment operations supported by a set of drones. We propose a multistage framework, consisting of two phases applied iteratively to rapidly gather damage information within an assessment period. In the initial phase, the problem involves determining areas to be scanned by each drone and the optimal sequence for visiting these selected areas. We have adapted an electric vehicle routing formulation and devised a variable neighborhood descent heuristic for this phase. In the second phase, information collected from the scanned areas is employed to predict the damage status of the unscanned areas. We have introduced a novel, fast, and easily implementable imputation policy for this purpose. To evaluate the performance of our approach in real-life disasters, we develop a case study for the expected 7.5 magnitude earthquake in Istanbul, Turkey. Our numerical study demonstrates a significant improvement in response time and priority-based metrics.ArticlePublication Open Access A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning(Pamukkale Üniversitesi, 2023) Toru, Elif; Yılmaz, G.; Toru, ElifA compressor manufacturer producing in Kocaeli/Dilovasi region makes vehicle routing and employee planning daily to fulfill the maintenance and repair requests of the Marmara region and its surroundings the next day. The service types and times are agreed upon with the customer before service planning. The vehicles and their respective operators for a given planning day are known, with the service personnel's starting and ending points being the residences. All the planned services must be satisfied in the time windows customers give. We approach the issue as a multi-depot vehicle routing problem with time windows (MDVRPTW) and construct a mixed-integer linear programming framework. The solution is deemed adequate in resolving the company's service planning predicament. To tackle large instances, we formulate a clustering algorithm that yields a proficient solution in a concise duration.ArticlePublication Metadata only Developing a national pandemic vaccination calendar under supply uncertainty(Elsevier, 2024-04) Karakaya, Sırma; Koyuncu, Burcu Balçık; Industrial Engineering; KOYUNCU, Burcu Balçık; Karakaya, SırmaDuring the COVID-19 pandemic, many countries faced challenges in developing and maintaining a reliable national pandemic vaccination calendar due to vaccine supply uncertainty. Deviating from the initial calendar due to vaccine delivery delays eroded public trust in health authorities and the government, hindering vaccination efforts. Motivated by these challenges, we address the problem of developing a long-term national pandemic vaccination calendar under supply uncertainty. We propose a novel two-stage mixed integer programming model that considers critical factors such as multiple doses, varying dosing schemes, and uncertainties in vaccine delivery timing and quantity. We present an efficient aggregation-based algorithm to solve this complex problem. Additionally, we extend our model to allow for dynamic adjustments to the vaccine schedule in response to mandatory policy changes, such as modifications to dose intervals, during ongoing vaccinations. We validate our model based on a case study developed by using real COVID-19 vaccination data from Norway. Our results demonstrate the advantages of the proposed stochastic optimization approach and heuristic algorithm. We also present valuable managerial insights through extensive numerical analysis, which can aid public health authorities in preparing for future pandemics.ArticlePublication Metadata only Neural network estimators for optimal tour lengths of traveling salesperson problem instances with arbitrary node distributions(Informs, 2024) Varol, Taha; Özener, Okan Örsan; Albey, Erinç; Industrial Engineering; ÖZENER, Okan Örsan; ALBEY, Erinç; Varol, TahaIt is essential to solve complex routing problems to achieve operational efficiency in logistics. However, because of their complexity, these problems are often tackled sequentially using cluster-first, route-second frameworks. Unfortunately, such two-phase frameworks can suffer from suboptimality due to the initial phase. To address this issue, we propose leveraging information about the optimal tour lengths of potential clusters as a preliminary step, transforming the two-phase approach into a less myopic solution framework. We introduce quick and highly accurate Traveling Salesperson Problem (TSP) tour length estimators based on neural networks (NNs) to facilitate this. Our approach combines the power of NNs and theoretical knowledge in the routing domain, utilizing a novel feature set that includes node-level, instance-level, and solution-level features. This hybridization of data and domain knowledge allows us to achieve predictions with an average deviation of less than 0.7% from optimality. Unlike previous studies, we design and employ new instances replicating real-life logistics networks and morphologies. These instances possess characteristics that introduce significant computational costs, making them more challenging. To address these challenges, we develop a novel and efficient method for obtaining lower bounds and partial solutions to the TSP, which are subsequently utilized as solution-level predictors. Our computational study demonstrates a prediction error up to six times lower than the best machine learning (ML) methods on their training instances and up to 100 times lower prediction error on out-of-distribution test instances. Furthermore, we integrate our proposed ML models with metaheuristics to create an enumeration-like solution framework, enabling the improved solution of massive scale routing problems. In terms of solution time and quality, our approach significantly outperforms the state-of-the-art solver, demonstrating the potential of our features, models, and the proposed method.Conference ObjectPublication Metadata only Turkish cashier problem with time windows and its solution by Migrating bird optimization algorithm(IEEE, 2023) Bassaleh, Ahmad; Duman, Ekrem; Industrial Engineering; DUMAN, Ekrem; Bassaleh, AhmadA new application of the traveling salesman problem referred to as the Turkish cashier problem (TCP) was recently introduced in literature. The problem revolved around a cashier that must visit several locations and return to his office. To complete his visits, he can use taxis or public transportation and the objective is to minimize the total transportation cost. To make this problem more practical, we took time into consideration by adding a soft time interval for each location obligating the cashier to make his visit within. If he fails to visit within the adequate time, a penalty must be paid. We name this problem as the TCP with time windows (TCPwTW). A metaheuristic algorithm known as the Migrating Birds Optimization (MBO) algorithm coupled with mathematical programming was developed to solve TCPwTW. We attempted to find the exact optimum using an exact solver where for complex problems, optimal solutions cannot be found. The quantitative study reveals that for problems having a loose time interval, the Solver serves as the best approach. On the other hand, for problems having tight time intervals, the best solutions can be obtained by the matheuristic.Book PartPublication Metadata only Post-disaster damage assessment using drones in a remote communication setting(Springer, 2023) Yücesoy, Ecem; Göktürk, Elvin Çoban; Koyuncu, Burcu Balçık; Industrial Engineering; GÖKTÜRK, Elvin Çoban; KOYUNCU, Burcu Balçık; Yücesoy, EcemAfter a disaster event, obtaining fast and accurate information about the damaged built-in structure is crucial for planning life-saving response operations. Unmanned aerial vehicles (UAVs), known otherwise as drones, are increasingly utilized to support damage assessment activities as a part of humanitarian operations. In this study, we focus on a post-disaster setting where the drones are utilized to scan a disaster-affected area to gather information on the damage levels. The affected area is assumed to be divided into grids with varying criticality levels. We consider en-route recharge stations to address battery limitations and remote information transmission to a single operation center. We address the problem of determining the routes of a set of drones across a given assessment horizon to maximize the number of visited grids considering their criticality levels and transmit the collected assessment information as quickly as possible along the routes. We propose a mixed integer linear programming formulation to solve this problem and also adapt it to a setting where the information transmission is only possible at the end of the routes for comparison purposes. We propose performance metrics to evaluate the performance of our model and present results on small-sized instances with sensitivity analysis. We present results that highlight the tradeoff between attained coverage (visiting more grids) and response time (the timing of information transmission in the scanned areas). Moreover, we show the advantage of en-route data transmission compared to the setting with data transmission at the end of the routes.