Publication: Dynamic facility location with supplier selection under quantity discount
dc.contributor.author | Emirhüseyinoğlu, Görkem | |
dc.contributor.author | Ekici, Ali | |
dc.contributor.department | Industrial Engineering | |
dc.contributor.ozuauthor | EKİCİ, Ali | |
dc.contributor.ozugradstudent | Emirhüseyinoğlu, Görkem | |
dc.date.accessioned | 2020-07-06T10:24:53Z | |
dc.date.available | 2020-07-06T10:24:53Z | |
dc.date.issued | 2019-08 | |
dc.description.abstract | Retailers have to consider several factors when making facility location decisions including suppliers' and customers' locations, customer demand and price offered by suppliers. In this study, we analyze the multi-period facility location decisions of a retailer which procures the products from multiple suppliers under an incremental quantity discount scheme and in turn satisfies an exogenous demand. The retailer decides (i) where and when to open a facility, (ii) how much to order from each supplier in each time period, and (iii) from which facility locations to satisfy the demand. We formulate the problem as a mixed-integer mathematical model. To handle large instances, we develop a decomposition-based solution approach which considers the decisions in the first echelon (suppliers and facilities) and the second echelon (facilities and customers) in an iterative manner until convergence. We propose two implementations of the proposed solution approach. The first one limits the search space by considering only a subset of the facility locations for each customer. In the second implementation of the proposed solution approach, we develop a novel two-phase strategy where we first eliminate some of the facility locations entirely from the problem using a simplified version of the first approach and then implement the first approach to the reduced set of facility locations. We demonstrate the effectiveness of the heuristic approaches through an extensive computational study. The proposed heuristics provide significantly better results compared to a simple heuristic inspired by a related study. Moreover, we observe that for small instances both heuristics provide solutions with quite low optimality gaps and for larger instances they find better solutions in less amount of time when compared against CPLEX results obtained within a 12-h time limit. | en_US |
dc.identifier.doi | 10.1016/j.cie.2019.05.023 | en_US |
dc.identifier.endpage | 74 | en_US |
dc.identifier.issn | 0360-8352 | en_US |
dc.identifier.scopus | 2-s2.0-85067926167 | |
dc.identifier.startpage | 64 | en_US |
dc.identifier.uri | http://hdl.handle.net/10679/6706 | |
dc.identifier.uri | https://doi.org/10.1016/j.cie.2019.05.023 | |
dc.identifier.volume | 134 | en_US |
dc.identifier.wos | 000474493600006 | |
dc.language.iso | eng | en_US |
dc.peerreviewed | yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.ispartof | Computers and Industrial Engineering | |
dc.relation.publicationcategory | International Refereed Journal | |
dc.rights | restrictedAccess | |
dc.subject.keywords | Dynamic facility location | en_US |
dc.subject.keywords | Supplier selection | en_US |
dc.subject.keywords | Quantity discount | en_US |
dc.subject.keywords | Iterative algorithm | en_US |
dc.title | Dynamic facility location with supplier selection under quantity discount | en_US |
dc.type | article | en_US |
dspace.entity.type | Publication | |
relation.isOrgUnitOfPublication | 5dd73c02-fd2d-43e0-9a23-71bab9ae0b6b | |
relation.isOrgUnitOfPublication.latestForDiscovery | 5dd73c02-fd2d-43e0-9a23-71bab9ae0b6b |
Files
License bundle
1 - 1 of 1
- Name:
- license.txt
- Size:
- 1.45 KB
- Format:
- Item-specific license agreed upon to submission
- Description: