Thesis Defense - Ece Nur Balık (MSIE)

Ece Nur Balık – M.Sc. Industrial Engineering

Assoc. Prof. Ali Ekici – Advisor

Date: 23.05.2022

Time: 12:00

Location: AB4 428 - Seminar Room

“Open-End Bin Packing Problem with Conflicts”

  Thesis Committee

Assoc. Prof. Ali Ekici, Özyeğin University

Assoc. Prof. Okan Örsan Özener, Özyeğin University

Assist. Prof. Salih Tekin, TOBB University of Economics & Technology

Abstract:

In this thesis study, we focus on a new variant of the famous Bin Packing Problem (BPP) called the Open-End Bin Packing Problem with Conflicts (OEBPPC) which combines the Open-End Bin Packing Problem (OEBPP) and the Bin Packing Problem with Conflicts (BPPC). In OEBPPC, the aim is to place a set of items into the least number of bins. However, the bin capacity is allowed to be exceeded only by the last item placed in the bin, and there exist conflicts between some item pairs; they cannot be packed into the same bin. We introduce a mathematical formulation and propose lower bounding procedures for our problem. We propose a metaheuristic algorithm, namely Variable Neighborhood Search (VNS), to approach the optimal solution through systematic changes and improvements in the solution. We generate different sets of instances by adapting some instances from the literature to our problem. We compare the performance of our metaheuristic algorithm both against the best lower bound and other algorithms we adapted from the literature as benchmark algorithms. We observe that our proposed metaheuristic outperforms the best benchmark algorithm in 74% of the instances with varying features.

Bio:

Ece Nur Balık graduated from Kadıköy Anatolian High School (KAL) in 2016. She earned her B.Sc. degree in Industrial Engineering from Özyeğin University in June 2020. She has been pursuing her M.Sc. degree in Industrial Engineering at Özyeğin University since October 2020, under the supervision of Dr. Ali Ekici. Her research interests include logistics and supply chain management.