Optimization and Packing Problems

No abstract yet.

Tekstil sektöründe faaliyet gösteren işletmelerde kumaş depolarının çoğu zaman manuel süreçlerle yönetilmesi ve depo alanının verimsiz kullanılması, uzun toplama süreleri ve düşük stok izlenebilirliği gibi problemlere yol açabilmektedir. Çalışmada bir tekstil firmasının kumaş deposu incelenmiştir. Mevcut kumaş miktarı…

Abstract We study an inventory routing problem with time windows (IRPTW). A single supplier serves a set of customers to fulfill their demand throughout a planning horizon. Each customer can be visited only within designated time windows, assuming each customer provides a single delivery time window valid for all peri…

No abstract yet.

No abstract yet.

Constrained knapsack variants are well-suited for QUBO-based quantum optimization, but adding logical relations can inflate the binary model and complicate penalty selection. This work examines the multi-dimensional knapsack problems augmented with conflict, forcing, and precedence (CFP) constraints using Quadratic Un…

The 0/1 knapsack problem is one of the prominent NP-hard binary optimization problems. Solving such problems using exact methods can be computationally expensive. Therefore, metaheuristic methods which offer optimal or near optimal solutions in a reasonable time, are commonly utilized for such tasks. The Hiking Optimi…

Many nature-inspired metaheuristic algorithms proposed in the literature are initially designed to operate in continuous search spaces. However, real-world problems are not limited to continuous domains; they also include discrete, combinatorial, and binary problem types.In this study, the performance of the Secretary…

This study presents the Zebra Optimization Algorithm (ZOA), an innovative approach developed to address the complex optimization challenges associated with the knapsack problem. The knapsack problem, which involves selecting the most valuable items within a given capacity constraint, has a wide range of applications a…

Purpose: This study addresses a real-world container loading problem (CLP) encountered in a logistics company in Turkey, filling a gap in the literature by solving practical constraints using a state-of-the-art algorithm. The problem involves constraints such as rotations, stackability, loading priorities, and mixed l…

No abstract yet.

No abstract yet.