Özyeğin University, Çekmeköy Campus Nişantepe District, Orman Street, 34794 Çekmeköy - İSTANBUL

Phone : +90 (216) 564 90 00

Fax : +90 (216) 564 99 99

E-mail: info@ozyegin.edu.tr

Jun 08, 2021 - Jun 10, 2021

Thesis Defense - Ömer Berk Ölmez (MSIE)

 

Ömer Berk Ölmez  M.Sc. Industrial Engineering

Assoc. Prof. Ali Ekici– Advisor

Date: 10.06.2021

Time: 11:45

Location: This meeting will be held ONLINE. Please send an e-mail to gizem.bakir@ozyegin.edu.tr in order to participate in this defense.

 

Multi-Compartment Inventory Routing Problem with Adjustable Compartment Sizes

Thesis Committee:

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

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

Asst.  Prof.  Mehmet Önal, Özyeğin University

Asst.  Prof.  İhsan Yanıkoğlu, Özyeğin University

Assoc.  Prof.  Ertan YakıcıMilli Savunma Üniversitesi

 

 

Abstract:

In this study, we focus on a problem where the supplier manages the customers' inventories and coordinates the distribution of multiple products to customers. Hereby the supplier can minimize the transportation costs by determining distribution routes, frequency of visits and distribution amounts simultaneously in a way that customer demands are satisfied on time. Customers place orders for each day and each product without following any pattern and have separate storage capacities for each product. Multi-compartment vehicles are used to enable different products to be distributed on a single route. We assume to have a fleet of vehicles with a certain number of unit compartments and the capacity dedicated to each product on a route can be adjusted discretely with the use of separators. This compartment structure provides the supplier with flexibility in making distribution plans, while on the other hand makes the problem more challenging since the capacity dedicated to each product on each route emerges as an additional decision to be made. To solve the proposed multi-compartment inventory routing problem we develop a novel Adaptive Large Neighborhood Search based matheuristic. We compare our performance with a benchmark algorithm we adapt from the literature by using an extensive set of instances. We observe that our solution approach outperforms the benchmark algorithm by 24.57% on average.

 

Bio: 

Ömer Berk Ölmez graduated from Maltepe Anatolian High School in 2012. He earned his B.Sc. degree in Industrial Engineering from Özyeğin University in June 2018. He has been pursuing her M.Sc. degree in Industrial Engineering at Özyeğin University since September 2018, under the supervision of Dr. Ali Ekici and Dr. Okan Örsan Özener. His research interests include supply chain management and logistics.