Endüstri Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942
Browse
17 results
Search Results
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 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: 1Citation - Scopus: 3Evaluation of Learning Management Systems Using Interval Valued Intuitionistic Fuzzy-Z Numbers(Anadolu Üniversitesi, 2023-10-01) Ucal Sarı, İrem; Sergi, Duygu; Sari, Irem UcalThe use of online education tools has increased rapidly with the transition to distance education caused by the pandemic. The obligation to carry out all activities of face-to-face education online made it very important for the tools used in distance education to meet the increasing needs. In line with these needs, radical changes have occurred in the learning management systems used in distance education. Therefore, in this study, it is aimed to determine the features that the systems used in distance education should have and to compare the existing systems according to these features. For this purpose, a novel fuzzy extension, interval valued intuitionistic fuzzy Z-numbers, is defined for modeling uncertainty, and AHP and WASPAS methods using proposed fuzzy numbers are developed to determine the importance of decision criteria and compare alternatives.Article Citation - WoS: 9Citation - Scopus: 15Mixcycle: Unsupervised Speech Separation Via Cyclic Mixture Permutation Invariant Training(IEEE, 2022) Karamatlı, Ertuğ; Kırbız, SerapWe introduce two unsupervised source separation methods, which involve self-supervised training from single-channel two-source speech mixtures. Our first method, mixture permutation invariant training (MixPIT), enables learning a neural network model which separates the underlying sources via a challenging proxy task without supervision from the reference sources. Our second method, cyclic mixture permutation invariant training (MixCycle), uses MixPIT as a building block in a cyclic fashion for continuous learning. MixCycle gradually converts the problem from separating mixtures of mixtures into separating single mixtures. We compare our methods to common supervised and unsupervised baselines: permutation invariant training with dynamic mixing (PIT-DM) and mixture invariant training (MixIT). We show that MixCycle outperforms MixIT and reaches a performance level very close to the supervised baseline (PIT-DM) while circumventing the over-separation issue of MixIT. Also, we propose a self-evaluation technique inspired by MixCycle that estimates model performance without utilizing any reference sources. We show that it yields results consistent with an evaluation on reference sources (LibriMix) and also with an informal listening test conducted on a real-life mixtures dataset (REAL-M).Article Citation - WoS: 5Citation - Scopus: 12Predicting Cash Holdings Using Supervised Machine Learning Algorithms(Springer, 2022-05-18) Özlem, Şirin; Tan, Ömer FarukThis study predicts the cash holdings policy of Turkish firms, given the 20 selected features with machine learning algorithm methods. 211 listed firms in the Borsa Istanbul are analyzed over the period between 2006 and 2019. Multiple linear regression (MLR), k-nearest neighbors (KNN), support vector regression (SVR), decision trees (DT), extreme gradient boosting algorithm (XGBoost) and multi-layer neural networks (MLNN) are used for prediction. Results reveal that MLR, KNN, and SVR provide high root mean square error (RMSE) and low R2 values. Meanwhile, more complex algorithms, such as DT and especially XGBoost, derive higher accuracy with a 0.73 R2 value. Therefore, using advanced machine learning algorithms, we may predict cash holdings considerably.Article Citation - WoS: 54Citation - Scopus: 57Branch-And Methods for the Electric Vehicle Routing Problem With Time Windows(Taylor and Francis, 2021-07-31) Çatay, Bülent; Duman, Ece Naz; Taş, DuyguIn this paper, we address the electric vehicle routing problem with time windows and propose two branch-and-price-and-cut methods based on a column generation algorithm. One is an exact algorithm whereas the other is a heuristic method. The pricing sub-problem of the column generation method is solved using a label correcting algorithm. The algorithms are strengthened with the state-of-the-art acceleration techniques and a set of valid inequalities. The acceleration techniques include: (i) an intermediate column pool to prevent solving the pricing sub-problem at each iteration, (ii) a label correcting method employing the ng-route algorithm adopted to our problem, (iii) a bidirectional search mechanism in which both forward and backward labels are created, (iv) a procedure for dynamically eliminating arcs that connect customers to remote stations from the network during the path generation, (v) a bounding procedure providing early elimination of sub-optimal routes, and (vi) an integer programming model that generates upper bounds. Numerical experiments are conducted using a benchmark data set to compare the performances of the algorithms. The results favour the heuristic algorithm in terms of both the computational time and the number of instances solved. Moreover, the heuristic algorithm is shown to be specifically effective for larger instances. Both algorithms introduce a number of new solutions to the literature.Article Citation - WoS: 30Citation - Scopus: 42Prioritization of Public Services for Digitalization Using Fuzzy Z-Ahp and Fuzzy Z-Waspas(Springer, 2021-01-03) Ucal Sarı, İrem; Sergi, DuyguIn this paper, public services are analyzed for implementations of Industry 4.0 tools to satisfy citizen expectations. To be able to prioritize public services for digitalization, fuzzy Z-AHP and fuzzy Z-WASPAS are used in the analysis. The decision criteria are determined as reduced cost, fast response, ease of accessibility, reduced service times, increase in the available information and increased quality. After obtaining criteria weights using fuzzy Z-AHP, health care services, waste disposal department, public transportation, information services, social care services, and citizen complaints resolution centers are compared using fuzzy Z-WASPAS that is proposed for the first time in this paper. Results show that health care services have dominant importance for the digitalization among public services.Article Citation - WoS: 35Citation - Scopus: 36Large-Scale Influence Maximization Via Maximal Covering Location(Elsevier, 2021-02-01) Güney, Evren; Ruthmair, Mario; Sinnl, Markus; Leitner, MarkusInfluence maximization aims at identifying a limited set of key individuals in a (social) network which spreads information based on some propagation model and maximizes the number of individuals reached. We show that influence maximization based on the probabilistic independent cascade model can be modeled as a stochastic maximal covering location problem. A reformulation based on Benders decomposition is proposed and a relation between obtained Benders optimality cuts and submodular cuts for correspondingly defined subsets is established. We introduce preprocessing tests, which allow us to remove variables from the model and develop efficient algorithms for the separation of Benders cuts. Both aspects are shown to be crucial ingredients of the developed branch-and-cut algorithm since real-life social network instances may be very large. In a computational study, the considered variants of this branch-and-cut algorithm outperform the state-of-the-art approach for influence maximization by orders of magnitude.Article An Efficient Linear Programming Based Method for the Influence Maximization Problem in Social Networks (vol 503, Pg 589, 2019)(Elsevier, 2020-02-01) Güney, EvrenThe influence maximization problem (IMP) aims to determine the most influential individuals within a social network. In this study first we develop a binary integer program that approximates the original problem by Monte Carlo sampling. Next, to solve IMP efficiently, we propose a linear programming relaxation based method with a provable worst case bound that converges to the current state-of-the-art 1-1/e bound asymptotically. Experimental analysis indicate that the new method is superior to the state-of-the-art in terms of solution quality and this is one of the few studies that provides approximate optimal solutions for certain real life social networks.Article Citation - WoS: 6Citation - Scopus: 6A Strong Integer Programming Formulation for Hybrid Flowshop Scheduling(Taylor & Francis, 2019-09-09) Ağralı, Semra; Ünal, A. Tamer; Taşkın, Z. CanerWe consider a hybrid flowshop scheduling problem that includes parallel unrelated discrete machines or batch processing machines in different stages of a production system. The problem is motivated by a bottleneck process within the production system of a transformer producer located in the Netherlands. We develop an integer programming model that minimises the total tardiness of jobs over a finite planning horizon. Our model is applicable to a wide range of production systems organised as hybrid flowshops. We strengthen our integer program by exploiting the special properties of some constraints in our formulation. We develop a decision support system (DSS) based on our proposed optimisation model. We compare the results of our initial optimisation model with an improved formulation as well as with a heuristic that was in use at the company before the implementation of our DSS. Our results show that the improved optimisation model significantly outperforms the heuristic and the initial optimisation model in terms of both the solution time and the strength of its linear programming relaxation.