Multi-compartment inventory routing problem with adjustable compartment sizes
dc.contributor.author | Ölmez, Ömer Berk | |
dc.date.accessioned | 2021-09-30T12:32:52Z | |
dc.date.available | 2021-09-30T12:32:52Z | |
dc.date.issued | 2021-06-10 | |
dc.identifier.uri | http://hdl.handle.net/10679/7587 | |
dc.identifier.uri | https://tez.yok.gov.tr | |
dc.identifier.uri | http://discover.ozyegin.edu.tr/iii/encore/record/C__Rb4501501?lang=eng | |
dc.description | Thesis (M.A.)--Özyeğin University, Graduate School of Sciences and Engineering, Department of Industrial Engineering, June 2021. | |
dc.description.abstract | In this study, we focus on a problem where the supplier manages the customers’ in ventories 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 Neigh borhood 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. | en_US |
dc.description.abstract | Bu ¸calı¸smada, tek bir tedarik¸cinin m¨u¸sterilerin envanterini y¨onetti˘gi ve birden fazla ¨ur¨un¨un da˘gıtımını koordine etti˘gi bir problem ¨uzerine yo˘gunla¸smaktayız. B¨oylece tedarik¸ci m¨u¸sterilerin talepleri zamanında kar¸sılanacak ¸sekilde da˘gıtım rotalarını, zi yaretlerin sıklı˘gını ve da˘gıtım miktarlarını e¸s zamanlı bir ¸sekilde belirleyerek ula¸sım maliyetini en azlayabilmektedir. M¨u¸steri talepleri her bir g¨un ve ¨ur¨un i¸cin rast gele olu¸sturulmu¸stur ve m¨u¸steriler her bir ¨ur¨un i¸cin belirli bir stoklama kapasitesine sahiptir. Farklı ¨ur¨unlerin tek rotada da˘gıtımına imkan sa˘glayan ¸cok b¨olmeli ara¸clar kullanılmı¸stır. Her ara¸c belirli sayıda birim b¨olmeden olu¸sur ve ara¸clarda bulunan ayra¸clar kullanılarak her bir rotada her bir ¨ur¨une ayrılacak olan kapasite kesintili bir ¸sekilde ayarlanabilmektedir. Bu b¨olme yapısı tedarik¸ciye, da˘gıtım planı yaparken es neklik tanısa da ¨ote yandan her bir rotada her bir ¨ur¨une ayrılacak kapasite, verilmesi gereken ekstra bir karar olarak kar¸sımıza ¸cıktı˘gı i¸cin problemi zorla¸stırmaktadır. Bu ¸cok b¨olmeli envanter rotalama problemini ¸c¨ozmek i¸cin Uygulanabilir Geni¸s Kom¸suluk Araması tabanlı bir mat-sezgisel y¨ontem sunmaktayız. Geni¸s ¸caplı bir dizi veri k¨umesi kullanarak literat¨urden uyarladı˘gımız bir kıyaslama algoritması ile algorit mamızı kar¸sıla¸stırdık. C¸ ¨oz¨um y¨ontemimizin buldu˘gu sonu¸cların kıyaslama algorit masının buldu˘gu sonu¸clardan ortalamada %24.57 daha iyi oldu˘gu g¨ozlenmi¸tir. | |
dc.language.iso | eng | en_US |
dc.rights | restrictedAccess | |
dc.title | Multi-compartment inventory routing problem with adjustable compartment sizes | en_US |
dc.title.alternative | Ayarlanabilir bölme boyutları ile çok bölmeli envanter rotalama problemi | |
dc.type | Master's thesis | en_US |
dc.contributor.advisor | Ekici, Ali | |
dc.contributor.committeeMember | Ekici, Ali | |
dc.contributor.committeeMember | Yanıkoğlu, İhsan | |
dc.contributor.committeeMember | Özener, Okan Örsan | |
dc.contributor.committeeMember | Önal, Mehmet | |
dc.contributor.committeeMember | Yakıcı, E. | |
dc.publicationstatus | Unpublished | en_US |
dc.contributor.department | Özyeğin University | |
dc.contributor.ozugradstudent | Ölmez, Ömer Berk | |
dc.contributor.authorMale | 1 | |
dc.relation.publicationcategory | Thesis - Institutional Graduate Student |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Master's Theses
This Collection covers master's thesis produced at Özyeğin University
Share this page