A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
dc.contributor.author | Ölmez, Ömer Berk | |
dc.contributor.author | Gültekin, Ceren | |
dc.contributor.author | Koyuncu, Burcu Balçık | |
dc.contributor.author | Ekici, Ali | |
dc.contributor.author | Özener, Okan Örsan | |
dc.date.accessioned | 2023-06-14T06:38:44Z | |
dc.date.available | 2023-06-14T06:38:44Z | |
dc.date.issued | 2022-10 | |
dc.identifier.issn | 0377-2217 | en_US |
dc.identifier.uri | http://hdl.handle.net/10679/8397 | |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S0377221721010432 | |
dc.description.abstract | Households produce large amounts of waste cooking oil (WCO), which should be disposed properly to avoid its negative impacts on the environment. Using WCO as raw material in biodiesel production is an effective disposal method. In this study, we focus on designing an efficient WCO collection network, in which households deposit their WCO into the bins to be placed at several collection centers (CCs), which are then regularly collected by capacitated vehicles. We study the problem of determining (i) the number and location of the CCs, (ii) the assignment of households to the CCs, respecting a certain coverage distance threshold, (iii) the number of bins to place at each CC, and (iv) the vehicle routes navigating between the biodiesel facility and CCs to minimize the sum of fixed cost of opening CCs and placing bins at each CC and routing cost. To solve the proposed location-routing problem, we develop a novel matheuristic based on Variable Neighborhood Search, which incorporates an integer programming model to determine the bin allocation and assignment decisions. We evaluate the solution performance of different variants of the proposed algorithm by performing an extensive computational study on a set of hypothetical and case instances. The results show that the proposed matheuristic provides superior solutions with respect to benchmark algorithms. | en_US |
dc.description.sponsorship | DIP program for German–Israeli Cooperation ; Helen and Martin Kimmel Center for Molecular Design ; Minerva Foundation ; Israel Science Foundation | |
dc.language.iso | eng | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.ispartof | European Journal of Operational Research | |
dc.rights | restrictedAccess | |
dc.title | A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem | en_US |
dc.type | Article | en_US |
dc.peerreviewed | yes | en_US |
dc.publicationstatus | Published | en_US |
dc.contributor.department | Özyeğin University | |
dc.contributor.authorID | (ORCID 0000-0002-3575-1846 & YÖK ID 24250) Balçık, Burcu | |
dc.contributor.authorID | (ORCID 0000-0002-9627-4780 & YÖK ID 124801) Ekici, Ali | |
dc.contributor.authorID | (ORCID 0000-0002-9291-1877 & YÖK ID 21945) Özener, Örsan | |
dc.contributor.ozuauthor | Koyuncu, Burcu Balçık | |
dc.contributor.ozuauthor | Ekici, Ali | |
dc.contributor.ozuauthor | Özener, Okan Örsan | |
dc.identifier.volume | 302 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.startpage | 187 | en_US |
dc.identifier.endpage | 202 | en_US |
dc.identifier.wos | WOS:000804759900012 | |
dc.identifier.doi | 10.1016/j.ejor.2021.12.018 | en_US |
dc.subject.keywords | Location routing problem | en_US |
dc.subject.keywords | Logistics | en_US |
dc.subject.keywords | Matheuristics | en_US |
dc.subject.keywords | Variable neighborhood search | en_US |
dc.subject.keywords | Waste cooking oil collection | en_US |
dc.identifier.scopus | SCOPUS:2-s2.0-85122623156 | |
dc.contributor.ozugradstudent | Ölmez, Ömer Berk | |
dc.contributor.ozugradstudent | Gültekin, Ceren | |
dc.relation.publicationcategory | Article - International Refereed Journal - Institutional Academic Staff and 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)
Share this page