Graduate School of Engineering and Science

Permanent URI for this communityhttps://hdl.handle.net/10679/8952

Browse

Browsing by Institution Author "ALBEY, Erinç"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Placeholder
    Conference ObjectPublicationMetadata 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, Ahmet
    In 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 reserved
  • Placeholder
    Conference ObjectPublicationMetadata 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, Gonca
    In 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.
  • Placeholder
    ArticlePublicationMetadata 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, Taha
    It 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.