Endüstri Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942

Browse

Browsing Endüstri Mühendisliği Bölümü Koleksiyonu by Department "Mühendislik Fakültesi, Endüstri Mühendisligi Bölümü"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Book Part
    Citation - WoS: 11
    Quantifying the Grounding Probability in Narrow Waterways
    (CRC Press, 2020) Özlem, Ş.; Altan, Y.C.; Otay, E.N.; Or, I.
    The aim of this paper is to estimate the grounding probability of vessels while navigating in narrowwaterways. In this study, the grounding probability is modelled as a combination the geometric probability, defined as vessel being on a grounding course and the causation probability, defined as the probability that the vessel is unable to avoid a grounding while being on a grounding course. A mathematical model is developed to estimate the geometric probability where the causation probability is estimated through a specially designed Bayesian network. The Strait of Istanbul, one of the narrowest waterways in the world, is used as a test case. The resulting grounding and ramming accidents are 2.8 times the ship collisions. The most critical causes of grounding accidents are the machine failure, steering inadequacy and lack of pilot support, respectively. With different input parameters, the proposed approach may be applied to other narrow waterways. © 2020 Taylor and Francis Group, London.
  • Thumbnail Image
    Article
    Qubo Formulations and Characterization of Penalty Parameters for the Multi-Knapsack Problem
    (IEEE-Inst Electrical Electronics Engineers Inc, 2025) Guney, Evren; Ehrenthal, Joachim; Hanne, Thomas
    The 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.