Endüstri Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942
Browse
18 results
Search Results
Article Robust HMM-Based Remaining Useful Life Estimation Using a Ridge-Regularized EM Algorithm(MDPI, 2026-02-18) Kucukdag, Halime Beyza; Kirkil, Gokhan; Hekimoglu, MustafaEstimating the remaining useful life (RUL) of engineering systems is crucial for maintenance planning and the reliability of complex mechanical units. Accurate RUL predictions support timely interventions and help to prevent unexpected failures. This study proposes a statistically robust framework that models degradation signals up to the end of life using a hidden Markov model (HMM) with a simple-failure structure and an absorbing terminal state. The proposed method estimates state-dependent linear emission parameters and transition probabilities using a ridge-regularized expectation-maximization (EM) algorithm. The ridge penalty stabilizes slope estimates under limited data, while a robust Huber-based scale estimator reduces sensitivity to outliers in the sensor-derived health indicator. RUL is computed as a weighted expected time to absorption, combining transient-state survival characteristics with smoothed posterior-state probabilities obtained via the forward-backward algorithm. This yields a low-variance state-aware estimator that preserves the probabilistic structure of the HMM. Simulation studies show that the proposed ridge-regularized EM significantly reduces parameter variance and improves predictive accuracy compared with the baseline weighted least squares EM (WLS-EM). A real-data case analysis demonstrates further improvements in RUL estimation accuracy and smoother, more reliable prediction trajectories. Overall, the framework provides a robust and interpretable approach for practical prognostics applications.Book Part Critical Social Perspectives on Automation and Job Impacts(Elsevier, 2026) Toktaş-Palut, PeralArticle Empowering Electric Vehicle Adoption: Innovative Strategies for Optimizing Charging Station Placement Based on Projected Demand(Wiley, 2025-01-01) Cekyay, Bora; Kabak, Ozgur; Ozaydin, Ozay; Isik, Mine; Toktas-Palut, Peral; Topcu, Y. Ilker; Ulengin, FusunElectric vehicles (EVs) are pivotal for reducing transportation-related emissions; however, the lack of adequate charging infrastructure remains a significant barrier to their widespread adoption. This study presents a comprehensive methodology for optimizing EV charging station placement. It combines a gravity model, scenario analysis, and mixed-integer linear programming (MILP) to ensure a thorough and robust approach. The model aims to maximize accessibility by ensuring both path-level and overall system demand coverage across diverse scenarios, providing reassurance about the validity of the findings. The methodology is tested on the Bursa-& Idot;zmir motorway in Turkey, a strategic intercity route with rapidly growing EV penetration. Results reveal that the optimal configuration involves locating charging stations in seven of the nine service areas. This allocation secures a minimum path coverage ratio of 0.903, meaning 90.3% of the route is covered by charging stations, and an overall demand coverage ratio of 0.935, indicating that 93.5% of total demand is covered across all scenarios. A sensitivity analysis further shows that increasing the network to 45 chargers elevates reachability levels to above 97%, indicating the infrastructure scale required for reliable service quality. The findings underscore the practical applicability of the proposed framework, providing policymakers and infrastructure planners with robust, data-driven guidance for charging network expansion. By integrating demand forecasting with resilient optimization, this study advances both methodological and empirical insights, empowering the audience to make informed decisions for sustainable EV adoption.Article A Comparative Study of Branch-And Algorithms for Vehicle Routing With Time Windows and Waiting Time Costs(Wiley, 2026-02-09) Michelini, Stefano; Kucukaydin, Hande; Arda, YaseminBranch-and-price is one of the most commonly used methodologies for solving routing problems. In recent years, several studies have investigated advanced labeling algorithms to solve the related pricing problem, which is usually a variant of the elementary shortest path problem with resource constraints. Such algorithms include efficient techniques such as decremental state space relaxation, ng-route relaxation, and several hybridizations of these two relaxation methods. In this study, we compare the performance of these labeling algorithms in a branch-and-price framework when applied to the vehicle routing problem with time windows and a variant of this problem in which waiting times have a linear cost. For the latter problem, we also propose an appropriate label structure with associated resource extension functions and dominance rules. We perform these comparisons by using a rigorous methodology, which consists of parameterizing several features of these algorithms, obtaining a good parameter configuration for each algorithm, and analyzing the performance of these configurations on benchmark instances. In order to obtain good configurations, we make use of irace, which is a tool for automated parameter tuning, while statistical tests are used for performance comparisons. Our results show that a class of hybrid algorithms with certain features based on ng-route relaxation outperforms all the others.Article Anomali Tespiti ve Suistimal Önleme: Telekomünikasyon Sektöründe Bir Uygulama(2025-12-19) Koç, Utku; Bulut, Özgür; Özalanyalı, ÖzgeBu çalışmada, telekom sektöründeki satış kanallarında ortaya çıkan anomalilerin tespitine ve suistimal olabilecek durumların engellenmesine yönelik istatistiksel bir yöntem geliştirilmiştir. Yöntemin geliştirilmesi ve test edilmesi sürecinde 371 farklı satış kanalına ait 9 aylık tüm satış bilgileriyle 340 binden fazla gerçek veri noktası kullanılmıştır. Anomali tespitinde en çok karşılaşılan engellerden biri yöntemin anomali olarak işaretlediği noktaların gerçekten anomali olup olmadığının teyit edilmesindeki zorluktur. Her bir kanalın kendi kontrol grubunu oluşturduğu bu çalışmada ise yöntemin anomali olarak işaretlediği noktaların gerçekten bir anomali olup olmadığı ilgili iş birimi tarafından değerlendirilmiş ve teyit edilmiştir. Her bir satış kanalı için günlük güven aralıkları ayrı ayrı hesaplanmış ve bu aralığın dışına çıkan durumlara hızlı tepki veren bir yöntem kullanılarak olası suistimallerin önüne geçilmiştir. Elde edilen bulgular, önerilen yöntemin anomali tespitinde başarılı olduğunu ve satış süreçlerindeki potansiyel suistimallerin önüne geçtiğini ve dolayısıyla müşteri memnuniyetini artırdığını göstermektedir. Geliştirilen yöntem yüksek performans ve ölçeklenebilirliği sağlamak için çoklu mimari yapısında uygulamaya alınmıştır. Geliştirilen yöntem ve uygulama, güvenlik ve veri bütünlüğü konularında da önemli avantajlar sunmaktadır. İlgili iş birimlerinin hızlı ve etkili kararlar alabilmesi, organizasyonun genel risk yönetimi stratejisine büyük katkı sağlamaktadır. Bu sayede, potansiyel tehditler zamanında tespit edilerek işletmenin güvenlik standartları korunmakta ve sürdürülebilir bir operasyonel çevre yaratılmaktadır. Ayrıca, projenin teknik yapısı anomali tespit sisteminin sürekli iyileştirilmesi hem yazılımın performansını artıracak hem de daha ileri düzeyde veri analizi imkanı sunacaktır. Sonuçlar, telekom şirketlerinin stratejik karar alma süreçlerine önemli katkılarda bulunarak rekabet avantajı sağlamalarına yardımcı olmaktadır.Article Citation - WoS: 3Citation - Scopus: 5Qubo Formulations and Characterization of Penalty Parameters for the Multi-Knapsack Problem(IEEE-Inst Electrical Electronics Engineers Inc, 2025) Guney, Evren; Ehrenthal, Joachim; Hanne, ThomasThe Multi-Knapsack Problem (MKP) is a fundamental challenge in operations research and combinatorial optimization. Quantum computing introduces new possibilities for solving MKP using Quadratic Unconstrained Binary Optimization (QUBO) models. However, a key challenge in QUBO formulations is the selection of penalty parameters, which directly influence solution feasibility and algorithm performance. In this work, we develop QUBO formulations for two MKP variants-the Multidimensional Knapsack Problem (MDKP) and the Multiple Knapsack Problem (MUKP)-and provide an algebraic characterization of their penalty parameters. We systematically evaluate their impact through quantum simulation experiments and compare the performance of the two leading quantum optimization approaches: Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing, alongside a state-of-the-art classical solver. Our results indicate that while classical solvers remain superior, careful tuning of penalty parameters has a strong impact on quantum optimization outcomes. QAOA is highly sensitive to parameter choices, whereas quantum annealing produces more stable results on small to mid-sized instances. Further, our results reveal that MDKP instances can maintain feasibility at penalty values below theoretical bounds, while MUKP instances show greater sensitivity to penalty reductions. Finally, we outline directions for future research in solving MKP, including adaptive penalty parameter tuning, hybrid quantum-classical approaches, and practical optimization strategies for QAOA, as well as real-hardware evaluations.Article Citation - WoS: 1Facial Emotion Recognition Using Residual Neural Networks(Aves, 2024-11-08) Kırbız, SerapFacial emotion recognition (FER) has been an emerging research topic in recent years. Recent automatic FER systems generally apply deep learning methods and focus on two important issues: lack of sufficient labeled training data and variations in images such as illumination, pose, or expression-related variations among different cultures. Although Convolutional Neural Networks (CNNs) are widely used in automatic FER, they cannot be used when the number of layers is large. Therefore, a residual technique is applied to CNNs and this architecture is named residual neural network. In this paper, an automatic facial emotion recognition method using residual networks with random data augmentation is proposed on a merged FER dataset consisting of 41,598 facial images of size 48 × 48 pixels from seven basic emotion classes. Experimental results show that ResNet34 with data augmentation performs better than CNN with a classification accuracy of 81%.Book Part Citation - Scopus: 1Interval Valued Intuitionistic Fuzzy Z Extensions of Ahp&codas: Comparison of Energy Storage Alternatives(Springer, 2023) Sergi, Duygu; Sarı, İrem Uçal; Ucal Sari, IremEnergy storage technologies are receiving increasing attention due to the trend toward renewable energy sources. Energy storage systems are a promising technology as they provide the low carbon emissions needed in the future, contribute to renewable energy production, and offer an alternative to petroleum-derived fuels. It is not possible to say precisely how the energy will be stored, and often more than one method must be used together. In this study, battery technologies from electrochemical energy storage systems are discussed. This chapter proposes a multi-criteria decision-making (MCDM) model combining fuzzy IVIF-Z-AHP and fuzzy IVIF-Z-CODAS methods to choose the optimal battery ESS. The priority weights of 4 main and 11 sub-criteria related to energy storage efficiency are determined using the IVIF-Z-AHP method. After that, 5 different batteries are evaluated using the IVIF-Z-CODAS method, and the most appropriate battery ESS is selected by doing a performance evaluation regarding the storage of energy at maximum efficiency.Article Citation - WoS: 1Citation - Scopus: 2A Decomposition Algorithm for Single and Multiobjective Integrated Market Selection and Production Planning(Informs, 2023-11-01) van den Heuvel, Wilco; Ağralı, Semra; Taşkın, Z. CanerWe study an integrated market selection and production planning problem. There is a set of markets with deterministic demand, and each market has a certain revenue that is obtained if the market's demand is satisfied throughout a planning horizon. The demand is satisfied with a production scheme that has a lot-sizing structure. The problem is to decide on which markets' demand to satisfy and plan the production simultaneously. We consider both single and multiobjective settings. The single objective problem maximizes the profit, whereas the multiobjective problem includes the maximization of the revenue and the minimization of the production cost objectives. We develop a decomposition-based exact solution algorithm for the single objective setting and show how it can be used in a proposed three-phase algorithm for the multiobjective setting. The master problem chooses a subset of markets, and the subproblem calculates an optimal production plan to satisfy the selected markets' demand. We investigate the subproblem from a cooperative game theory perspective to devise cuts and strengthen them based on lifting. We also propose a set of valid inequalities and preprocessing rules to improve the proposed algorithm. We test the efficacy of our solution method over a suite of problem instances and show that our algorithm substantially decreases solution times for all problem instances.Article Citation - WoS: 62Citation - Scopus: 65Extension of Capital Budgeting Techniques Using Interval-Valued Fermatean Fuzzy Sets(IOS Press, 2021-12-31) Sergi, Duygu; Sarı, İrem Uçal; Senapati, TapanCapital budgeting requires dealing with high uncertainty from the unknown characteristics of cash flow, interest rate, and study period forecasts for future periods. Many fuzzy extensions of capital budgeting techniques have been proposed and used in a wide range of applications to deal with uncertainty. In this paper, a new fuzzy extension of the most used capital budgeting techniques is proposed. In this content, first interval-valued Fermatean fuzzy sets (IVFFS s) are defined, and the algebraic and aggregation operations are determined for interval-valued Fermatean fuzzy (IVFF) numbers. The formulations of IVFF net present value, IVFF equivalent uniform annual value, and IVFF benefit-cost ratio (B/C) methods are generated. To validate the proposed methods, proposed formulations are illustrated with a hypothetical example, and the results are compared with classical fuzzy capital budgeting techniques.